( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic Convex Hulls for Simple Paths.

, , and . SoCG, volume 293 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

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)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)On the adaptiveness of quicksort, , and . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, page 130--149. (2005)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)External Memory Fully Persistent Search Trees., , and . STOC, page 1410-1423. ACM, (2023)Cache oblivious search trees via binary trees of small height., , and . SODA, page 39-48. ACM/SIAM, (2002)Cache-oblivious string dictionaries., and . SODA, page 581-590. ACM Press, (2006)Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)., , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 26-37. Springer, (2014)Optimal Resilient Dynamic Dictionaries., , , , , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 347-358. Springer, (2007)