Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

apl. Prof. Dr. Thomas Sottmann University of Stuttgart

Data for 'Adjustable polystyrene nanoparticle templates for the production of mesoporous foams and ZnO inverse opals', , , , , and . Dataset, (2024)Related to: Abitaev, Karina; Qawasmi, Yaseen; Atanasova, Petia; Dargel, Carina; Bill, Joachim; Hellweg, Thomas; Sottmann, Thomas: Adjustable polystyrene nanoparticle templates for the production of mesoporous foams and ZnO inverse opals. In: Colloid and Polymer Science 299 (2021), 243-258. doi: 10.1007/s00396-020-04791-5.
 

Other publications of authors with the same name

Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning., and . Algorithmica, 64 (3): 329-361 (2012)Faster Rumor Spreading With Multiple Calls., , and . Electr. J. Comb., 22 (1): P1.23 (2015)Distributed Selfish Load Balancing on Networks., , and . SODA, page 1487-1497. SIAM, (2011)Smoothed Analysis of Balancing Networks., , and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 472-483. Springer, (2009)Counting Arbitrary Subgraphs in Data Streams., , , and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 598-609. Springer, (2012)Randomized Load Balancing on Networks with Stochastic Inputs., and . ICALP, volume 80 of LIPIcs, page 139:1-139:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Multiple Random Walks on Paths and Grids., , , and . STACS, volume 66 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Asymptotic bounds on the equilateral dimension of hypercubes., , and . CoRR, (2014)Ultra-fast rumor spreading in social networks., , and . SODA, page 1642-1660. SIAM, (2012)Balls into bins via local search: Cover time and maximum load., , , and . Random Struct. Algorithms, 48 (4): 681-702 (2016)