Publications

[ Book chapters | Journal | Conference | TR | Theses | Hide duplicates ]

Book Chapters

Cache-Oblivious Sorting.
Gerth Stølting Brodal.
In Encyclopedia of Algorithms, Ming-Yang Kao (Edt.), pages 126-129. Springer, 2008. [10.1007/978-0-387-30162-4_63]
Cache-Oblivious Data Structures.
Lars Arge, Gerth Stølting Brodal, and Rolf Fagerberg.
In Handbook of Data Structures and Applications, Dinesh Mehta and Sartaj Sahni (Edt.), 27 pages. CRC Press, 2005. [10.1201/9781420035179.ch34]
Finger Search Trees.
Gerth Stølting Brodal.
In Handbook of Data Structures and Applications, Dinesh Mehta and Sartaj Sahni (Edt.), 11 pages. CRC Press, 2005. [10.1201/9781420035179.ch11]

Journal

Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, and S. Srinivasa Rao.
In Theoretical Computer Science, volume 638, pages 33-43, 2016. [10.1016/j.tcs.2016.02.016]
D2-Tree: A New Overlay with Deterministic Bounds.
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis.
In Algorithmica, volume 72(3), pages 860-883, 2015. [10.1007/s00453-014-9878-4]
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu.
In Theory of Computing Systems, Special issue of the 9th Workshop on Approximation and Online Algorithms, volume 56(1), pages 22-40, 2015. [10.1007/s00224-012-9427-y]
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, and Christian Nørgaard Storm Pedersen.
In Bioinformatics, 2014. [10.1093/bioinformatics/btu157]
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time.
Gerth Stølting Brodal, Alexis Kaporis, Apostolos Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas.
In Theoretical Computer Science, volume 526, pages 58-74, 2014. [10.1016/j.tcs.2014.01.014]
Integer Representations towards Efficient Counting in the Bit Probe Model.
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, and S. Srinivasa Rao.
In Journal of Discrete Algorithms, volume 26, pages 34-44, 2014. [10.1016/j.jda.2013.11.001]
10 Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees.
Andreas Sand, Morten Kragelund Holt, Jens Johansen, Rolf Fagerberg, Gerth Stølting Brodal, Christian Nørgaard Storm Pedersen, and Thomas Mailund.
In Biology - Special Issue on Developments in Bioinformatic Algorithms, volume 2(4), pages 1189-1209, 2013. [10.3390/biology2041189]
11 A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Thomas Mailund.
In BMC Bioinformatics, volume 14(Suppl 2), S18 pages, 2013. [10.1186/1471-2105-14-S2-S18]
12 External Memory Planar Point Location with Logarithmic Updates.
Lars Arge, Gerth Stølting Brodal, and S. Srinivasa Rao.
In Algorithmica, volume 63(1), pages 457-475, 2012. [10.1007/s00453-011-9541-2]
13 On Space Efficient Two Dimensional Range Minimum Data Structures.
Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao.
In Algorithmica, Special issue on ESA 2010, volume 63(4), pages 815-830, 2012. [10.1007/s00453-011-9499-0]
14 Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, and Elias Vicari.
In Theory of Computing Systems, Special issue of SPAA'07, volume 47(4), pages 934-962, 2010. [10.1007/s00224-010-9285-4]
15 Towards Optimal Range Median.
Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, and Peter Sanders.
In Theoretical Computer Science, Special issue of ICALP'09, volume 412(24), pages 2588-2601, 2011. [10.1016/j.tcs.2010.05.003]
16 Faster Algorithms for Computing Longest Common Increasing Subsequences.
Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, and Irit Katriel.
In Journal of Discrete Algorithms, Special Issue of CPM 2006, volume 9(4), pages 314-325, 2011. [10.1016/j.jda.2011.03.013]
17 The Cost of Cache-Oblivious Searching.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro López-Ortiz.
In Algorithmica, volume 61(2), pages 463-505, 2011. [10.1007/s00453-010-9394-0]
18 Computing the All-Pairs Quartet Distance on a set of Evolutionary Trees.
Martin Stissing, Thomas Mailund, Christian Nørgaard Storm Pedersen, Gerth Stølting Brodal, and Rolf Fagerberg.
In Journal of Bioinformatics and Computational Biology, volume 6(1), pages 37-50, 2008. [10.1142/S0219720008003266]
19 On the Adaptiveness of Quicksort.
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz.
In ACM Journal of Experimental Algorithmics, Special Issue of ALENEX 2005, volume 12(Article No. 3.2), 19 pages, 2008. [10.1145/1227161.1402294]
20 An O(nlog n) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree.
Gerth Stølting Brodal, Loukas Georgiadis, and Irit Katriel.
In Operations Research Letters, volume 36(1), pages 14-18, 2008. [10.1016/j.orl.2007.02.012]
21 Engineering a Cache-Oblivious Sorting Algorithm.
Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther.
In ACM Journal of Experimental Algorithmics, Special Issue of ALENEX 2004, volume 12(Article No. 2.2), 23 pages, 2007. [10.1145/1227161.1227164]
22 Recrafting the Neighbor-Joining Method.
Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Derek Phillips.
In BMC Bioinformatics, volume 7(29), 2006. [10.1186/1471-2105-7-29]
23 Fast Allocation and Deallocation with an Improved Buddy System.
Gerth Stølting Brodal, Erik D. Demaine, and J. Ian Munro.
In Acta Informatica, volume 41(4-5), pages 273-291, 2005. [10.1007/s00236-004-0159-6]
24 On External-Memory MST, SSSP and Multi-way Planar Graph Separation.
Lars Arge, Gerth Stølting Brodal, and Laura Toma.
In Journal of Algorithms, volume 53(2), pages 186-206, 2004. [10.1016/j.jalgor.2004.04.001]
25 Computing the Quartet Distance Between Evolutionary Trees in Time O(nlog n).
Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen.
In Algorithmica, Special issue on ISAAC 2001, volume 38(2), pages 377-395, 2004. [10.1007/s00453-003-1065-y]
26 Optimal Finger Search Trees in the Pointer Machine.
Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas.
In Journal of Computer and System Sciences, Special issue on STOC 2002, volume 67(2), pages 381-418, 2003. [10.1016/S0022-0000(03)00013-8]
27 Optimal Solutions for the Temporal Precedence Problem.
Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, and Kostas Tsichlas.
In Algorithmica, volume 33(4), pages 494-510, 2002. [10.1007/s00453-002-0935-z]
28 Comparator Networks for Binary Heap Construction.
Gerth Stølting Brodal and M. Cristina Pinotti.
In Theoretical Computer Science, volume 250(1-2), pages 235-245, 2001. [10.1016/S0304-3975(99)00137-1]
29 Improved Bounds for Dictionary Look-up with One Error.
Gerth Stølting Brodal and Venkatesh Srinivasan.
In Information Processing Letters, volume 75(1-2), pages 57-59, 2000. [10.1016/S0020-0190(00)00079-X]
30 Finding Maximal Pairs with Bounded Gap.
Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye.
In Journal of Discrete Algorithms, Special Issue of Matching Patterns, volume 1(1), pages 77-104, 2000.
31 Priority Queues on Parallel Machines.
Gerth Stølting Brodal.
In Parallel Computing, volume 25(8), pages 987-1011, 1999. [10.1016/S0167-8191(99)00032-0]
32 A Parallel Priority Queue with Constant Time Operations.
Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis.
In Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures, volume 49(1), pages 4-21, 1998. [10.1006/jpdc.1998.1425]
33 The Randomized Complexity of Maintaining the Minimum.
Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan.
In Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), volume 3(4), pages 337-351, 1996.
34 Partially Persistent Data Structures of Bounded Degree with Constant Update Time.
Gerth Stølting Brodal.
In Nordic Journal of Computing, volume 3(3), pages 238-255, 1996.
35 Optimal Purely Functional Priority Queues.
Gerth Stølting Brodal and Chris Okasaki.
In Journal of Functional Programming, volume 6(6), pages 839-858, 1996. [10.1017/S095679680000201X]

Conference Proceedings

36 Cache Oblivious Algorithms for Computing the Triplet Distance between Trees.
Gerth Stølting Brodal and Konstantinos Mampentzidis.
In Proc. 25th Annual European Symposium on Algorithms, Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2017.
37 External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.
Gerth Stølting Brodal.
In Proc. 33rd Annual Symposium on Theoretical Aspects of Computer Science, volume 47 of Leibniz International Proceedings in Informatics, 23:1-23:14 pages. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2016. [10.4230/LIPIcs.STACS.2016.23]
38 Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen.
In Proc. 14th International Workshop on Algorithms and Data Structures, volume 9214 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, Berlin, 2015. [10.1007/978-3-319-21840-3_8]
39 Expected Linear Time Sorting for Word Size Ω(log2 nloglog n).
Djamal Belazzougui, Gerth Stølting Brodal, and Jesper Sindahl Nielsen.
In Proc. 14th Scandinavian Workshop on Algorithm Theory, volume 8503 of Lecture Notes in Computer Science, pages 26-37. Springer Verlag, Berlin, 2014. [10.1007/978-3-319-08404-6_3]
40 Optimal Planar Orthogonal Skyline Counting Queries.
Gerth Stølting Brodal and Kasper Green Larsen.
In Proc. 14th Scandinavian Workshop on Algorithm Theory, volume 8503 of Lecture Notes in Computer Science, pages 98-109. Springer Verlag, Berlin, 2014. [10.1007/978-3-319-08404-6_10]
41 On the Scalability of Computing Triplet and Quartet Distances.
Morten Kragelund Holt, Jens Johansen, and Gerth Stølting Brodal.
In Proc. 16th Workshop on Algorithm Engineering and Experiments, pages 9-19, 2014. [10.1137/1.9781611973198.2]
42 An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.
Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, and Constantinos Tsirogiannis.
In Proc. 21st Annual European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science, pages 61-72. Springer Verlag, Berlin, 2013. [10.1007/978-3-642-40450-4_6]
43 The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
Gerth Stølting Brodal, Andrej Brodnik, and Pooya Davoodi.
In Proc. 21st Annual European Symposium on Algorithms, volume 8125 of Lecture Notes in Computer Science, pages 229-240. Springer Verlag, Berlin, 2013. [10.1007/978-3-642-40450-4_20]
44 A Survey on Priority Queues.
Gerth Stølting Brodal.
In Proc. Conference on Space Efficient Data Structures, Streams and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, volume 8066 of Lecture Notes in Computer Science, pages 150-163. Springer Verlag, Berlin, 2013. [10.1007/978-3-642-40273-9_11]
(11) A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Thomas Mailund.
In Proc. 11th Asia Pacific Bioinformatics Conference. Tsinghua University Press, 2013.
45 Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree.
Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, Thomas Mailund, and Andreas Sand.
In Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1814-1832, 2013. [knowledgecenter.siam.org/0236-000098]
46 Finger Search in the Implicit Model.
Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen.
In Proc. 23th Annual International Symposium on Algorithms and Computation, volume 7676 of Lecture Notes in Computer Science, pages 527-536. Springer Verlag, Berlin, 2012. [10.1007/978-3-642-35261-4_55]
47 Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, and S. Srinivasa Rao.
In Proc. 20th Annual European Symposium on Algorithms, volume 7501 of Lecture Notes in Computer Science, pages 217-228. Springer Verlag, Berlin, 2012. [10.1007/978-3-642-33090-2_20]
48 Strict Fibonacci Heaps.
Gerth Stølting Brodal, George Lagogiannis, and Robert E. Tarjan.
In Proc. 44th Annual ACM Symposium on Theory of Computing, pages 1177-1184, 2012. [10.1145/2213977.2214082]
49 Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property.
Gerth Stølting Brodal and Casper Kejlberg-Rasmussen.
In Proc. 29th Annual Symposium on Theoretical Aspects of Computer Science, volume 14 of Leibniz International Proceedings in Informatics, pages 112-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2012. [10.4230/LIPIcs.STACS.2012.112]
50 Fully Persistent B-trees.
Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas.
In Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 602-614, 2012. [siam.omnibooksonline.com/2012SODA/data/papers/498.pdf]
(6) OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Gerth Stølting Brodal, Gabriel Moruz, and Andrei Negoescu.
In Proc. 9th Workshop on Approximation and Online Algorithms, volume 7164 of Lecture Notes in Computer Science, pages 164-175. Springer Verlag, Berlin, 2011. [10.1007/978-3-642-29116-6_14]
51 Path Minima Queries in Dynamic Weighted Trees.
Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao.
In Proc. 12th International Workshop on Algorithms and Data Structures, volume 6844 of Lecture Notes in Computer Science, pages 290-301. Springer Verlag, Berlin, 2011. [10.1007/978-3-642-22300-6_25]
52 Dynamic Planar Range Maxima Queries.
Gerth Stølting Brodal and Konstantinos Tsakalidis.
In Proc. 38th International Colloquium on Automata, Languages, and Programming, volume 6755 of Lecture Notes in Computer Science, pages 256-267. Springer Verlag, Berlin, 2011. [10.1007/978-3-642-22006-7_22]
(9) Integer Representations towards Efficient Counting in the Bit Probe Model.
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, and S. Srinivasa Rao.
In Proc. 8th Annual Conference on Theory and Applications of Models of Computation, volume 6648 of Lecture Notes in Computer Science, pages 206-217. Springer Verlag, Berlin, 2011. [10.1007/978-3-642-20877-5_22]
53 Ordered and Unordered Top-K Range Reporting in Large Data Sets.
Peyman Afshani, Gerth Stølting Brodal, and Norbert Zeh.
In Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 390-400, 2011. [www.siam.org/proceedings/soda/2011/SODA11_031_afshanip.pdf]
(5) D2-Tree: A New Overlay with Deterministic Bounds.
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis.
In Proc. 21th Annual International Symposium on Algorithms and Computation, Part II, volume 6507 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, Berlin, 2010. [10.1007/978-3-642-17514-5_1]
54 A Cache-Oblivious Implicit Dictionary with the Working Set Property.
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, and Jakob Truelsen.
In Proc. 21th Annual International Symposium on Algorithms and Computation, Part II, volume 6507 of Lecture Notes in Computer Science, pages 37-48. Springer Verlag, Berlin, 2010. [10.1007/978-3-642-17514-5_4]
(13) On Space Efficient Two Dimensional Range Minimum Data Structures.
Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao.
In Proc. 18th Annual European Symposium on Algorithms, volume 6347 of Lecture Notes in Computer Science, pages 171-182. Springer Verlag, Berlin, 2010. [10.1007/978-3-642-15781-3_15]
55 Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff.
Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, and J. Ian Munro.
In Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1448-1456, 2010. [www.siam.org/proceedings/soda/2010/SODA10_117_brodalg.pdf]
(15) Data Structures for Range Median Queries.
Gerth Stølting Brodal and Allan Grønlund Jørgensen.
In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 822-831. Springer Verlag, Berlin, 2009. [10.1007/978-3-642-10631-6_83]
56 Online Sorted Range Reporting.
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, and Alejandro López-Ortiz.
In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 173-182. Springer Verlag, Berlin, 2009. [10.1007/978-3-642-10631-6_19]
(8) Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time.
Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas.
In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 193-202. Springer Verlag, Berlin, 2009. [10.1007/978-3-642-10631-6_21]
57 Counting in the Presence of Memory Faults.
Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave.
In Proc. 20th Annual International Symposium on Algorithms and Computation, volume 5878 of Lecture Notes in Computer Science, pages 842-851. Springer Verlag, Berlin, 2009. [10.1007/978-3-642-10631-6_85]
58 Fault Tolerant External Memory Algorithms.
Gerth Stølting Brodal, Allan Grønlund Jørgensen, and Thomas Mølhave.
In Proc. 11th International Workshop on Algorithms and Data Structures, volume 5664 of Lecture Notes in Computer Science, pages 411-422. Springer Verlag, Berlin, 2009. [10.1007/978-3-642-03367-4_36]
59 Selecting Sums in Arrays.
Gerth Stølting Brodal and Allan Grønlund Jørgensen.
In Proc. 19th Annual International Symposium on Algorithms and Computation, volume 5369 of Lecture Notes in Computer Science, pages 100-111. Springer Verlag, Berlin, 2008. [10.1007/978-3-540-92182-0_12]
(12) External memory planar point location with logarithmic updates.
Lars Arge, Gerth Stølting Brodal, and S. Srinivasa Rao.
In Proc. 24st Annual ACM Symposium on Computational Geometry, pages 139-147, 2008. [10.1145/1377676.1377699]
60 Optimal Resilient Dynamic Dictionaries.
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave.
In Proc. 15th Annual European Symposium on Algorithms, volume 4708 of Lecture Notes in Computer Science, pages 347-358. Springer Verlag, Berlin, 2007. [10.1007/978-3-540-75520-3_32]
61 Dynamic Matchings in Convex Bipartite Graphs.
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer A. Hansen, and Irit Katriel.
In Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, volume 4708 of Lecture Notes in Computer Science, pages 406-417. Springer Verlag, Berlin, 2007. [10.1007/978-3-540-74456-6_37]
62 A Linear Time Algorithm for the k Maximal Sums Problem.
Gerth Stølting Brodal and Allan Grønlund Jørgensen.
In Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, volume 4708 of Lecture Notes in Computer Science, pages 442-453. Springer Verlag, Berlin, 2007. [10.1007/978-3-540-74456-6_40]
63 The ComBack Method - Extending Hash Compaction with Backtracking.
Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, and Lars Arge.
In Proc. 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, volume 4546 of Lecture Notes in Computer Science, pages 445-464. Springer Verlag, Berlin, 2007. [10.1007/978-3-540-73094-1_26]
(14) Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, and Elias Vicari.
In Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures, pages 61-70, 2007. [10.1145/1248377.1248391]
64 Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Martin Stissing, Christian Nørgaard Storm Pedersen, Thomas Mailund, Gerth Stølting Brodal, and Rolf Fagerberg.
In Proc. 5th Asia Pacific Bioinformatics Conference, volume 5 of Advances in Bioinformatics & Computational Biology, pages 101-110. Imperial College Press, 2007. [10.1142/9781860947995_0013]
(18) Computing the All-Pairs Quartet Distance on a set of Evolutionary Trees.
Martin Stissing, Thomas Mailund, Christian Nørgaard Storm Pedersen, Gerth Stølting Brodal, and Rolf Fagerberg.
In Proc. 5th Asia Pacific Bioinformatics Conference, Advances in Bioinformatics & Computational Biology, pages 91-100. Imperial College Press, 2007. [10.1142/9781860947995_0012]
65 Improved Dynamic Planar Point Location.
Lars Arge, Gerth Stølting Brodal, and Loukas Georgiadis.
In Proc. 47th Annual Symposium on Foundations of Computer Science, pages 305-314, 2006. [10.1109/FOCS.2006.40]
66 Purely Functional Worst Case Constant Time Catenable Sorted Lists.
Gerth Stølting Brodal, Christos Makris, and Kostas Tsichlas.
In Proc. 14th Annual European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 172-183. Springer Verlag, Berlin, 2006. [10.1007/11841036_18]
67 Skewed Binary Search Trees.
Gerth Stølting Brodal and Gabriel Moruz.
In Proc. 14th Annual European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 708-719. Springer Verlag, Berlin, 2006. [10.1007/11841036_63]
(16) Faster Algorithms for Computing Longest Common Increasing Subsequences.
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz.
In Proc. 17th Annual Symposium on Combinatorial Pattern Matching, volume 4009 of Lecture Notes in Computer Science, pages 330-341. Springer Verlag, Berlin, 2006. [10.1007/11780441_30]
68 Cache-oblivious String Dictionaries.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 581-590, 2006. [10.1145/1109557.1109621]
69 Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.
Gerth Stølting Brodal and Gabriel Moruz.
In Proc. 9th International Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science, pages 385-395. Springer Verlag, Berlin, 2005. [10.1007/11534273_34]
70 Cache-Aware and Cache-Oblivious Adaptive Sorting.
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz.
In Proc. 32nd International Colloquium on Automata, Languages, and Programming, volume 3580 of Lecture Notes in Computer Science, pages 576-588. Springer Verlag, Berlin, 2005. [10.1007/11523468_47]
71 Cache-Oblivious Planar Orthogonal Range Searching and Counting.
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, and Morten Laustsen.
In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 160-169, 2005. [10.1145/1064092.1064119]
(19) On the Adaptiveness of Quicksort.
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz.
In Proc. 7th Workshop on Algorithm Engineering and Experiments, pages 130-140, 2005. [www.siam.org/meetings/alenex05/papers/12gbrodal.pdf]
72 Cache-Oblivious Algorithms and Data Structures.
Gerth Stølting Brodal.
In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 3-13. Springer Verlag, Berlin, 2004. [10.1007/978-3-540-27810-8_2]
73 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh.
In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 480-492. Springer Verlag, Berlin, 2004. [10.1007/978-3-540-27810-8_41]
(21) Engineering a Cache-Oblivious Sorting Algorithm.
Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther.
In Proc. 6th Workshop on Algorithm Engineering and Experiments, pages 4-17, 2004. [www.siam.org/meetings/alenex04/abstacts/alenex04.pdf]
74 Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries.
Gerth Stølting Brodal and Riko Jacob.
In Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003), volume 92(1) of Electronic Notes in Theoretical Computer Science, 12 pages. Elsevier Science, 2003. [10.1016/j.entcs.2003.12.019]
(17) The Cost of Cache-Oblivious Searching.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro López-Ortiz.
In Proc. 44th Annual Symposium on Foundations of Computer Science, pages 271-282, 2003. [10.1109/SFCS.2003.1238201]
75 Computing Refined Buneman Trees in Cubic Time.
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao.
In Proc. 3rd Workshop on Algorithms in BioInformatics, volume 2812 of Lecture Notes in Computer Science, pages 259-270. Springer Verlag, Berlin, 2003. [10.1007/978-3-540-39763-2_20]
76 On the Limits of Cache-Obliviousness.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 35th Annual ACM Symposium on Theory of Computing, pages 307-315, 2003. [10.1145/780542.780589]
77 Lower Bounds for External Memory Dictionaries.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 546-554, 2003. [doi.acm.org/10.1145/644108.644201]
78 Funnel Heap - A Cache Oblivious Priority Queue.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 219-228. Springer Verlag, Berlin, 2002. [10.1007/3-540-36136-7_20]
79 Dynamic Planar Convex Hull.
Gerth Stølting Brodal and Riko Jacob.
In Proc. 43rd Annual Symposium on Foundations of Computer Science, pages 617-626, 2002. [10.1109/SFCS.2002.1181985]
80 Time and Space Efficient Multi-Method Dispatching.
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe.
In Proc. 8th Scandinavian Workshop on Algorithm Theory, volume 2368 of Lecture Notes in Computer Science, pages 20-29. Springer Verlag, Berlin, 2002. [10.1007/3-540-45471-3_3]
81 Cache Oblivious Distribution Sweeping.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 426-438. Springer Verlag, Berlin, 2002. [10.1007/3-540-45465-9_37]
82 Solving the String Statistics Problem in Time O(nlog n).
Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen.
In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 728-739. Springer Verlag, Berlin, 2002. [10.1007/3-540-45465-9_62]
(26) Optimal Finger Search Trees in the Pointer Machine.
Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas.
In Proc. 34th Annual ACM Symposium on Theory of Computing, pages 583-591, 2002. [10.1145/509907.509991]
83 Cache-Oblivious Search Trees via Binary Trees of Small Height.
Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob.
In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002. [doi.acm.org/10.1145/545381.545386]
(25) Computing the Quartet Distance Between Evolutionary Trees in Time O(nlog2 n).
Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen.
In Proc. 12th Annual International Symposium on Algorithms and Computation, volume 2223 of Lecture Notes in Computer Science, pages 731-742. Springer Verlag, Berlin, 2001. [10.1007/3-540-45678-3_62]
84 The Complexity of Constructing Evolutionary Trees Using Experiments.
Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin.
In Proc. 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 140-151. Springer Verlag, Berlin, 2001. [10.1007/3-540-48224-5_12]
85 Optimal Static Range Reporting in One Dimension.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
In Proc. 33rd Annual ACM Symposium on Theory of Computing, pages 476-482, 2001. [10.1145/380752.380842]
86 New Data Structures for Orthogonal Range Searching.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 198-207, 2000. [10.1109/SFCS.2000.892088]
87 Dynamic Planar Convex Hull with Optimal Query Time and O(log nĚloglog n) Update Time.
Gerth Stølting Brodal and Riko Jacob.
In Proc. 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 57-70. Springer Verlag, Berlin, 2000. [10.1007/3-540-44985-X_7]
(24) On External Memory MST, SSSP and Multi-way Planar Graph Separation.
Lars Arge, Gerth Stølting Brodal, and Laura Toma.
In Proc. 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 433-447. Springer Verlag, Berlin, 2000. [10.1007/3-540-44985-X_37]
88 Finding Maximal Quasiperiodicities in Strings.
Gerth Stølting Brodal and Christian Nørgaard Storm Pedersen.
In Proc. 11th Annual Symposium on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 397-411. Springer Verlag, Berlin, 2000. [10.1007/3-540-45123-4_33]
89 Pattern Matching in Dynamic Texts.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 819-828, 2000. [doi.acm.org/10.1145/338219.338645]
90 Dynamic Representations of Sparse Graphs.
Gerth Stølting Brodal and Rolf Fagerberg.
In Proc. 6th International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 342-351. Springer Verlag, Berlin, 1999. [10.1007/3-540-48447-7_34]
(30) Finding Maximal Pairs with Bounded Gap.
Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye.
In Proc. 10th Annual Symposium on Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science, pages 134-149. Springer Verlag, Berlin, 1999. [10.1007/3-540-48452-3_11]
91 I/O-Efficient Dynamic Point Location in Monotone Subdivisions.
Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, and Jeff Vitter.
In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 11-20, 1999. [doi.acm.org/10.1145/314500.314525]
92 Worst-Case Efficient External-Memory Priority Queues.
Gerth Stølting Brodal and Jyrki Katajainen.
In Proc. 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 107-118. Springer Verlag, Berlin, 1998. [10.1007/BFb0054359]
(28) Comparator Networks for Binary Heap Construction.
Gerth Stølting Brodal and M. Cristina Pinotti.
In Proc. 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 158-168. Springer Verlag, Berlin, 1998. [10.1007/BFb0054364]
93 Finger Search Trees with Constant Insertion Time.
Gerth Stølting Brodal.
In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540-549, 1998. [doi.acm.org/10.1145/314613.314842]
(32) A Parallel Priority Data Structure with Applications.
Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis.
In Proc. 11th International Parallel Processing Symposium, Dror G. Feitelson and Larry Rudolph (Edt.), pages 689-693, IEEE Comput. Soc. Press, 1997. [10.1109/IPPS.1997.580979]
94 Predecessor Queries in Dynamic Integer Sets.
Gerth Stølting Brodal.
In Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 21-32. Springer Verlag, Berlin, 1997. [10.1007/BFb0023445]
(33) The Randomized Complexity of Maintaining the Minimum.
Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan.
In Proc. 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 4-15. Springer Verlag, Berlin, 1996. [10.1007/3-540-61422-2_116]
(31) Priority Queues on Parallel Machines.
Gerth Stølting Brodal.
In Proc. 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 416-427. Springer Verlag, Berlin, 1996. [10.1007/3-540-61422-2_150]
95 Approximate Dictionary Queries.
Gerth Stølting Brodal and Leszek Gasieniec.
In Proc. 7th Annual Symposium on Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 65-74. Springer Verlag, Berlin, 1996. [10.1007/3-540-61258-0_6]
96 Worst-Case Efficient Priority Queues.
Gerth Stølting Brodal.
In Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 52-58, 1996. [doi.acm.org/10.1145/313852.313883]
97 Fast Meldable Priority Queues.
Gerth Stølting Brodal.
In Proc. 4th International Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 282-290. Springer Verlag, Berlin, 1995. [10.1007/3-540-60220-8_70]

Technical Reports

(37) External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.
Gerth Stølting Brodal.
Technical Report, 1509.08240, arXiv.org, 16 pages, September 2015.
(38) Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
Gerth Stølting Brodal, Jesper Sindahl Nielsen, and Jakob Truelsen.
Technical Report, 1505.00147., arXiv.org, 15 pages, May 2015.
(40) Optimal Planar Orthogonal Skyline Counting Queries.
Gerth Stølting Brodal and Kasper Green Larsen.
Technical Report, 1304.7959, arXiv.org, 17 pages, April 2013.
(8) Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time.
Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, and Kostas Tsichlas.
Technical Report, 1201.2702, arXiv.org, 29 pages, January 2012.
(49) Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property.
Gerth Stølting Brodal and Casper Kejlberg-Rasmussen.
Technical Report, 1112.5472, arXiv.org, 16 pages, December 2011.
(5) D2-Tree: A New Overlay with Deterministic Bounds.
Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis.
Technical Report, 1009.3134, arXiv.org, 21 pages, September 2010.
(60) Optimal Resilient Dynamic Dictionaries.
Gerth Stølting Brodal, Rolf Fagerberg, Allan Grønlund Jørgensen, Gabriel Moruz, and Thomas Mølhave.
Technical Report, DAIMI PB-585, Department of Computer Science, Aarhus University, 14 pages, November 2007.
(16) Faster Algorithms for Computing Longest Common Increasing Subsequences.
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz.
Technical Report, BRICS-RS-05-37, BRICS, Department of Computer Science, Aarhus University, 16 pages, December 2005.
(19) On the Adaptiveness of Quicksort.
Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz.
Technical Report, BRICS-RS-04-27, BRICS, Department of Computer Science, Aarhus University, 23 pages, December 2004.
(73) Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh.
Technical Report, BRICS-RS-04-2, BRICS, Department of Computer Science, Aarhus University, 19 pages, January 2004.
(22) Speeding Up Neighbour-Joining Tree Construction.
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian Nørgaard Storm Pedersen, and Derek Phillips.
Technical Report, ALCOMFT-TR-03-102, ALCOM-FT, 9 pages, November 2003.
(21) Engineering a Cache-Oblivious Sorting Algorithm.
Gerth Stølting Brodal, Rolf Fagerberg, and Kristoffer Vinther.
Technical Report, ALCOMFT-TR-03-101, ALCOM-FT, 16 pages, November 2003.
(75) Computing Refined Buneman Trees in Cubic Time.
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao.
Technical Report, ALCOMFT-TR-03-73, ALCOM-FT, 11 pages, November 2003.
(76) On the Limits of Cache-Obliviousness.
Gerth Stølting Brodal and Rolf Fagerberg.
Technical Report, ALCOMFT-TR-03-74, ALCOM-FT, 17 pages, November 2003.
(77) Lower Bounds for External Memory Dictionaries.
Gerth Stølting Brodal and Rolf Fagerberg.
Technical Report, ALCOMFT-TR-03-75, ALCOM-FT, 13 pages, November 2003.
(17) The Cost of Cache-Oblivious Searching.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro López-Ortiz.
Technical Report, ALCOMFT-TR-03-76, ALCOM-FT, 18 pages, November 2003.
(23) Fast Allocation and Deallocation with an Improved Buddy System.
Gerth Stølting Brodal, Erik D. Demaine, and J. Ian Munro.
Technical Report, ALCOMFT-TR-03-3, ALCOM-FT, 15 pages, May 2003.
(75) Computing Refined Buneman Trees in Cubic Time.
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao.
Technical Report, BRICS-RS-02-51, BRICS, Department of Computer Science, Aarhus University, 14 pages, December 2002.
(78) Funnel Heap - A Cache Oblivious Priority Queue.
Gerth Stølting Brodal and Rolf Fagerberg.
Technical Report, ALCOMFT-TR-02-136, ALCOM-FT, 11 pages, June 2002.
(26) Optimal Finger Search Trees in the Pointer Machine.
Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios Tsakalidis, and Kostas Tsichlas.
Technical Report, ALCOMFT-TR-02-77, ALCOM-FT, 17 pages, May 2002.
(80) Time and Space Efficient Multi-Method Dispatching.
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe.
Technical Report, ALCOMFT-TR-02-76, ALCOM-FT, 9 pages, May 2002.
(82) Solving the String Statistics Problem in Time O(nlog n).
Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen.
Technical Report, BRICS-RS-02-13, BRICS, Department of Computer Science, Aarhus University, 28 pages, October 2002.
(82) Solving the String Statistics Problem in Time O(nlog n).
Gerth Stølting Brodal, Rune Bang Lyngsø, Anna Östlin, and Christian Nørgaard Storm Pedersen.
Technical Report, ALCOMFT-TR-02-55, ALCOM-FT, 12 pages, May 2002.
(25) Computing the Quartet Distance Between Evolutionary Trees in Time O(nlog n).
Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen.
Technical Report, ALCOMFT-TR-02-54, ALCOM-FT, 15 pages, May 2002.
(83) Cache-Oblivious Search Trees via Trees of Small Height.
Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob.
Technical Report, ALCOMFT-TR-02-53, ALCOM-FT, 20 pages, May 2002.
(81) Cache Oblivious Distribution Sweeping.
Gerth Stølting Brodal and Rolf Fagerberg.
Technical Report, BRICS-RS-02-18, BRICS, Department of Computer Science, Aarhus University, 21 pages, 2009.
(81) Cache Oblivious Distribution Sweeping.
Gerth Stølting Brodal and Rolf Fagerberg.
Technical Report, ALCOMFT-TR-02-52, ALCOM-FT, 22 pages, May 2002.
(83) Cache Oblivious Search Trees via Binary Trees of Small Height.
Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob.
Technical Report, BRICS-RS-01-36, BRICS, Department of Computer Science, Aarhus University, 20 pages, October 2001.
(84) The Complexity of Constructing Evolutionary Trees Using Experiments.
Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin.
Technical Report, BRICS-RS-01-1, BRICS, Department of Computer Science, Aarhus University, 27 pages, July 2001.
(74) Time-dependent networks as models to achieve fast exact time-table queries.
Gerth Stølting Brodal and Riko Jacob.
Technical Report, ALCOMFT-TR-01-176, ALCOM-FT, 12 pages, September 2001.
(25) Computing the Quartet Distance Between Evolutionary Trees in Time O(nlog2 n).
Gerth Stølting Brodal, Rolf Fagerberg, and Christian Nørgaard Storm Pedersen.
Technical Report, ALCOMFT-TR-01-131, ALCOM-FT, 12 pages, May 2001.
(84) The Complexity of Constructing Evolutionary Trees Using Experiments.
Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, and Anna Östlin.
Technical Report, ALCOMFT-TR-01-130, ALCOM-FT, 25 pages, May 2001.
(85) Optimal Static Range Reporting in One Dimension.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
Technical Report, ALCOMFT-TR-01-53, ALCOM-FT, 13 pages, May 2001.
(24) On External Memory MST, SSSP and Multi-way Planar Graph Separation.
Lars Arge, Gerth Stølting Brodal, and Laura Toma.
Technical Report, ALCOMFT-TR-01-38, ALCOM-FT, 14 pages, May 2001.
(86) New Data Structures for Orthogonal Range Searching.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
Technical Report, ALCOMFT-TR-01-35, ALCOM-FT, 17 pages, May 2001.
(87) Dynamic Planar Convex Hull with Optimal Query Time and O(log nĚloglog n) Update Time.
Gerth Stølting Brodal and Riko Jacob.
Technical Report, ALCOMFT-TR-01-34, ALCOM-FT, 14 pages, May 2001.
(80) Time and Space Efficient Multi-Method Dispatching.
Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe.
Technical Report, ITU-TR-2001-8, The IT University of Copenhagen, 13 pages, October 2001.
(85) Optimal Static Range Reporting in One Dimension.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
Technical Report, ITU-TR-2000-3, The IT University of Copenhagen, 12 pages, November 2000.
(29) Improved Bounds for Dictionary Look-up with One Error.
Gerth Stølting Brodal and Venkatesh Srinivasan.
Technical Report, BRICS-RS-99-50, BRICS, Department of Computer Science, Aarhus University, 5 pages, December 1999.
(88) Finding Maximal Quasiperiodicities in Strings.
Gerth Stølting Brodal and Christian Nørgaard Storm Pedersen.
Technical Report, BRICS-RS-99-25, BRICS, Department of Computer Science, Aarhus University, 20 pages, September 1999.
(30) Finding Maximal Pairs with Bounded Gap.
Gerth Stølting Brodal, Rune Bang Lyngsø, Christian Nørgaard Storm Pedersen, and Jens Stoye.
Technical Report, BRICS-RS-99-12, BRICS, Department of Computer Science, Aarhus University, 31 pages, April 1999.
(89) Dynamic Pattern Matching.
Stephen Alstrup, Gerth Stølting Brodal, and Theis Rauhe.
Technical Report, DIKU Report 98/27, Department of Computer Science, University of Copenhagen, 16 pages, 1998.
(28) Comparator Networks for Binary Heap Construction.
Gerth Stølting Brodal and M. Cristina Pinotti.
Technical Report, MPI-I-98-1-002, Max-Planck-Institut für Informatik, 11 pages, January 1998.
(92) Worst-Case Efficient External-Memory Priority Queues.
Gerth Stølting Brodal and Jyrki Katajainen.
Technical Report, DIKU Report 97/25, Department of Computer Science, University of Copenhagen, 16 pages, October 1997.
(93) Finger Search Trees with Constant Insertion Time.
Gerth Stølting Brodal.
Technical Report, MPI-I-97-1-020, Max-Planck-Institut für Informatik, 17 pages, September 1997.
(32) A Parallel Priority Queue with Constant Time Operations.
Gerth Stølting Brodal, Jesper Larsson Träff, and Christos D. Zaroliagis.
Technical Report, MPI-I-97-1-011, Max-Planck-Institut für Informatik, 19 pages, May 1997.
98 The Complexity of Computing the k-ary Composition of a Binary Associative Operator.
Gerth Stølting Brodal and Sven Skyum.
Technical Report, BRICS-RS-96-42, BRICS, Department of Computer Science, Aarhus University, 15 pages, November 1996.
(33) The Randomized Complexity of Maintaining the Minimum.
Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan.
Technical Report, BRICS-RS-96-40, BRICS, Department of Computer Science, Aarhus University, 20 pages, November 1996.
(33) The Randomized Complexity of Maintaining the Minimum.
Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan.
Technical Report, MPI-I-96-1-014, Max-Planck-Institut für Informatik, May 1996.
99 A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth.
Gerth Stølting Brodal and Thore Husfeldt.
Technical Report, BRICS-RS-96-1, BRICS, Department of Computer Science, Aarhus University, 3 pages, January 1996.
(35) Optimal Purely Functional Priority Queues.
Gerth Stølting Brodal and Chris Okasaki.
Technical Report, BRICS-RS-96-37, BRICS, Department of Computer Science, Aarhus University, 27 pages, October 1996.
(97) Fast Meldable Priority Queues.
Gerth Stølting Brodal.
Technical Report, BRICS-RS-95-12, BRICS, Department of Computer Science, Aarhus University, 12 pages, February 1995.
(34) Partially Persistent Data Structures of Bounded Degree with Constant Update Time.
Gerth Stølting Brodal.
Technical Report, BRICS-RS-94-35, BRICS, Department of Computer Science, Aarhus University, 24 pages, November 1994.

Theses

100 Worst Case Efficient Data Structures.
Gerth Stølting Brodal.
PhD Thesis, Department of Computer Science, Aarhus University, Denmark, x+121 pages, January 1997. BRICS-DS-97-1.
101 Complexity of Data Structures.
Gerth Stølting Brodal.
Progress report, Department of Computer Science, Aarhus University, Denmark, 29 pages, November 1994.

Note: Conference publications appearing in journals and technical reports appearing elsewhere are numbered in parenthesis with the newer appearance.