Author of the publication

Trade-Offs between Density and Robustness in Random Interconnection Graphs.

, , , and . IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 152-168. Springer, (2000)

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

Partial match retrieval of multidimensional data., and . J. ACM, 33 (2): 371-407 (1986)Ambiguity and Transcendence.. ICALP, volume 194 of Lecture Notes in Computer Science, page 179-188. Springer, (1985)Random Allocations and Probabilistic Languages., , and . ICALP, volume 317 of Lecture Notes in Computer Science, page 239-253. Springer, (1988)Exact Asymptotics of Divide-and-Conquer Recurrences., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 137-149. Springer, (1993)Some exactly solvable models of urn process theory, , and . Proceedings of Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, page 59--118. (2006)Motif Statistics., , and . ESA, volume 1643 of Lecture Notes in Computer Science, page 194-211. Springer, (1999)Elements of a general theory of combinatorial structures.. FCT, volume 199 of Lecture Notes in Computer Science, page 112-127. Springer, (1985)Trade-Offs between Density and Robustness in Random Interconnection Graphs., , , and . IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 152-168. Springer, (2000)The Number of Symbol Comparisons in QuickSort and QuickSelect., , , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 750-763. Springer, (2009)Exploring Binary Trees and Other Simple Trees, and . FOCS, page 207-216. IEEE Computer Society, (1980)