Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDGerth Stølting Brodal
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j33]Edvin Berglin, Gerth Stølting Brodal
:
A Simple Greedy Algorithm for Dynamic Graph Orientation. Algorithmica 82(2): 245-259 (2020)- [j32]Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Fully persistent B-trees. Theor. Comput. Sci. 841: 10-26 (2020) - [i10]Gerth Stølting Brodal:
Soft Sequence Heaps. CoRR abs/2008.05398 (2020)
2010 – 2019
- 2019
- [i9]Riko Jacob, Gerth Stølting Brodal:
Dynamic Planar Convex Hull. CoRR abs/1902.11169 (2019) - [i8]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): 104-124 (2019) - 2017
- [c83]Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. ESA 2017: 21:1-21:14 - [c82]Edvin Berglin, Gerth Stølting Brodal:
A Simple Greedy Algorithm for Dynamic Graph Orientation. ISAAC 2017: 12:1-12:12 - [i7]Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. CoRR abs/1706.10284 (2017) - 2016
- [j31]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: 33-43 (2016) - [c81]Gerth Stølting Brodal:
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. STACS 2016: 23:1-23:14 - [r4]Gerth Stølting Brodal:
Cache-Oblivious Sorting. Encyclopedia of Algorithms 2016: 269-273 - 2015
- [j30]Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis:
D2-Tree: A New Overlay with Deterministic Bounds. Algorithmica 72(3): 860-883 (2015) - [j29]Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56(1): 22-40 (2015) - [c80]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. WADS 2015: 91-102 - [i6]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. CoRR abs/1505.00147 (2015) - [i5]Gerth Stølting Brodal:
External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates. CoRR abs/1509.08240 (2015) - 2014
- [j28]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): 2079-2080 (2014) - [j27]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: 34-44 (2014) - [j26]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: 58-74 (2014) - [c79]Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal:
On the Scalability of Computing Triplet and Quartet Distances. ALENEX 2014: 9-19 - [c78]Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen:
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). SWAT 2014: 26-37 - [c77]Gerth Stølting Brodal, Kasper Green Larsen:
Optimal Planar Orthogonal Skyline Counting Queries. SWAT 2014: 110-121 - 2013
- [j25]Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund:
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. BMC Bioinform. 14(S-2): S18 (2013) - [c76]Gerth Stølting Brodal:
A Survey on Priority Queues. Space-Efficient Data Structures, Streams, and Algorithms 2013: 150-163 - [c75]Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis:
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA 2013: 61-72 - [c74]Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi:
The Encoding Complexity of Two Dimensional Range Minimum Data Structures. ESA 2013: 229-240 - [c73]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: 1814-1832 - [i4]Gerth Stølting Brodal, Kasper Green Larsen:
Optimal Planar Orthogonal Skyline Counting Queries. CoRR abs/1304.7959 (2013) - 2012
- [j24]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63(1-2): 457-475 (2012) - [j23]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63(4): 815-830 (2012) - [c72]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao:
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228 - [c71]Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Finger Search in the Implicit Model. ISAAC 2012: 527-536 - [c70]Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas:
Fully persistent B-trees. SODA 2012: 602-614 - [c69]Gerth Stølting Brodal, Casper Kejlberg-Rasmussen:
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. STACS 2012: 112-123 - [c68]Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan:
Strict fibonacci heaps. STOC 2012: 1177-1184 - [i3]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 abs/1201.2702 (2012) - 2011
- [j22]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): 463-505 (2011) - [j21]Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel:
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9(4): 314-325 (2011) - [j20]Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders:
Towards optimal range medians. Theor. Comput. Sci. 412(24): 2588-2601 (2011) - [c67]Gerth Stølting Brodal, Konstantinos Tsakalidis:
Dynamic Planar Range Maxima Queries. ICALP (1) 2011: 256-267 - [c66]Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh:
Ordered and Unordered Top-K Range Reporting in Large Data Sets. SODA 2011: 390-400 - [c65]Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti:
Integer Representations towards Efficient Counting in the Bit Probe Model. TAMC 2011: 206-217 - [c64]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
Path Minima Queries in Dynamic Weighted Trees. WADS 2011: 290-301 - [c63]Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA 2011: 164-175 - [i2]Gerth Stølting Brodal, Casper Kejlberg-Rasmussen:
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property. CoRR abs/1112.5472 (2011) - 2010
- [j19]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): 934-962 (2010) - [c62]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. ESA (2) 2010: 171-182 - [c61]Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis:
D2-Tree: A New Overlay with Deterministic Bounds. ISAAC (2) 2010: 1-12 - [c60]Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen:
A Cache-Oblivious Implicit Dictionary with the Working Set Property. ISAAC (2) 2010: 37-48 - [c59]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: 1448-1456 - [i1]Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis:
D2-Tree: A New Overlay with Deterministic Bounds. CoRR abs/1009.3134 (2010)
2000 – 2009
- 2009
- [c58]Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz:
Online Sorted Range Reporting. ISAAC 2009: 173-182 - [c57]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: 193-202 - [c56]Gerth Stølting Brodal, Allan Grønlund Jørgensen:
Data Structures for Range Median Queries. ISAAC 2009: 822-831 - [c55]Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Counting in the Presence of Memory Faults. ISAAC 2009: 842-851 - [c54]Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave:
Fault Tolerant External Memory Algorithms. WADS 2009: 411-422 - 2008
- [j18]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): 37-50 (2008) - [j17]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12: 3.2:1-3.2:20 (2008) - [j16]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): 14-18 (2008) - [c53]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External memory planar point location with logarithmic updates. Symposium on Computational Geometry 2008: 139-147 - [c52]Gerth Stølting Brodal, Allan Grønlund Jørgensen:
Selecting Sums in Arrays. ISAAC 2008: 100-111 - [r3]Gerth Stølting Brodal:
Cache-Oblivious Sorting. Encyclopedia of Algorithms 2008 - 2007
- [j15]Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a cache-oblivious sorting algorithm. ACM J. Exp. Algorithmics 12: 2.2:1-2.2:23 (2007) - [c51]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: 91-100 - [c50]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: 101-110 - [c49]Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge:
The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN 2007: 445-464 - [c48]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: 347-358 - [c47]Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs. MFCS 2007: 406-417 - [c46]Gerth Stølting Brodal, Allan Grønlund Jørgensen:
A Linear Time Algorithm for the k Maximal Sums Problem. MFCS 2007: 442-453 - [c45]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: 61-70 - 2006
- [j14]Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips:
Recrafting the neighbor-joining method. BMC Bioinform. 7: 29 (2006) - [c44]Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz:
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM 2006: 330-341 - [c43]Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas:
Purely Functional Worst Case Constant Time Catenable Sorted Lists. ESA 2006: 172-183 - [c42]Gerth Stølting Brodal, Gabriel Moruz:
Skewed Binary Search Trees. ESA 2006: 708-719 - [c41]Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis:
Improved Dynamic Planar Point Location. FOCS 2006: 305-314 - [c40]Gerth Stølting Brodal, Rolf Fagerberg:
Cache-oblivious string dictionaries. SODA 2006: 581-590 - 2005
- [j13]Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro:
Fast allocation and deallocation with an improved buddy system. Acta Informatica 41(4-5): 273-291 (2005) - [c39]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the Adaptiveness of Quicksort. ALENEX/ANALCO 2005: 130-140 - [c38]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen:
Cache-oblivious planar orthogonal range searching and counting. Symposium on Computational Geometry 2005: 160-169 - [c37]Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP 2005: 576-588 - [c36]Gerth Stølting Brodal, Gabriel Moruz:
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. WADS 2005: 385-395 - [e2]Gerth Stølting Brodal, Stefano Leonardi:
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3669, Springer 2005, ISBN 3-540-29118-0 [contents] - 2004
- [j12]Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen:
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). Algorithmica 38(2): 377-395 (2004) - [j11]Gerth Stølting Brodal, Riko Jacob:
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electron. Notes Theor. Comput. Sci. 92: 3-15 (2004) - [j10]Lars Arge, Gerth Stølting Brodal, Laura Toma:
On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53(2): 186-206 (2004) - [c35]Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a Cache-Oblivious Sorting Algorith. ALENEX/ANALC 2004: 4-17 - [c34]Gerth Stølting Brodal:
Cache-Oblivious Algorithms and Data Structures. SWAT 2004: 3-13 - [c33]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: 480-492 - [r2]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg:
Cache-Oblivious Data Structures. Handbook of Data Structures and Applications 2004 - [r1]Gerth Stølting Brodal:
Finger Search Trees. Handbook of Data Structures and Applications 2004 - 2003
- [j9]Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal finger search trees in the pointer machine. J. Comput. Syst. Sci. 67(2): 381-418 (2003) - [c32]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. FOCS 2003: 271-282 - [c31]Gerth Stølting Brodal, Rolf Fagerberg:
Lower bounds for external memory dictionaries. SODA 2003: 546-554 - [c30]Gerth Stølting Brodal, Rolf Fagerberg:
On the limits of cache-obliviousness. STOC 2003: 307-315 - [c29]Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao:
Computing Refined Buneman Trees in Cubic Time. WABI 2003: 259-270 - 2002
- [j8]Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal Solutions for the Temporal Precedence Problem. Algorithmica 33(4): 494-510 (2002) - [c28]Gerth Stølting Brodal, Riko Jacob:
Dynamic Planar Convex Hull. FOCS 2002: 617-626 - [c27]Gerth Stølting Brodal, Rolf Fagerberg:
Cache Oblivious Distribution Sweeping. ICALP 2002: 426-438 - [c26]Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen:
Solving the String Statistics Problem in Time O(n log n). ICALP 2002: 728-739 - [c25]Gerth Stølting Brodal, Rolf Fagerberg:
Funnel Heap - A Cache Oblivious Priority Queue. ISAAC 2002: 219-228 - [c24]Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob:
Cache oblivious search trees via binary trees of small height. SODA 2002: 39-48 - [c23]Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal finger search trees in the pointer machine. STOC 2002: 583-591 - [c22]Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe:
Time and Space Efficient Multi-method Dispatching. SWAT 2002: 20-29 - 2001
- [j7]Gerth Stølting Brodal, Maria Cristina Pinotti:
Comparator networks for binary heap construction. Theor. Comput. Sci. 250(1-2): 235-245 (2001) - [c21]Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin:
The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151 - [c20]Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen:
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). ISAAC 2001: 731-742 - [c19]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Optimal static range reporting in one dimension. STOC 2001: 476-482 - [e1]Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela:
Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2141, Springer 2001, ISBN 3-540-42500-4 [contents] - 2000
- [j6]Gerth Stølting Brodal, Srinivasan Venkatesh:
Improved bounds for dictionary look-up with one error. Inf. Process. Lett. 75(1-2): 57-59 (2000) - [c18]Gerth Stølting Brodal, Christian N. S. Pedersen:
Finding Maximal Quasiperiodicities in Strings. CPM 2000: 397-411 - [c17]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
New Data Structures for Orthogonal Range Searching. FOCS 2000: 198-207 - [c16]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Pattern matching in dynamic texts. SODA 2000: 819-828 - [c15]Gerth Stølting Brodal, Riko Jacob:
Dynamic Planar Convex Hull with Optimal Query Time. SWAT 2000: 57-70 - [c14]Lars Arge, Gerth Stølting Brodal, Laura Toma:
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000: 433-447
1990 – 1999
- 1999
- [j5]Gerth Stølting Brodal:
Priority queues on parallel machines. Parallel Comput. 25(8): 987-1011 (1999) - [c13]Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye:
Finding Maximal Pairs with Bounded Gap. CPM 1999: 134-149 - [c12]Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter:
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA 1999: 11-20 - [c11]Gerth Stølting Brodal, Rolf Fagerberg:
Dynamic Representation of Sparse Graphs. WADS 1999: 342-351 - 1998
- [j4]Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis:
A Parallel Priority Queue with Constant Time Operations. J. Parallel Distributed Comput. 49(1): 4-21 (1998) - [c10]Gerth Stølting Brodal:
Finger Search Trees with Constant Insertion Time. SODA 1998: 540-549 - [c9]Gerth Stølting Brodal, Jyrki Katajainen:
Worst-Case External-Memory Priority Queues. SWAT 1998: 107-118 - [c8]Gerth Stølting Brodal, Maria Cristina Pinotti:
Comparator Networks for Binary Heap Construction. SWAT 1998: 158-168 - 1997
- [c7]Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis:
A Parallel Priority Data Structure with Applications. IPPS 1997: 689-693 - [c6]Gerth Stølting Brodal:
Predecessor Queries in Dynamic Integer Sets. STACS 1997: 21-32 - 1996
- [j3]Gerth Stølting Brodal, Chris Okasaki:
Optimal Purely Functional Priority Queues. J. Funct. Program. 6(6): 839-857 (1996) - [j2]Gerth Stølting Brodal:
Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nord. J. Comput. 3(3): 238-255 (1996) - [j1]Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3(4): 337-351 (1996) - [c5]Gerth Stølting Brodal, Leszek Gasieniec:
Approximate Dictionary Queries. CPM 1996: 65-74 - [c4]Gerth Stølting Brodal:
Worst-Case Efficient Priority Queues. SODA 1996: 52-58