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.

 

Other publications of authors with the same name

On the Analysis of Linear Probing Hashing., , and . Algorithmica, 22 (4): 490-515 (1998)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)Permuting in Place., , and . SIAM J. Comput., 24 (2): 266-278 (1995)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)Searchability in Merging and Implicit Data Structures., and . BIT, 27 (3): 324-329 (1987)Robin Hood Hashing really has constant average search cost and variance in full tables., and . CoRR, (2016)Analysis of the Expected Search Cost in Skip Lists., , and . SWAT, volume 447 of Lecture Notes in Computer Science, page 160-172. Springer, (1990)The Analysis of a Fringe Heuristic for Binary Search Trees., and . J. Algorithms, 6 (3): 336-350 (1985)Fault Tolerance and Storage Reduction in Binary Search Trees, and . Inf. Control., 62 (2/3): 210-218 (August 1984)