Gerth Stølting Brodal

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 27

Top Venues

Publications

Bruce Brewer, Gerth Stølting Brodal, Haitao Wang
Dynamic Convex Hulls for Simple Paths. SoCG (2024)
Gerth Stølting Brodal, Sebastian Wild
Deterministic Cache-Oblivious Funnelselect. SWAT (2024)
Gerth Stølting Brodal, Sebastian Wild
Deterministic Cache-Oblivious Funnelselect. CoRR (2024)
Gerth Stølting Brodal
Bottom-up Rebalancing Binary Search Trees by Flipping a Coin. CoRR (2024)
Bruce Brewer, Gerth Stølting Brodal, Haitao Wang
Dynamic Convex Hulls for Simple Paths. CoRR (2024)
Gerth Stølting Brodal
Priority queues with decreasing keys. Theor. Comput. Sci. 1000 (2024)
Gerth Stølting Brodal
Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. FUN (2024)
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. WADS (2023)
Gerth Stølting Brodal, Sebastian Wild
Funnelselect: Cache-Oblivious Multiple Selection. ESA (2023)
Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning
External Memory Fully Persistent Search Trees. STOC (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13 (5) (2023)
Gerth Stølting Brodal
Priority Queues with Decreasing Keys. FUN (2022)
Gerth Stølting Brodal
Soft Sequence Heaps. SOSA (2021)
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11 (1) (2021)
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
An Experimental Study of External Memory Algorithms for Connected Components. SEA (2021)
Gerth Stølting Brodal, Konstantinos Mampentzidis
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. ACM J. Exp. Algorithmics 26 (2021)
Gerth Stølting Brodal
In Memoriam Lars Arge ∗ 8.10.1967 - † 23.12.2020. Bull. EATCS 133 (2021)
Edvin Berglin, Gerth Stølting Brodal
A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica 82 (2) (2020)
Gerth Stølting Brodal
Soft Sequence Heaps. CoRR (2020)
Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
Fully persistent B-trees. Theor. Comput. Sci. 841 (2020)
Gerth Stølting Brodal, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). Dagstuhl Reports 9 (1) (2019)
Riko Jacob, Gerth Stølting Brodal
Dynamic Planar Convex Hull. CoRR (2019)
Gerth Stølting Brodal, Konstantinos Mampentzidis
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. CoRR (2017)
Gerth Stølting Brodal, Konstantinos Mampentzidis
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. ESA (2017)
Edvin Berglin, Gerth Stølting Brodal
A Simple Greedy Algorithm for Dynamic Graph Orientation. ISAAC (2017)
Gerth Stølting Brodal
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. STACS (2016)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638 (2016)
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
-Tree: A New Overlay with Deterministic Bounds. Algorithmica 72 (3) (2015)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56 (1) (2015)
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. CoRR (2015)
Gerth Stølting Brodal
External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates. CoRR (2015)
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. WADS (2015)
Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal
On the Scalability of Computing Triplet and Quartet Distances. ALENEX (2014)
Andreas Sand, Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal, Thomas Mailund, Christian N. S. Pedersen
tqDist: a library for computing the quartet and triplet distances between binary or general trees. Bioinform. 30 (14) (2014)
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
Integer representations towards efficient counting in the bit probe model. J. Discrete Algorithms 26 (2014)
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
Dynamic 3-sided planar range queries with expected doubly-logarithmic time. Theor. Comput. Sci. 526 (2014)
Gerth Stølting Brodal, Kasper Green Larsen
Optimal Planar Orthogonal Skyline Counting Queries. SWAT (2014)
Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). SWAT (2014)
Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi
The Encoding Complexity of Two Dimensional Range Minimum Data Structures. ESA (2013)
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund
n) time algorithm for computing the triplet distance on binary trees. BMC Bioinform. 14 (S-2) (2013)
Gerth Stølting Brodal
A Survey on Priority Queues. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Gerth Stølting Brodal, Kasper Green Larsen
Optimal Planar Orthogonal Skyline Counting Queries CoRR (2013)
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. SODA (2013)
Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA (2013)
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. STACS (2012)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63 (4) (2012)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63 (1-2) (2012)
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
Finger Search in the Implicit Model. ISAAC (2012)
Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas
Fully persistent B-trees. SODA (2012)
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time CoRR (2012)
Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan
Strict fibonacci heaps. STOC (2012)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA (2012)
Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh
Ordered and Unordered Top-K Range Reporting in Large Data Sets. SODA (2011)
Gerth Stølting Brodal, Konstantinos Tsakalidis
Dynamic Planar Range Maxima Queries. ICALP (1) (2011)
Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9 (4) (2011)
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
Integer Representations towards Efficient Counting in the Bit Probe Model. TAMC (2011)
Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders
Towards optimal range medians. Theor. Comput. Sci. 412 (24) (2011)
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property CoRR (2011)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
Path Minima Queries in Dynamic Weighted Trees. WADS (2011)
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
The Cost of Cache-Oblivious Searching. Algorithmica 61 (2) (2011)
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA (2011)
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
-Tree: A New Overlay with Deterministic Bounds. ISAAC (2) (2010)
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
A Cache-Oblivious Implicit Dictionary with the Working Set Property. ISAAC (2) (2010)
Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA (2010)
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao
On Space Efficient Two Dimensional Range Minimum Data Structures. ESA (2) (2010)
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Theory Comput. Syst. 47 (4) (2010)
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis
-Tree: A New Overlay with Deterministic Bounds CoRR (2010)
Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. ISAAC (2009)
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
Online Sorted Range Reporting. ISAAC (2009)
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave
Fault Tolerant External Memory Algorithms. WADS (2009)
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Counting in the Presence of Memory Faults. ISAAC (2009)
Gerth Stølting Brodal, Allan Grønlund Jørgensen
Data Structures for Range Median Queries. ISAAC (2009)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12 (2008)
Gerth Stølting Brodal, Allan Grønlund Jørgensen
Selecting Sums in Arrays. ISAAC (2008)
Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. Oper. Res. Lett. 36 (1) (2008)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External memory planar point location with logarithmic updates. SCG (2008)
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. J. Bioinform. Comput. Biol. 6 (1) (2008)
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
Dynamic Matchings in Convex Bipartite Graphs. MFCS (2007)
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
Engineering a cache-oblivious sorting algorithm. ACM J. Exp. Algorithmics 12 (2007)
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. APBC (2007)
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
Optimal sparse matrix dense vector multiplication in the I/O-model. SPAA (2007)
Gerth Stølting Brodal, Allan Grønlund Jørgensen
Maximal Sums Problem. MFCS (2007)
Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN (2007)
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave
Optimal Resilient Dynamic Dictionaries. ESA (2007)
Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. APBC (2007)
Gerth Stølting Brodal, Rolf Fagerberg
Cache-oblivious string dictionaries. SODA (2006)
Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
Purely Functional Worst Case Constant Time Catenable Sorted Lists. ESA (2006)
Gerth Stølting Brodal, Gabriel Moruz
Skewed Binary Search Trees. ESA (2006)
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM (2006)
Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips
Recrafting the neighbor-joining method. BMC Bioinform. 7 (2006)
Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
Improved Dynamic Planar Point Location. FOCS (2006)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
On the Adaptiveness of Quicksort. ALENEX/ANALCO (2005)
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
Cache-oblivious planar orthogonal range searching and counting. SCG (2005)
Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
Fast allocation and deallocation with an improved buddy system. Acta Informatica 41 (4-5) (2005)
Gerth Stølting Brodal, Gabriel Moruz
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. WADS (2005)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP (2005)
Lars Arge, Gerth Stølting Brodal, Laura Toma
On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53 (2) (2004)
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT (2004)
Gerth Stølting Brodal, Riko Jacob
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electron. Notes Theor. Comput. Sci. 92 (2004)
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
Engineering a Cache-Oblivious Sorting Algorith. ALENEX/ANALC (2004)

Gerth Stølting Brodal.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gerth Stølting Brodal