( en | de | ru )

 

Disambiguation of "Brodal, Gerth Stølting"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).

, , and . Algorithmica, 38 (2): 377-395 (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

Nathalie Stölting

Stephanie 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)Optimal Planar Orthogonal Skyline Counting Queries, and . CoRR, (2013)On the adaptiveness of quicksort, , and . IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM, page 130--149. (2005)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)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)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)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)