Gerth Stølting Brodal

According to our database, Gerth Stølting Brodal authored at least 116 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Priority queues with decreasing keys.

Gerth Stølting Brodal

Theor. Comput. Sci., 2024

Deterministic Cache-Oblivious Funnelselect.

Gerth Stølting Brodal, Sebastian Wild

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin.

Gerth Stølting Brodal

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

On Finding Longest Palindromic Subsequences Using Longest Common Subsequences.

Gerth Stølting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Dynamic Convex Hulls for Simple Paths.

Bruce Brewer, Gerth Stølting Brodal, Haitao Wang

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Scalable Data Structures (Dagstuhl Seminar 23211).

Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant

Dagstuhl Reports, 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

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

External Memory Fully Persistent Search Trees.

Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Funnelselect: Cache-Oblivious Multiple Selection.

Gerth Stølting Brodal, Sebastian Wild

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees.

Gerth Stølting Brodal, Konstantinos Mampentzidis

ACM J. Exp. Algorithmics, 2021

In Memoriam Lars Arge ∗ 8.10.1967 - † 23.12.2020.

Gerth Stølting Brodal

Bull. EATCS, 2021

Scalable Data Structures (Dagstuhl Seminar 21071).

Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran

Dagstuhl Reports, 2021

An Experimental Study of External Memory Algorithms for Connected Components.

Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Soft Sequence Heaps.

Gerth Stølting Brodal

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020

Fully persistent B-trees.

Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas

Theor. Comput. Sci., 2020

A Simple Greedy Algorithm for Dynamic Graph Orientation.

Edvin Berglin, Gerth Stølting Brodal

Algorithmica, 2020

2019

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

2016

Cache-Oblivious Sorting.

Gerth Stølting Brodal

Encyclopedia of Algorithms, 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

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.

Gerth Stølting Brodal

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.

Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu

Theory Comput. Syst., 2015

D²-Tree: A New Overlay with Deterministic Bounds.

Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis

Algorithmica, 2015

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.

Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

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

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

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

Optimal Planar Orthogonal Skyline Counting Queries.

Gerth Stølting Brodal, Kasper Green Larsen

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).

Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen

Proceedings of the Algorithm Theory - SWAT 2014, 2014

On the Scalability of Computing Triplet and Quartet Distances.

Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

A practical O(n log² 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

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

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The Encoding Complexity of Two Dimensional Range Minimum Data Structures.

Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi

Proceedings of the Algorithms - ESA 2013, 2013

An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.

Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis

Proceedings of the Algorithms - ESA 2013, 2013

A Survey on Priority Queues.

Gerth Stølting Brodal

Proceedings of the Space-Efficient Data Structures, 2013

2012

On Space Efficient Two Dimensional Range Minimum Data Structures.

Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao

Algorithmica, 2012

External Memory Planar Point Location with Logarithmic Updates.

Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao

Algorithmica, 2012

Strict fibonacci heaps.

Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property.

Gerth Stølting Brodal, Casper Kejlberg-Rasmussen

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Finger Search in the Implicit Model.

Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Towards optimal range medians.

Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders

Theor. Comput. Sci., 2011

Faster algorithms for computing longest common increasing subsequences.

Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel

J. Discrete Algorithms, 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

Path Minima Queries in Dynamic Weighted Trees.

Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Ordered and Unordered Top-K Range Reporting in Large Data Sets.

Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Dynamic Planar Range Maxima Queries.

Gerth Stølting Brodal, Konstantinos Tsakalidis

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

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

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

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Cache-Oblivious Implicit Dictionary with the Working Set Property.

Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Fault Tolerant External Memory Algorithms.

Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 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

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Counting in the Presence of Memory Faults.

Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Data Structures for Range Median Queries.

Gerth Stølting Brodal, Allan Grønlund Jørgensen

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Online Sorted Range Reporting.

Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Cache-Oblivious Sorting.

Gerth Stølting Brodal

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 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

On the adaptiveness of Quicksort.

Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz

ACM J. Exp. Algorithmics, 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

Selecting Sums in Arrays.

Gerth Stølting Brodal, Allan Grønlund Jørgensen

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Engineering a cache-oblivious sorting algorithm.

Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther

ACM J. Exp. Algorithmics, 2007

A Linear Time Algorithm for the <i>k</i> Maximal Sums Problem.

Gerth Stølting Brodal, Allan Grønlund Jørgensen

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Dynamic Matchings in Convex Bipartite Graphs.

Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Optimal Resilient Dynamic Dictionaries.

Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Proceedings of the Algorithms, 2007

The ComBack Method - Extending Hash Compaction with Backtracking.

Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge

Proceedings of the Petri Nets and Other Models of Concurrency, 2007

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

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Recrafting the neighbor-joining method.

Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips

BMC Bioinform., 2006

Cache-oblivious string dictionaries.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved Dynamic Planar Point Location.

Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Purely Functional Worst Case Constant Time Catenable Sorted Lists.

Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas

Proceedings of the Algorithms, 2006

Skewed Binary Search Trees.

Gerth Stølting Brodal, Gabriel Moruz

Proceedings of the Algorithms, 2006

2005

Fast allocation and deallocation with an improved buddy system.

Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro

Acta Informatica, 2005

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.

Gerth Stølting Brodal, Gabriel Moruz

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Cache-Aware and Cache-Oblivious Adaptive Sorting.

Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-oblivious planar orthogonal range searching and counting.

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Finger Search Trees.

Gerth Stølting Brodal

Proceedings of the Handbook of Data Structures and Applications., 2004

Cache-Oblivious Data Structures.

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Handbook of Data Structures and Applications., 2004

On external-memory MST, SSSP and multi-way planar graph separation.

Lars Arge, Gerth Stølting Brodal, Laura Toma

J. Algorithms, 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

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.

Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh

Proceedings of the Algorithm Theory, 2004

Cache-Oblivious Algorithms and Data Structures.

Gerth Stølting Brodal

Proceedings of the Algorithm Theory, 2004

Engineering a Cache-Oblivious Sorting Algorith.

Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Optimal finger search trees in the pointer machine.

Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas

J. Comput. Syst. Sci., 2003

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries.

Gerth Stølting Brodal, Riko Jacob

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

Computing Refined Buneman Trees in Cubic Time.

Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

On the limits of cache-obliviousness.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Lower bounds for external memory dictionaries.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Optimal Solutions for the Temporal Precedence Problem.

Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas

Algorithmica, 2002

Time and Space Efficient Multi-method Dispatching.

Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe

Proceedings of the Algorithm Theory, 2002

Cache oblivious search trees via binary trees of small height.

Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Funnel Heap - A Cache Oblivious Priority Queue.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Algorithms and Computation, 13th International Symposium, 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

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Cache Oblivious Distribution Sweeping.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Dynamic Planar Convex Hull.

Gerth Stølting Brodal, Riko Jacob

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Comparator networks for binary heap construction.

Gerth Stølting Brodal, Maria Cristina Pinotti

Theor. Comput. Sci., 2001

Optimal static range reporting in one dimension.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Computing the Quartet Distance between Evolutionary Trees in Time O(n log² n).

Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.

Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Improved bounds for dictionary look-up with one error.

Gerth Stølting Brodal, Srinivasan Venkatesh

Inf. Process. Lett., 2000

Dynamic Planar Convex Hull with Optimal Query Time.

Gerth Stølting Brodal, Riko Jacob

Proceedings of the Algorithm Theory, 2000

Pattern matching in dynamic texts.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

New Data Structures for Orthogonal Range Searching.

Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Finding Maximal Quasiperiodicities in Strings.

Gerth Stølting Brodal, Christian N. S. Pedersen

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Priority queues on parallel machines.

Gerth Stølting Brodal

Parallel Comput., 1999

Dynamic Representation of Sparse Graphs.

Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.

Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Finding Maximal Pairs with Bounded Gap.

Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

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

Worst-Case External-Memory Priority Queues.

Gerth Stølting Brodal, Jyrki Katajainen

Proceedings of the Algorithm Theory, 1998

Finger Search Trees with Constant Insertion Time.

Gerth Stølting Brodal

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Predecessor Queries in Dynamic Integer Sets.

Gerth Stølting Brodal

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Parallel Priority Data Structure with Applications.

Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

The Randomized Complexity of Maintaining the Minimum.

Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan

Nord. J. Comput., 1996

Partially Persistent Data Structures of Bounded Degree with Constant Update Time.

Gerth Stølting Brodal

Nord. J. Comput., 1996

Optimal Purely Functional Priority Queues.

Gerth Stølting Brodal, Chris Okasaki

J. Funct. Program., 1996

Worst-Case Efficient Priority Queues.

Gerth Stølting Brodal

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Approximate Dictionary Queries.

Gerth Stølting Brodal, Leszek Gasieniec

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Fast Meldable Priority Queues.

Gerth Stølting Brodal

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995