( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
Path Minima Queries in Dynamic Weighted Trees.

, , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 290-301. Springer, (2011)

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

On the adaptiveness of quicksort, , and . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, page 130--149. (2005)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)Worst-Case Efficient Priority Queues.. SODA, page 52-58. ACM/SIAM, (1996)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)Counting in the Presence of Memory Faults., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 842-851. Springer, (2009)Comparator Networks for Binary Heap Construction., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 158-168. Springer, (1998)On the adaptiveness of Quicksort., , and . ACM Journal of Experimental Algorithmics, (2008)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)