Fast Meldable Priority Queues. - Gerth Stølting Brodal (WADS, 1995)

Approximate Dictionary Queries. - Gerth Stølting Brodal; Leszek Gasieniec (CPM, 1996)

Worst-Case Efficient Priority Queues. - Gerth Stølting Brodal (SODA, 1996)

Optimal Purely Functional Priority Queues. - Gerth Stølting Brodal; Chris Okasaki (J. Funct. Program., 1996)

Partially Persistent Data Structures of Bounded Degree with Constant Update Time. - Gerth Stølting Brodal (Nord. J. Comput., 1996)

The Randomized Complexity of Maintaining the Minimum. - Gerth Stølting Brodal; Shiva Chaudhuri; Jaikumar Radhakrishnan (Nord. J. Comput., 1996)

A Parallel Priority Data Structure with Applications. - Gerth Stølting Brodal; Jesper Larsson Träff; Christos D. Zaroliagis (IPPS, 1997)

Predecessor Queries in Dynamic Integer Sets. - Gerth Stølting Brodal (STACS, 1997)

Finger Search Trees with Constant Insertion Time. - Gerth Stølting Brodal (SODA, 1998)

Worst-Case External-Memory Priority Queues. - Gerth Stølting Brodal; Jyrki Katajainen (SWAT, 1998)

A Parallel Priority Queue with Constant Time Operations. - Gerth Stølting Brodal; Jesper Larsson Träff; Christos D. Zaroliagis (J. Parallel Distributed Comput., 1998)

Finding Maximal Pairs with Bounded Gap. - Gerth Stølting Brodal; Rune B. Lyngsø; Christian N. S. Pedersen; Jens Stoye (CPM, 1999)

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. - Pankaj K. Agarwal; Lars Arge; Gerth Stølting Brodal; Jeffrey Scott Vitter (SODA, 1999)

Dynamic Representation of Sparse Graphs. - Gerth Stølting Brodal; Rolf Fagerberg (WADS, 1999)

Priority queues on parallel machines. - Gerth Stølting Brodal (Parallel Comput., 1999)

Finding Maximal Quasiperiodicities in Strings. - Gerth Stølting Brodal; Christian N. S. Pedersen (CPM, 2000)

New Data Structures for Orthogonal Range Searching. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (FOCS, 2000)

Pattern matching in dynamic texts. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (SODA, 2000)

Dynamic Planar Convex Hull with Optimal Query Time. - Gerth Stølting Brodal; Riko Jacob (SWAT, 2000)

Improved bounds for dictionary look-up with one error. - Gerth Stølting Brodal; Srinivasan Venkatesh 001 (Inf. Process. Lett., 2000)

The Complexity of Constructing Evolutionary Trees Using Experiments. - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Anna Östlin (ICALP, 2001)

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen (ISAAC, 2001)

Optimal static range reporting in one dimension. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (STOC, 2001)

Comparator networks for binary heap construction. - Gerth Stølting Brodal; Maria Cristina Pinotti (Theor. Comput. Sci., 2001)

Dynamic Planar Convex Hull. - Gerth Stølting Brodal; Riko Jacob (FOCS, 2002)

Cache Oblivious Distribution Sweeping. - Gerth Stølting Brodal; Rolf Fagerberg (ICALP, 2002)

Solving the String Statistics Problem in Time O(n log n). - Gerth Stølting Brodal; Rune B. Lyngsø; Anna Östlin; Christian N. S. Pedersen (ICALP, 2002)

Funnel Heap - A Cache Oblivious Priority Queue. - Gerth Stølting Brodal; Rolf Fagerberg (ISAAC, 2002)

Cache oblivious search trees via binary trees of small height. - Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob (SODA, 2002)

Time and Space Efficient Multi-method Dispatching. - Stephen Alstrup; Gerth Stølting Brodal; Inge Li Gørtz; Theis Rauhe (SWAT, 2002)

Optimal Solutions for the Temporal Precedence Problem. - Gerth Stølting Brodal; Christos Makris 001; Spyros Sioutas; Athanasios K. Tsakalidis; Kostas Tsichlas (Algorithmica, 2002)

Lower bounds for external memory dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg (SODA, 2003)

On the limits of cache-obliviousness. - Gerth Stølting Brodal; Rolf Fagerberg (STOC, 2003)

Computing Refined Buneman Trees in Cubic Time. - Gerth Stølting Brodal; Rolf Fagerberg; Anna Östlin; Christian N. S. Pedersen; S. Srinivasa Rao 001 (WABI, 2003)

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. - Gerth Stølting Brodal; Riko Jacob (ATMOS, 2003)

Optimal finger search trees in the pointer machine. - Gerth Stølting Brodal; George Lagogiannis; Christos Makris 001; Athanasios K. Tsakalidis; Kostas Tsichlas (J. Comput. Syst. Sci., 2003)

Engineering a Cache-Oblivious Sorting Algorith. - Gerth Stølting Brodal; Rolf Fagerberg; Kristoffer Vinther (ALENEX/ANALC, 2004)

Cache-Oblivious Algorithms and Data Structures. - Gerth Stølting Brodal (SWAT, 2004)

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. - Gerth Stølting Brodal; Rolf Fagerberg; Ulrich Meyer 001; Norbert Zeh (SWAT, 2004)

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen (Algorithmica, 2004)

On external-memory MST, SSSP and multi-way planar graph separation. - Lars Arge; Gerth Stølting Brodal; Laura Toma (J. Algorithms, 2004)

Cache-Oblivious Data Structures. - Lars Arge; Gerth Stølting Brodal; Rolf Fagerberg (Handbook of Data Structures and Applications, 2004)

Finger Search Trees. - Gerth Stølting Brodal (Handbook of Data Structures and Applications, 2004)

Cache-oblivious planar orthogonal range searching and counting. - Lars Arge; Gerth Stølting Brodal; Rolf Fagerberg; Morten Laustsen (SCG, 2005)

Cache-Aware and Cache-Oblivious Adaptive Sorting. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ICALP, 2005)

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. - Gerth Stølting Brodal; Gabriel Moruz (WADS, 2005)

Fast allocation and deallocation with an improved buddy system. - Gerth Stølting Brodal; Erik D. Demaine; J. Ian Munro (Acta Informatica, 2005)

Skewed Binary Search Trees. - Gerth Stølting Brodal; Gabriel Moruz (ESA, 2006)

Purely Functional Worst Case Constant Time Catenable Sorted Lists. - Gerth Stølting Brodal; Christos Makris 001; Kostas Tsichlas (ESA, 2006)

Improved Dynamic Planar Point Location. - Lars Arge; Gerth Stølting Brodal; Loukas Georgiadis (FOCS, 2006)

Cache-oblivious string dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg (SODA, 2006)

Recrafting the neighbor-joining method. - Thomas Mailund; Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Derek Phillips (BMC Bioinform., 2006)

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. - Martin Stig Stissing; Christian N. S. Pedersen; Thomas Mailund; Gerth Stølting Brodal; Rolf Fagerberg (APBC, 2007)

The ComBack Method - Extending Hash Compaction with Backtracking. - Michael Westergaard; Lars Michael Kristensen; Gerth Stølting Brodal; Lars Arge (ICATPN, 2007)

Optimal Resilient Dynamic Dictionaries. - Gerth Stølting Brodal; Rolf Fagerberg; Irene Finocchi; Fabrizio Grandoni 001; Giuseppe F. Italiano; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ESA, 2007)

Dynamic Matchings in Convex Bipartite Graphs. - Gerth Stølting Brodal; Loukas Georgiadis; Kristoffer Arnsfelt Hansen; Irit Katriel (MFCS, 2007)

A Linear Time Algorithm for the k Maximal Sums Problem. - Gerth Stølting Brodal; Allan Grønlund Jørgensen (MFCS, 2007)

Engineering a cache-oblivious sorting algorithm. - Gerth Stølting Brodal; Rolf Fagerberg; Kristoffer Vinther (ACM J. Exp. Algorithmics, 2007)

Selecting Sums in Arrays. - Gerth Stølting Brodal; Allan Grønlund Jørgensen (ISAAC, 2008)

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. - Martin Stig Stissing; Thomas Mailund; Christian N. S. Pedersen; Gerth Stølting Brodal; Rolf Fagerberg (J. Bioinform. Comput. Biol., 2008)

On the adaptiveness of Quicksort. - Gerth Stølting Brodal; Rolf Fagerberg; Gabriel Moruz (ACM J. Exp. Algorithmics, 2008)

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. - Gerth Stølting Brodal; Loukas Georgiadis; Irit Katriel (Oper. Res. Lett., 2008)

Cache-Oblivious Sorting. - Gerth Stølting Brodal (Encyclopedia of Algorithms, 2008)

Online Sorted Range Reporting. - Gerth Stølting Brodal; Rolf Fagerberg; Mark Greve; Alejandro López-Ortiz (ISAAC, 2009)

Data Structures for Range Median Queries. - Gerth Stølting Brodal; Allan Grønlund Jørgensen (ISAAC, 2009)

Counting in the Presence of Memory Faults. - Gerth Stølting Brodal; Allan Grønlund Jørgensen; Gabriel Moruz; Thomas Mølhave (ISAAC, 2009)

Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. - Gerth Stølting Brodal; Alexis C. Kaporis; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (ISAAC, 2009)

Fault Tolerant External Memory Algorithms. - Gerth Stølting Brodal; Allan Grønlund Jørgensen; Thomas Mølhave (WADS, 2009)

A Cache-Oblivious Implicit Dictionary with the Working Set Property. - Gerth Stølting Brodal; Casper Kejlberg-Rasmussen; Jakob Truelsen (ISAAC (2), 2010)

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. - Gerth Stølting Brodal; Erik D. Demaine; Jeremy T. Fineman; John Iacono; Stefan Langerman; J. Ian Munro (SODA, 2010)

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob; Elias Vicari (Theory Comput. Syst., 2010)

Dynamic Planar Range Maxima Queries. - Gerth Stølting Brodal; Konstantinos Tsakalidis (ICALP (1), 2011)

Ordered and Unordered Top-K Range Reporting in Large Data Sets. - Peyman Afshani; Gerth Stølting Brodal; Norbert Zeh (SODA, 2011)

Path Minima Queries in Dynamic Weighted Trees. - Gerth Stølting Brodal; Pooya Davoodi; S. Srinivasa Rao 001 (WADS, 2011)

The Cost of Cache-Oblivious Searching. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Dongdong Ge; Simai He; Haodong Hu; John Iacono; Alejandro López-Ortiz (Algorithmica, 2011)

Faster algorithms for computing longest common increasing subsequences. - Martin Kutz; Gerth Stølting Brodal; Kanela Kaligosi; Irit Katriel (J. Discrete Algorithms, 2011)

Towards optimal range medians. - Gerth Stølting Brodal; Beat Gfeller; Allan Grønlund Jørgensen; Peter Sanders 001 (Theor. Comput. Sci., 2011)

Finger Search in the Implicit Model. - Gerth Stølting Brodal; Jesper Sindahl Nielsen; Jakob Truelsen (ISAAC, 2012)

Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. - Gerth Stølting Brodal; Casper Kejlberg-Rasmussen (STACS, 2012)

External Memory Planar Point Location with Logarithmic Updates. - Lars Arge; Gerth Stølting Brodal; S. Srinivasa Rao 001 (Algorithmica, 2012)

On Space Efficient Two Dimensional Range Minimum Data Structures. - Gerth Stølting Brodal; Pooya Davoodi; S. Srinivasa Rao 001 (Algorithmica, 2012)

A Survey on Priority Queues. - Gerth Stølting Brodal (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. - Lars Arge; Gerth Stølting Brodal; Jakob Truelsen; Constantinos Tsirogiannis (ESA, 2013)

The Encoding Complexity of Two Dimensional Range Minimum Data Structures. - Gerth Stølting Brodal; Andrej Brodnik; Pooya Davoodi (ESA, 2013)

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. - Gerth Stølting Brodal; Rolf Fagerberg; Thomas Mailund; Christian N. S. Pedersen; Andreas Sand (SODA, 2013)

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. - Andreas Sand; Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Thomas Mailund (BMC Bioinform., 2013)

On the Scalability of Computing Triplet and Quartet Distances. - Morten Kragelund Holt; Jens Johansen; Gerth Stølting Brodal (ALENEX, 2014)

Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). - Djamal Belazzougui; Gerth Stølting Brodal; Jesper Sindahl Nielsen (SWAT, 2014)

Optimal Planar Orthogonal Skyline Counting Queries. - Gerth Stølting Brodal; Kasper Green Larsen (SWAT, 2014)

tqDist: a library for computing the quartet and triplet distances between binary or general trees. - Andreas Sand; Morten Kragelund Holt; Jens Johansen; Gerth Stølting Brodal; Thomas Mailund; Christian N. S. Pedersen (Bioinform., 2014)

Integer representations towards efficient counting in the bit probe model. - Gerth Stølting Brodal; Mark Greve; Vineet Pandey; Srinivasa Rao Satti (J. Discrete Algorithms, 2014)

Dynamic 3-sided planar range queries with expected doubly-logarithmic time. - Gerth Stølting Brodal; Alexis C. Kaporis; Apostolos N. Papadopoulos; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (Theor. Comput. Sci., 2014)

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. - Gerth Stølting Brodal; Jesper Sindahl Nielsen; Jakob Truelsen (WADS, 2015)

D2-Tree: A New Overlay with Deterministic Bounds. - Gerth Stølting Brodal; Spyros Sioutas; Kostas Tsichlas; Christos D. Zaroliagis (Algorithmica, 2015)

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. - Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu (Theory Comput. Syst., 2015)

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. - Gerth Stølting Brodal (STACS, 2016)

Two dimensional range minimum queries and Fibonacci lattices. - Gerth Stølting Brodal; Pooya Davoodi; Moshe Lewenstein; Rajeev Raman; Srinivasa Rao Satti (Theor. Comput. Sci., 2016)

Cache-Oblivious Sorting. - Gerth Stølting Brodal (Encyclopedia of Algorithms, 2016)

Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). - Gerth Stølting Brodal; Ulrich Carsten Meyer; Markus E. Nebel; Robert Sedgewick (Dagstuhl Reports, 2019)

A Simple Greedy Algorithm for Dynamic Graph Orientation. - Edvin Berglin; Gerth Stølting Brodal (Algorithmica, 2020)

Fully persistent B-trees. - Gerth Stølting Brodal; Spyros Sioutas; Konstantinos Tsakalidis; Kostas Tsichlas (Theor. Comput. Sci., 2020)

Soft Sequence Heaps. - Gerth Stølting Brodal (SOSA, 2021)

An Experimental Study of External Memory Algorithms for Connected Components. - Gerth Stølting Brodal; Rolf Fagerberg; David Hammer; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (SEA, 2021)

Scalable Data Structures (Dagstuhl Seminar 21071). - Gerth Stølting Brodal; John Iacono; Markus E. Nebel; Vijaya Ramachandran (Dagstuhl Reports, 2021)

In Memoriam Lars Arge ∗ 8.10.1967 - † 23.12.2020. - Gerth Stølting Brodal (Bull. EATCS, 2021)

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. - Gerth Stølting Brodal; Konstantinos Mampentzidis (ACM J. Exp. Algorithmics, 2021)

Funnelselect: Cache-Oblivious Multiple Selection. - Gerth Stølting Brodal; Sebastian Wild (ESA, 2023)

External Memory Fully Persistent Search Trees. - Gerth Stølting Brodal; Casper Moldrup Rysgaard; Rolf Svenning (STOC, 2023)

Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. - Gerth Stølting Brodal; Casper Moldrup Rysgaard; Jens Kristian Refsgaard Schou; Rolf Svenning (WADS, 2023)

Scalable Data Structures (Dagstuhl Seminar 23211). - Gerth Stølting Brodal; John Iacono; László Kozma 002; Vijaya Ramachandran; Justin Dallant (Dagstuhl Reports, 2023)

Dynamic Convex Hulls for Simple Paths. - Bruce W. Brewer; Gerth Stølting Brodal; Haitao Wang 001 (SoCG, 2024)

On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. - Gerth Stølting Brodal; Rolf Fagerberg; Casper Moldrup Rysgaard (ESA, 2024)

Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. - Gerth Stølting Brodal (FUN, 2024)

Deterministic Cache-Oblivious Funnelselect. - Gerth Stølting Brodal; Sebastian Wild (SWAT, 2024)

Priority queues with decreasing keys. - Gerth Stølting Brodal (Theor. Comput. Sci., 2024)

Pure Binary Finger Search Trees. - Gerth Stølting Brodal; Casper Moldrup Rysgaard (SOSA, 2025)

A Simple Integer Successor-Delete Data Structure. - Gerth Stølting Brodal (SEA, 2025)

Strict Fibonacci Heaps. - Gerth Stølting Brodal; George Lagogiannis; Robert E. Tarjan (ACM Trans. Algorithms, 2025)

Buffered Partially-Persistent External-Memory Search Trees. - Gerth Stølting Brodal; Casper Moldrup Rysgaard; Rolf Svenning (CoRR, 2025)