Gerth Stølting Brodal

157 papers A* 25A 16B 28C 3Misc 2Journal 53Unranked 25
YearRankTypeTitle / Venue / Authors
2026 J jnl
Partition-based Simple Heaps.
CoRR
Gerth Stølting Brodal, John Iacono, Casper Moldrup Rysgaard, Sebastian Wild
2025 B conf
A Simple Integer Successor-Delete Data Structure.
SEA
Gerth Stølting Brodal
2025 A conf
Buffered Partially-Persistent External-Memory Search Trees.
ESA
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning
2025 J jnl
Buffered Partially-Persistent External-Memory Search Trees.
CoRR
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning
2025 A conf
External-Memory Priority Queues with Optimal Insertions.
ESA
Gerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning
2025 — conf
Pure Binary Finger Search Trees.
SOSA
Gerth Stølting Brodal, Casper Moldrup Rysgaard
2025 J jnl
Strict Fibonacci Heaps.
ACM Trans. Algorithms
Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
2024 Misc conf
Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin.
FUN
Gerth Stølting Brodal
2024 J jnl
Bottom-up Rebalancing Binary Search Trees by Flipping a Coin.
CoRR
Gerth Stølting Brodal
2024 — conf
Deterministic Cache-Oblivious Funnelselect.
SWAT
Gerth Stølting Brodal, Sebastian Wild
2024 J jnl
Deterministic Cache-Oblivious Funnelselect.
CoRR
Gerth Stølting Brodal, Sebastian Wild
2024 A* conf
Dynamic Convex Hulls for Simple Paths.
SoCG
Bruce W. Brewer, Gerth Stølting Brodal, Haitao Wang
2024 J jnl
Dynamic Convex Hulls for Simple Paths.
CoRR
Bruce W. Brewer, Gerth Stølting Brodal, Haitao Wang
2024 A conf
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences.
ESA
Gerth Stølting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard
2024 J jnl
Priority queues with decreasing keys.
Theor. Comput. Sci.
Gerth Stølting Brodal
2023 A* conf
External Memory Fully Persistent Search Trees.
STOC
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning
2023 A conf
Funnelselect: Cache-Oblivious Multiple Selection.
ESA
Gerth Stølting Brodal, Sebastian Wild
2023 J jnl
Scalable Data Structures (Dagstuhl Seminar 23211).
Dagstuhl Reports
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
2023 B conf
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location.
WADS
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning
2022 Misc conf
Priority Queues with Decreasing Keys.
FUN
Gerth Stølting Brodal
2021 B conf
An Experimental Study of External Memory Algorithms for Connected Components.
SEA
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
2021 J jnl
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees.
ACM J. Exp. Algorithmics
Gerth Stølting Brodal, Konstantinos Mampentzidis
2021 J jnl
In Memoriam Lars Arge ∗ 8.10.1967 - † 23.12.2020.
Bull. EATCS
Gerth Stølting Brodal
2021 J jnl
Scalable Data Structures (Dagstuhl Seminar 21071).
Dagstuhl Reports
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
2021 — conf
Soft Sequence Heaps.
SOSA
Gerth Stølting Brodal
2020 J jnl
A Simple Greedy Algorithm for Dynamic Graph Orientation.
Algorithmica
Edvin Berglin, Gerth Stølting Brodal
2020 J jnl
Fully persistent B-trees.
Theor. Comput. Sci.
Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
2020 J jnl
Soft Sequence Heaps.
CoRR
Gerth Stølting Brodal
2019 J jnl
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051).
Dagstuhl Reports
Gerth Stølting Brodal, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick
2019 J jnl
Dynamic Planar Convex Hull.
CoRR
Riko Jacob, Gerth Stølting Brodal
2017 B conf
A Simple Greedy Algorithm for Dynamic Graph Orientation.
ISAAC
Edvin Berglin, Gerth Stølting Brodal
2017 A conf
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.
ESA
Gerth Stølting Brodal, Konstantinos Mampentzidis
2017 J jnl
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.
CoRR
Gerth Stølting Brodal, Konstantinos Mampentzidis
2016 — ch.
Cache-Oblivious Sorting.
Encyclopedia of Algorithms
Gerth Stølting Brodal
2016 A conf
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.
STACS
Gerth Stølting Brodal
2016 J jnl
Two dimensional range minimum queries and Fibonacci lattices.
Theor. Comput. Sci.
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
2015 J jnl
D
Algorithmica
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
2015 J jnl
External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates.
CoRR
Gerth Stølting Brodal
2015 J jnl
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Theory Comput. Syst.
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
2015 B conf
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
WADS
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
2015 J jnl
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
CoRR
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
2014 J jnl
Dynamic 3-sided planar range queries with expected doubly-logarithmic time.
Theor. Comput. Sci.
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
2014 — conf
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).
SWAT
Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen
2014 J jnl
Integer representations towards efficient counting in the bit probe model.
J. Discrete Algorithms
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
2014 A conf
On the Scalability of Computing Triplet and Quartet Distances.
ALENEX
Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal
2014 — conf
Optimal Planar Orthogonal Skyline Counting Queries.
SWAT
Gerth Stølting Brodal, Kasper Green Larsen
2014 J jnl
tqDist: a library for computing the quartet and triplet distances between binary or general trees.
Bioinform.
Andreas Sand, Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal, Thomas Mailund, Christian N. S. Pedersen
2013 — conf
A Survey on Priority Queues.
Space-Efficient Data Structures, Streams, and Algorithms
Gerth Stølting Brodal
2013 J jnl
A practical O(n log
BMC Bioinform.
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund
2013 A conf
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.
ESA
Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
2013 A* conf
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
SODA
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand
2013 J jnl
Optimal Planar Orthogonal Skyline Counting Queries
CoRR
Gerth Stølting Brodal, Kasper Green Larsen
2013 A conf
The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
ESA
Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi
2012 A conf
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property.
STACS
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen
2012 J jnl
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
CoRR
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
2012 J jnl
External Memory Planar Point Location with Logarithmic Updates.
Algorithmica
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
2012 B conf
Finger Search in the Implicit Model.
ISAAC
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
2012 A* conf
Fully persistent B-trees.
SODA
Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas
2012 J jnl
On Space Efficient Two Dimensional Range Minimum Data Structures.
Algorithmica
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
2012 A* conf
Strict fibonacci heaps.
STOC
Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan
2012 A conf
Two Dimensional Range Minimum Queries and Fibonacci Lattices.
ESA
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
2011 J jnl
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property
CoRR
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen
2011 — conf
Dynamic Planar Range Maxima Queries.
ICALP (1)
Gerth Stølting Brodal, Konstantinos Tsakalidis
2011 J jnl
Faster algorithms for computing longest common increasing subsequences.
J. Discrete Algorithms
Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel
2011 C conf
Integer Representations towards Efficient Counting in the Bit Probe Model.
TAMC
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
2011 B conf
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
WAOA
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
2011 A* conf
Ordered and Unordered Top-K Range Reporting in Large Data Sets.
SODA
Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh
2011 B conf
Path Minima Queries in Dynamic Weighted Trees.
WADS
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
2011 J jnl
The Cost of Cache-Oblivious Searching.
Algorithmica
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2011 J jnl
Towards optimal range medians.
Theor. Comput. Sci.
Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders
2010 — conf
A Cache-Oblivious Implicit Dictionary with the Working Set Property.
ISAAC (2)
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
2010 A* conf
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
SODA
Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
2010 — conf
D
ISAAC (2)
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
2010 J jnl
D
CoRR
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
2010 — conf
On Space Efficient Two Dimensional Range Minimum Data Structures.
ESA (2)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
2010 J jnl
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
2009 B conf
Counting in the Presence of Memory Faults.
ISAAC
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
2009 B conf
Data Structures for Range Median Queries.
ISAAC
Gerth Stølting Brodal, Allan Grønlund Jørgensen
2009 B conf
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.
ISAAC
Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
2009 B conf
Fault Tolerant External Memory Algorithms.
WADS
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave
2009 B conf
Online Sorted Range Reporting.
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
2008 J jnl
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett.
Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel
2008 — ch.
Cache-Oblivious Sorting.
Encyclopedia of Algorithms
Gerth Stølting Brodal
2008 J jnl
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinform. Comput. Biol.
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
2008 — conf
External memory planar point location with logarithmic updates.
SCG
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
2008 J jnl
On the adaptiveness of Quicksort.
ACM J. Exp. Algorithmics
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2008 B conf
Selecting Sums in Arrays.
ISAAC
Gerth Stølting Brodal, Allan Grønlund Jørgensen
2007 B conf
A Linear Time Algorithm for the
MFCS
Gerth Stølting Brodal, Allan Grønlund Jørgensen
2007 B conf
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
APBC
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
2007 B conf
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
APBC
Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg
2007 B conf
Dynamic Matchings in Convex Bipartite Graphs.
MFCS
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
2007 J jnl
Engineering a cache-oblivious sorting algorithm.
ACM J. Exp. Algorithmics
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
2007 A conf
Optimal Resilient Dynamic Dictionaries.
ESA
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
2007 B conf
Optimal sparse matrix dense vector multiplication in the I/O-model.
SPAA
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
2007 — conf
The ComBack Method - Extending Hash Compaction with Backtracking.
ICATPN
Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
2006 A* conf
Cache-oblivious string dictionaries.
SODA
Gerth Stølting Brodal, Rolf Fagerberg
2006 B conf
Faster Algorithms for Computing Longest Common Increasing Subsequences.
CPM
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
2006 A* conf
Improved Dynamic Planar Point Location.
FOCS
Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
2006 A conf
Purely Functional Worst Case Constant Time Catenable Sorted Lists.
ESA
Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
2006 J jnl
Recrafting the neighbor-joining method.
BMC Bioinform.
Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips
2006 A conf
Skewed Binary Search Trees.
ESA
Gerth Stølting Brodal, Gabriel Moruz
2005 A ed.
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
ESA
Gerth Stølting Brodal, Stefano Leonardi
2005 A* conf
Cache-Aware and Cache-Oblivious Adaptive Sorting.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2005 — conf
Cache-oblivious planar orthogonal range searching and counting.
SCG
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
2005 J jnl
Fast allocation and deallocation with an improved buddy system.
Acta Informatica
Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
2005 — conf
On the Adaptiveness of Quicksort.
ALENEX/ANALCO
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
2005 B conf
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.
WADS
Gerth Stølting Brodal, Gabriel Moruz
2004 — conf
Cache-Oblivious Algorithms and Data Structures.
SWAT
Gerth Stølting Brodal
2004 — conf
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
SWAT
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
2004 — ch.
Cache-Oblivious Data Structures.
Handbook of Data Structures and Applications
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg
2004 J jnl
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen
2004 — conf
Engineering a Cache-Oblivious Sorting Algorith.
ALENEX/ANALC
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
2004 — ch.
Finger Search Trees.
Handbook of Data Structures and Applications
Gerth Stølting Brodal
2004 J jnl
On external-memory MST, SSSP and multi-way planar graph separation.
J. Algorithms
Lars Arge, Gerth Stølting Brodal, Laura Toma
2003 C conf
Computing Refined Buneman Trees in Cubic Time.
WABI
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao
2003 A* conf
Lower bounds for external memory dictionaries.
SODA
Gerth Stølting Brodal, Rolf Fagerberg
2003 A* conf
On the limits of cache-obliviousness.
STOC
Gerth Stølting Brodal, Rolf Fagerberg
2003 J jnl
Optimal finger search trees in the pointer machine.
J. Comput. Syst. Sci.
Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
2003 A* conf
The Cost of Cache-Oblivious Searching.
FOCS
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2003 C conf
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries.
ATMOS
Gerth Stølting Brodal, Riko Jacob
2002 A* conf
Cache Oblivious Distribution Sweeping.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg
2002 A* conf
Cache oblivious search trees via binary trees of small height.
SODA
Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
2002 A* conf
Dynamic Planar Convex Hull.
FOCS
Gerth Stølting Brodal, Riko Jacob
2002 B conf
Funnel Heap - A Cache Oblivious Priority Queue.
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg
2002 J jnl
Optimal Solutions for the Temporal Precedence Problem.
Algorithmica
Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
2002 A* conf
Optimal finger search trees in the pointer machine.
STOC
Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
2002 A* conf
Solving the String Statistics Problem in Time O(n log n).
ICALP
Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen
2002 — conf
Time and Space Efficient Multi-method Dispatching.
SWAT
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
2001 — ed.
Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings
Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela
2001 J jnl
Comparator networks for binary heap construction.
Theor. Comput. Sci.
Gerth Stølting Brodal, Maria Cristina Pinotti
2001 B conf
Computing the Quartet Distance between Evolutionary Trees in Time O(n log
ISAAC
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen
2001 A* conf
Optimal static range reporting in one dimension.
STOC
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
2001 A* conf
The Complexity of Constructing Evolutionary Trees Using Experiments.
ICALP
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin
2000 — conf
Dynamic Planar Convex Hull with Optimal Query Time.
SWAT
Gerth Stølting Brodal, Riko Jacob
2000 B conf
Finding Maximal Quasiperiodicities in Strings.
CPM
Gerth Stølting Brodal, Christian N. S. Pedersen
2000 J jnl
Improved bounds for dictionary look-up with one error.
Inf. Process. Lett.
Gerth Stølting Brodal, Srinivasan Venkatesh
2000 A* conf
New Data Structures for Orthogonal Range Searching.
FOCS
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
2000 — conf
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation.
SWAT
Lars Arge, Gerth Stølting Brodal, Laura Toma
2000 A* conf
Pattern matching in dynamic texts.
SODA
Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
1999 B conf
Dynamic Representation of Sparse Graphs.
WADS
Gerth Stølting Brodal, Rolf Fagerberg
1999 B conf
Finding Maximal Pairs with Bounded Gap.
CPM
Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye
1999 A* conf
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
SODA
Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter
1999 J jnl
Priority queues on parallel machines.
Parallel Comput.
Gerth Stølting Brodal
1998 J jnl
A Parallel Priority Queue with Constant Time Operations.
J. Parallel Distributed Comput.
Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
1998 — conf
Comparator Networks for Binary Heap Construction.
SWAT
Gerth Stølting Brodal, Maria Cristina Pinotti
1998 A* conf
Finger Search Trees with Constant Insertion Time.
SODA
Gerth Stølting Brodal
1998 — conf
Worst-Case External-Memory Priority Queues.
SWAT
Gerth Stølting Brodal, Jyrki Katajainen
1997 — conf
A Parallel Priority Data Structure with Applications.
IPPS
Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
1997 A conf
Predecessor Queries in Dynamic Integer Sets.
STACS
Gerth Stølting Brodal
1996 B conf
Approximate Dictionary Queries.
CPM
Gerth Stølting Brodal, Leszek Gasieniec
1996 J jnl
Optimal Purely Functional Priority Queues.
J. Funct. Program.
Gerth Stølting Brodal, Chris Okasaki
1996 J jnl
Partially Persistent Data Structures of Bounded Degree with Constant Update Time.
Nord. J. Comput.
Gerth Stølting Brodal
1996 — conf
Priority Queues on Parallel Machines.
SWAT
Gerth Stølting Brodal
1996 — conf
The Randomized Complexity of Maintaining the Minimum.
SWAT
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
1996 J jnl
The Randomized Complexity of Maintaining the Minimum.
Nord. J. Comput.
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
1996 A* conf
Worst-Case Efficient Priority Queues.
SODA
Gerth Stølting Brodal
1995 B conf
Fast Meldable Priority Queues.
WADS
Gerth Stølting Brodal