Random Structures and Algorithms

Tibor Szabó

Institute of Mathematics
Freie Universität Berlin

The tremendous success of the probabilistic method in combinatorics and the development of randomized algorithms in computer science naturally brought along the independent study of random graphs (or other finite structures). The papers below are a somewhat random selection from the topics above.

Valid HTML 4.0! Last modified: Sun Jun 30 23:01:16 CEST 2013