Author of the publication

The Chilean Internet Connection, or, I Never Promised You a Rose Garden

, , and . Proc. INET '93, (1993)Available at URL: ftp: //gopher.econ.lsa.umich.edu/pub/Archive/Chile.ps.Z.

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

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)., , and . WADS, volume 519 of Lecture Notes in Computer Science, page 1-12. Springer, (1991)A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance., , , and . STACS, volume 480 of Lecture Notes in Computer Science, page 296-308. Springer, (1991)Searchability in Merging and Implicit Data Structures., and . ICALP, volume 154 of Lecture Notes in Computer Science, page 527-535. Springer, (1983)The Chilean Internet Connection, or, I Never Promised You a Rose Garden, , and . Proc. INET '93, (1993)Available at URL: ftp: //gopher.econ.lsa.umich.edu/pub/Archive/Chile.ps.Z.The Binomial Transform and its Application to the Analysis of Skip Lists., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 554-569. Springer, (1995)An Implicit Binomial Queue with Constant Insertion Time., , and . SWAT, volume 318 of Lecture Notes in Computer Science, page 1-13. Springer, (1988)Permuting, , and . FOCS, page 372-379. IEEE Computer Society, (1990)Average Search and Update Costs in Skip Lists., , and . BIT, 32 (2): 316-332 (1992)A Discipline for Robustness or Storage Reduction in Binary Search Trees., and . PODS, page 70-75. ACM, (1983)A Note on the Height of The kthe Element in a Heap.. BIT, 33 (3): 411-412 (1993)