Author of the publication

The soft heap: an approximate priority queue with optimal error rate.

. J. ACM, 47 (6): 1012-1027 (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

Convex Decompositions of Polyhedra. STOC, page 70-79. ACM, (1981)A Model of Computation for VLSI with Related Complexity Results, and . STOC, page 318-325. ACM, (1981)Sublinear geometric algorithms., , and . STOC, page 531-540. ACM, (2003)Lower bounds for linear degeneracy testing., and . STOC, page 554-560. ACM, (2004)The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors., and . SIAM J. Comput., 39 (1): 302-322 (2009)Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems., , and . Algorithmica, 8 (5&6): 407-429 (1992)The soft heap: an approximate priority queue with optimal error rate.. J. ACM, 47 (6): 1012-1027 (2000)Self-Sustaining Iterated Learning., and . ITCS, volume 67 of LIPIcs, page 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Deterministic sampling and optimization.. System Modelling and Optimization, volume 197 of Lecture Notes in Control and Information Sciences, page 42-54. Springer, (1993)Sublinear Computing.. ESA, volume 2832 of Lecture Notes in Computer Science, page 1. Springer, (2003)