( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees.

, and . ACM J. Exp. Algorithmics, (2021)

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

Nathalie Stölting

Stephanie 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 . ACM J. Exp. Algorithmics, (2021)Worst-Case Efficient Priority Queues.. SODA, page 52-58. ACM/SIAM, (1996)Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs., , , , , and . SODA, page 1448-1456. SIAM, (2010)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)Counting in the Presence of Memory Faults., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 842-851. Springer, (2009)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)Fault Tolerant External Memory Algorithms., , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 411-422. Springer, (2009)Comparator Networks for Binary Heap Construction., and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 158-168. Springer, (1998)