Author of the publication

Generating Random Regular Graphs Quickly.

, and . Combinatorics, Probability & Computing, 8 (4): 377-396 (1999)

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.

 

Other publications of authors with the same name

Optimal Algorithms for k-Search with Application in Option Pricing., , and . Algorithmica, 55 (2): 311-328 (2009)On the structure of clique-free graphs., , and . Random Struct. Algorithms, 19 (1): 37-53 (2001)Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries., , , , and . Theor. Comput. Sci., 261 (1): 119-156 (2001)Pegging Graphs Yields a Small Diameter., , and . Combinatorics, Probability & Computing, 20 (2): 239-248 (2011)Upper Bounds for Online Ramsey Games in Random Graphs., , and . Combinatorics, Probability & Computing, 18 (1-2): 259-270 (2009)Generating Random Regular Graphs Quickly., and . Combinatorics, Probability & Computing, 8 (4): 377-396 (1999)Probabilistically checkable proofs and their consequences for approximation algorithms., , and . Discrete Mathematics, 136 (1-3): 175-223 (1994)Counting H-free graphs., and . Discrete Mathematics, 154 (1-3): 311-315 (1996)Approximability of Scheduling with Fixed Jobs., , and . SODA, page 961-962. ACM/SIAM, (1999)Random directed graphs are robustly Hamiltonian., , and . Random Struct. Algorithms, 49 (2): 345-362 (2016)