Gerth Stlting Brodal
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
78
Venues
17
Active years
1995–2026
Best venue rank
A*
Where they publish
Papers
78 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Learning-Augmented Online Sorting and TSP. | Ioana O. Bercea, Gerth Stlting Brodal, John Iacono, Lszl Kozma, Debmalya Panigrahi |
| 2026 | ESA | Algorithm Exercises Skyline and Young Tableau: Divide-and-Conquer Revisited. | Gerth Stlting Brodal |
| 2026 | ICALP | The Impossibility of Simultaneous Time and I/O Optimality for the Planar Maxima and Convex Hull Problems. | Peyman Afshani, Gerth Stlting Brodal, Nodari Sitchinava |
| 2025 | ESA | External-Memory Priority Queues with Optimal Insertions. | Gerth Stlting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2025 | ESA | Buffered Partially-Persistent External-Memory Search Trees. | Gerth Stlting Brodal, Casper Moldrup Rysgaard, Rolf Svenning |
| 2024 | ESA | On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. | Gerth Stlting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard |
| 2024 | FUN | Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. | Gerth Stlting Brodal |
| 2023 | ESA | Funnelselect: Cache-Oblivious Multiple Selection. | Gerth Stlting Brodal, Sebastian Wild |
| 2023 | STOC | External Memory Fully Persistent Search Trees. | Gerth Stlting Brodal, Casper Moldrup Rysgaard, Rolf Svenning |
| 2023 | WADS | Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. | Gerth Stlting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning |
| 2022 | FUN | Priority Queues with Decreasing Keys. | Gerth Stlting Brodal |
| 2017 | ESA | Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. | Gerth Stlting Brodal, Konstantinos Mampentzidis |
| 2017 | ISAAC | A Simple Greedy Algorithm for Dynamic Graph Orientation. | Edvin Berglin, Gerth Stlting Brodal |
| 2016 | STACS | External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. | Gerth Stlting Brodal |
| 2015 | WADS | Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. | Gerth Stlting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen |
| 2014 | ALENEX | On the Scalability of Computing Triplet and Quartet Distances. | Morten Kragelund Holt, Jens Johansen, Gerth Stlting Brodal |
| 2013 | ESA | An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. | Lars Arge, Gerth Stlting Brodal, Jakob Truelsen, Constantinos Tsirogiannis |
| 2013 | ESA | The Encoding Complexity of Two Dimensional Range Minimum Data Structures. | Gerth Stlting Brodal, Andrej Brodnik, Pooya Davoodi |
| 2013 | SODA | Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. | Gerth Stlting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand |
| 2012 | ESA | Two Dimensional Range Minimum Queries and Fibonacci Lattices. | Gerth Stlting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao |
| 2012 | ISAAC | Finger Search in the Implicit Model. | Gerth Stlting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen |
| 2012 | SODA | Fully persistent B-trees. | Gerth Stlting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas |
| 2012 | STOC | Strict fibonacci heaps. | Gerth Stlting Brodal, George Lagogiannis, Robert Endre Tarjan |
| 2012 | STACS | Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. | Gerth Stlting Brodal, Casper Kejlberg-Rasmussen |
| 2011 | ICALP | Dynamic Planar Range Maxima Queries. | Gerth Stlting Brodal, Konstantinos Tsakalidis |
| 2011 | SODA | Ordered and Unordered Top-K Range Reporting in Large Data Sets. | Peyman Afshani, Gerth Stlting Brodal, Norbert Zeh |
| 2011 | TAMC | Integer Representations towards Efficient Counting in the Bit Probe Model. | Gerth Stlting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti |
| 2011 | WADS | Path Minima Queries in Dynamic Weighted Trees. | Gerth Stlting Brodal, Pooya Davoodi, S. Srinivasa Rao |
| 2011 | WAOA | OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. | Gerth Stlting Brodal, Gabriel Moruz, Andrei Negoescu |
| 2010 | ESA | On Space Efficient Two Dimensional Range Minimum Data Structures. | Gerth Stlting Brodal, Pooya Davoodi, S. Srinivasa Rao |
| 2010 | ISAAC | A Cache-Oblivious Implicit Dictionary with the Working Set Property. | Gerth Stlting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen |
| 2010 | ISAAC | D | Gerth Stlting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis |
| 2010 | SODA | Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. | Gerth Stlting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
| 2009 | ISAAC | Online Sorted Range Reporting. | Gerth Stlting Brodal, Rolf Fagerberg, Mark Greve, Alejandro Lpez-Ortiz |
| 2009 | ISAAC | Data Structures for Range Median Queries. | Gerth Stlting Brodal, Allan Grnlund Jrgensen |
| 2009 | ISAAC | Counting in the Presence of Memory Faults. | Gerth Stlting Brodal, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2009 | ISAAC | Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. | Gerth Stlting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas |
| 2009 | WADS | Fault Tolerant External Memory Algorithms. | Gerth Stlting Brodal, Allan Grnlund Jrgensen, Thomas Mlhave |
| 2008 | ISAAC | Selecting Sums in Arrays. | Gerth Stlting Brodal, Allan Grnlund Jrgensen |
| 2007 | APBC | Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stlting Brodal, Rolf Fagerberg |
| 2007 | APBC | Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. | Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stlting Brodal, Rolf Fagerberg |
| 2007 | ESA | Optimal Resilient Dynamic Dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2007 | MFCS | Dynamic Matchings in Convex Bipartite Graphs. | Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
| 2007 | MFCS | A Linear Time Algorithm for the | Gerth Stlting Brodal, Allan Grnlund Jrgensen |
| 2007 | SPAA | Optimal sparse matrix dense vector multiplication in the I/O-model. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
| 2006 | CPM | Faster Algorithms for Computing Longest Common Increasing Subsequences. | Gerth Stlting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz |
| 2006 | ESA | Skewed Binary Search Trees. | Gerth Stlting Brodal, Gabriel Moruz |
| 2006 | ESA | Purely Functional Worst Case Constant Time Catenable Sorted Lists. | Gerth Stlting Brodal, Christos Makris, Kostas Tsichlas |
| 2006 | FOCS | Improved Dynamic Planar Point Location. | Lars Arge, Gerth Stlting Brodal, Loukas Georgiadis |
| 2006 | SODA | Cache-oblivious string dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2005 | ALENEX | On the Adaptiveness of Quicksort. | Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz |
| 2005 | ICALP | Cache-Aware and Cache-Oblivious Adaptive Sorting. | Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz |
| 2005 | WADS | Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. | Gerth Stlting Brodal, Gabriel Moruz |
| 2004 | ALENEX | Engineering a Cache-Oblivious Sorting Algorith. | Gerth Stlting Brodal, Rolf Fagerberg, Kristoffer Vinther |
| 2003 | FOCS | The Cost of Cache-Oblivious Searching. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro Lpez-Ortiz |
| 2003 | SODA | Lower bounds for external memory dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2003 | STOC | On the limits of cache-obliviousness. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2003 | WABI | Computing Refined Buneman Trees in Cubic Time. | Gerth Stlting Brodal, Rolf Fagerberg, Anna stlin, Christian N. S. Pedersen, S. Srinivasa Rao |
| 2002 | FOCS | Dynamic Planar Convex Hull. | Gerth Stlting Brodal, Riko Jacob |
| 2002 | ICALP | Cache Oblivious Distribution Sweeping. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2002 | ICALP | Solving the String Statistics Problem in Time O(n log n). | Gerth Stlting Brodal, Rune B. Lyngs, Anna stlin, Christian N. S. Pedersen |
| 2002 | ISAAC | Funnel Heap - A Cache Oblivious Priority Queue. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2002 | SODA | Cache oblivious search trees via binary trees of small height. | Gerth Stlting Brodal, Rolf Fagerberg, Riko Jacob |
| 2002 | STOC | Optimal finger search trees in the pointer machine. | Gerth Stlting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas |
| 2001 | ICALP | The Complexity of Constructing Evolutionary Trees Using Experiments. | Gerth Stlting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna stlin |
| 2001 | ISAAC | Computing the Quartet Distance between Evolutionary Trees in Time O(n log | Gerth Stlting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
| 2001 | STOC | Optimal static range reporting in one dimension. | Stephen Alstrup, Gerth Stlting Brodal, Theis Rauhe |
| 2000 | CPM | Finding Maximal Quasiperiodicities in Strings. | Gerth Stlting Brodal, Christian N. S. Pedersen |
| 2000 | FOCS | New Data Structures for Orthogonal Range Searching. | Stephen Alstrup, Gerth Stlting Brodal, Theis Rauhe |
| 2000 | SODA | Pattern matching in dynamic texts. | Stephen Alstrup, Gerth Stlting Brodal, Theis Rauhe |
| 1999 | CPM | Finding Maximal Pairs with Bounded Gap. | Gerth Stlting Brodal, Rune B. Lyngs, Christian N. S. Pedersen, Jens Stoye |
| 1999 | SODA | I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. | Pankaj K. Agarwal, Lars Arge, Gerth Stlting Brodal, Jeffrey Scott Vitter |
| 1999 | WADS | Dynamic Representation of Sparse Graphs. | Gerth Stlting Brodal, Rolf Fagerberg |
| 1998 | SODA | Finger Search Trees with Constant Insertion Time. | Gerth Stlting Brodal |
| 1997 | STACS | Predecessor Queries in Dynamic Integer Sets. | Gerth Stlting Brodal |
| 1996 | CPM | Approximate Dictionary Queries. | Gerth Stlting Brodal, Leszek Gasieniec |
| 1996 | SODA | Worst-Case Efficient Priority Queues. | Gerth Stlting Brodal |
| 1995 | WADS | Fast Meldable Priority Queues. | Gerth Stlting Brodal |