( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.

. STACS, volume 47 of LIPIcs, page 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Miriam Stölting

Stephanie Stölting

Nathalie Stölting

Jürgen Stölting

Cécile Stölting

 

Other publications of authors with the same name

Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees., and . ESA, volume 87 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree., , , , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 101-110. Imperial College Press, (2007)Worst-Case Efficient Priority Queues.. SODA, page 52-58. ACM/SIAM, (1996)Cache Oblivious Algorithms for Computing the Triplet Distance between Trees., and . ACM J. Exp. Algorithmics, (2021)Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs., , , , , and . SODA, page 1448-1456. SIAM, (2010)Selecting Sums in Arrays., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 100-111. Springer, (2008)External Memory Fully Persistent Search Trees., , and . STOC, page 1410-1423. ACM, (2023)On the adaptiveness of Quicksort., , and . ACM Journal of Experimental Algorithmics, (2008)Comparator Networks for Binary Heap Construction., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 158-168. Springer, (1998)Fault Tolerant External Memory Algorithms., , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 411-422. Springer, (2009)