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

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs., and . ESA, volume 112 of LIPIcs, page 63:1-63:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Space-Efficient Data Structures for Lattices., , and . SWAT, volume 162 of LIPIcs, page 31:1-31:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sorting Multisets and Vectors In-Place., and . WADS, volume 519 of Lecture Notes in Computer Science, page 473-480. Springer, (1991)The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform., and . J. Algorithms, 5 (4): 451-470 (1984)Adaptive set intersections, unions, and differences., , and . SODA, page 743-752. ACM/SIAM, (2000)Structure, Scoring and Purpose of Computing Competitions., , , and . Informatics Educ., 5 (1): 15-36 (2006)Average Search and Update Costs in Skip Lists., , and . BIT, 32 (2): 316-332 (1992)Optimum Reorganization Points for Arbitrary Database Costs., , and . Acta Informatica, (1982)Top-k Term-Proximity in Succinct Space., , , , and . Algorithmica, 78 (2): 379-393 (2017)Succinct encoding of arbitrary graphs., and . Theor. Comput. Sci., (2013)