( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
Engineering a Cache-Oblivious Sorting Algorith.

, , and . ALENEX/ANALC, page 4-17. SIAM, (2004)

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

Worst-Case Efficient Priority Queues.. SODA, page 52-58. ACM/SIAM, (1996)Cache-oblivious string dictionaries., and . SODA, page 581-590. ACM Press, (2006)Cache oblivious search trees via binary trees of small height., , and . SODA, page 39-48. ACM/SIAM, (2002)On the adaptiveness of quicksort, , and . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, page 130--149. (2005)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)Selecting Sums in Arrays., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 100-111. Springer, (2008)Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs., , , , , and . SODA, page 1448-1456. SIAM, (2010)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)