Author of the publication

Cache-oblivious planar orthogonal range searching and counting.

, , , and . Symposium on Computational Geometry, page 160-169. ACM, (2005)

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.

No persons found for author name Brodal, Gerth Stølting
add a person with the name Brodal, Gerth Stølting
 

Other publications of authors with the same name

Two dimensional range minimum queries and Fibonacci lattices., , , , and . Theor. Comput. Sci., (2016)Optimal Resilient Dynamic Dictionaries., , , , , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 347-358. Springer, (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 fuer Informatik, (2017)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)Optimal Planar Orthogonal Skyline Counting Queries, and . CoRR, (2013)Counting in the Presence of Memory Faults., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 842-851. Springer, (2009)Selecting Sums in Arrays., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 100-111. Springer, (2008)On the Adaptiveness of Quicksort., , and . ALENEX/ANALCO, page 130-140. SIAM, (2005)