Author of the publication

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.

, and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 637-649. Springer, (2014)

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

Wrapping spheres with flat paper., , , and . Comput. Geom., 42 (8): 748-757 (2009)Alternatives to splay trees with O(log n) worst-case access times.. SODA, page 516-522. ACM/SIAM, (2001)Key Independent Optimality.. ISAAC, volume 2518 of Lecture Notes in Computer Science, page 25-31. Springer, (2002)Range Minimum Query Indexes in Higher Dimensions., , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 149-159. Springer, (2015)Grid Vertex-Unfolding Orthostacks., , and . JCDCG, volume 3742 of Lecture Notes in Computer Science, page 76-82. Springer, (2004)Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not., and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 637-649. Springer, (2014)Competitive Online Search Trees on Trees., , , , and . SODA, page 1878-1891. SIAM, (2020)The Complexity of Order Type Isomorphism., , , , and . SODA, page 405-415. SIAM, (2014)Subquadratic Encodings for Point Configurations., , , , and . SoCG, volume 99 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Mergeable Dictionaries., and . Data Structures, volume 10091 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)