Aarhus University Seal / Aarhus Universitets segl

Gerth Stølting Brodal

  1. 2017
  2. Published

    Cache oblivious algorithms for computing the triplet distance between trees. / Brodal, Gerth Stølting; Mampentzidis, Konstantinos.

    25th European Symposium on Algorithms, ESA 2017. ed. / Kirk Pruhs; Christian Sohler. Vol. 87 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. p. 21:1--21:14 21.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  3. Published

    A simple greedy algorithm for dynamic graph orientation. / Berglin, Edvin; Brodal, Gerth Stølting.

    28th International Symposium on Algorithms and Computation (ISAAC 2017). ed. / Yoshio Okamoto ; Takeshi Tokuyama. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. p. 12:1-12:12.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  4. 2016
  5. Published

    Two dimensional range minimum queries and Fibonacci lattices. / Stølting Brodal, Gerth; Davoodi, Pooya; Lewenstein, Moshe; Raman, Rajeev; Satti, Srinivasa Rao.

    In: Theoretical Computer Science, Vol. 638, 25.07.2016, p. 33-43.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  6. Published

    External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. / Brodal, Gerth Stølting.

    33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). ed. / Nicolas Ollinger; Heribert Vollmer. Vol. 47 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. p. 23:1-23:14.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  7. 2015
  8. Published

    Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. / Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob.

    Algorithms and Data Structures: 14th International Symposium, WADS 2015, Proceedings. ed. / Frank Dehne; Jörg-Rüdiger Sack ; Ulrike Stege . Springer VS, 2015. p. 91-102.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  9. Published

    D2-tree : A new overlay with deterministic bounds. / Brodal, Gerth Stølting; Sioutas, Spyros; Pantazos, Kostas; Zaroliagis, Christos D.

    In: Algorithmica, Vol. 72, No. 3, 2015, p. 860-883.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  10. Published

    OnlineMin : A Fast Strongly Competitive Randomized Paging Algorithm. / Brodal, Gerth Stølting; Moruz, Gabriel; Negoescu, Andrei.

    In: Theory of Computing Systems, Vol. 56 , No. 1, 2015.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  11. 2014
  12. Published

    Dynamic 3-sided planar range queries with expected doubly-logarithmic time. / Stølting Brodal, Gerth; Kaporis, Alexis C.; Papadopoulos, Apostolos N.; Sioutas, Spyros; Tsakalidis, Konstantinos; Tsichlas, Kostas.

    In: Theoretical Computer Science, Vol. 526, No. March, 20.03.2014, p. 58-74.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  13. Published

    Expected linear time sorting for word size Ω(log2 n log log n). / Belazzougui, Djamal; Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl.

    Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. ed. / R. Ravi; Inge Li Gørtz. Springer VS, 2014. p. 26-37.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  14. Published

    Integer representations towards efficient counting in the bit probe model. / Brodal, Gerth Stølting; Greve, Mark; Pandy, Vineet; Satti, Srinivasa Rao .

    In: Journal of Discrete Algorithms, Vol. 26, No. May, 2014, p. 34–44.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  15. Published

    On the Scalability of Computing Triplet and Quartet Distances. / Holt, Morten Kragelund; Johansen, Jens; Brodal, Gerth Stølting.

    2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) . ed. / Catherine C. McGeoch; Ulrich Meyer. Society for Industrial and Applied Mathematics, 2014. p. 9-19.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  16. Published

    Optimal Planar Orthogonal Skyline Counting Queries. / Brodal, Gerth Stølting; Larsen, Kasper Green.

    Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Denmark. Proceedings. ed. / R. Ravi; Inge Li Gørtz. Springer VS, 2014. p. 110-121.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  17. Published

    tqDist: A Library for Computing the Quartet and Triplet Distances Between Binary and General Trees. / Sand, Andreas; Holt, Morten Kragelund; Johansen, Jens; Brodal, Gerth Stølting; Mailund, Thomas; Pedersen, Christian Nørgaard Storm.

    In: Bioinformatics, Vol. 30, No. 4, 2014, p. 2079-2080.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  18. 2013
  19. Published

    The encoding complexity of two dimensional range minimum data structures. / Brodal, Gerth Stølting; Brodnik, Andrej; Davoodi, Pooya.

    Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. ed. / Hans L. Bodlaender; Giuseppe F. Italiano . Springer VS, 2013. p. 229-240.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  20. Published

    A Survey on Priority Queues. / Brodal, Gerth Stølting.

    Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. ed. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman ; Alfredo Viola. Springer VS, 2013. p. 150-163 .

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  21. Published

    A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. / Sand, Andreas; Pedersen, Christian Nørgaard Storm; Mailund, Thomas; Brodal, Gerth Stølting; Fagerberg, Rolf.

    In: B M C Bioinformatics, Vol. 14, No. Suppl 2, 2013, p. S18.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  22. Published

    Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees. / Sand, Andreas; Holt, Morten Kragelund; Johansen, Jens; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm; Brodal, Gerth Stølting; Mailund, Thomas.

    In: Biology, Vol. 2, No. 4, 2013, p. 1189-1209.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  23. Published

    An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. / Arge, L.; Brodal, G.S.; Truelsen, J.; Tsirogiannis, C.

    Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Springer VS, 2013. p. 61-72.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  24. Published

    Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree. / Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, Thomas; Pedersen, Christian Nørgaard Storm; Sand, Andreas.

    In: The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, Vol. 24, 2013, p. 1814-1832.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  25. 2012
  26. Published

    Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. / Kejlberg-Rasmussen, Casper; Brodal, Gerth Stølting.

    In: Leibniz International Proceedings in Informatics, Vol. 14, 2012, p. 112--123.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  27. Published

    External Memory Planar Point Location with Logarithmic Updates. / Arge, Lars Allan; Brodal, Gerth Stølting; Satti, Srinivasa Rao.

    In: Algorithmica, Vol. 63, No. 1-2, 2012, p. 457-475.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  28. Published

    Finger Search in the Implicit Model. / Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob.

    In: Lecture Notes in Computer Science, Vol. 7676, 2012, p. 527-536 .

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  29. Published

    Fully Persistent B-trees. / Brodal, Gerth Stølting; Sioutas, Spyros; Tsakalidis, Konstantinos; Tsichlas, Kostas.

    In: The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, Vol. 23, 2012, p. 602-614.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  30. Published

    On Space Efficient Two Dimensional Range Minimum Data Structures. / Brodal, Gerth Stølting; Davoodi, Pooya; Rao, S. Srinivasa.

    In: Algorithmica, Vol. 63, No. 4, 2012, p. 815-830.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  31. Published

    OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. / Brodal, Gerth Stølting; Moruz, Gabriel; Negoescu, Andrei.

    In: Lecture Notes in Computer Science, Vol. 7164, 2012, p. 164-175 .

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  32. Published

    Strict fibonacci heaps. / Brodal, Gerth Stølting; Lagogiannis, George; Tarjan, Robert E. .

    STOC '12 Proceedings of the 44th symposium on Theory of Computing. Association for Computing Machinery, 2012. p. 1177-1184 .

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  33. Published

    Two Dimensional Range Minimum Queries and Fibonacci Lattices. / Brodal, Gerth Stølting; Davoodi, Pooya; Lewenstein, Moshe; Raman, Rajeev; Rao, Satti Srinivasa.

    In: Lecture Notes in Computer Science, Vol. 7501, 2012, p. 217-228 .

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  34. 2011
  35. Published

    Dynamic Planar Range Maxima Queries. / Brodal, Gerth Stølting; Tsakalidis, Konstantinos.

    In: Lecture Notes in Computer Science, Vol. 6755 , 2011, p. 256-267.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  36. Published

    Faster Algorithms for Computing Longest Common Increasing Subsequences. / Kutz, Martin; Brodal, Gerth Stølting; Kaligosi, Kanela; Katriel, Irit.

    In: Journal of Discrete Algorithms, Vol. 9, No. 4, 2011, p. 314-325.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  37. Published

    Integer Representations towards Efficient Counting in the Bit Probe Model. / Brodal, Gerth Stølting; Greve, Mark; Pandey, Vineet; Satti, Srinivasa Rao.

    In: Lecture Notes in Computer Science, Vol. 6648, 2011, p. 206-217.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  38. Published

    Ordered and Unordered Top-K Range Reporting in Large Data Sets. / Afshani, Peyman; Brodal, Gerth Stølting; Zeh, Norbert.

    Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algoritms. SODA 2011. Society for Industrial and Applied Mathematics, 2011. p. 390-400.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  39. Published

    Path Minima Queries in Dynamic Weighted Trees. / Davoodi, Pooya; Brodal, Gerth Stølting; Satti, Srinivasa Rao.

    In: Lecture Notes in Computer Science, Vol. 6844 , 2011, p. 290-301.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  40. Published

    The Cost of Cache-Oblivious Searching. / Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf; Ge, Dongdong; He, Simai; Hu, Haodong; Iacono, John; López-Ortiz, Alejandro.

    In: Algorithmica, Vol. 61, No. 2, 2011, p. 463-505.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  41. Published

    Towards optimal range medians. / Brodal, Gerth Stølting; Gfeller, Beat; Jørgensen, Allan Grønlund; Sanders, Peter.

    In: Theoretical Computer Science, Vol. 412, No. 24, 2011, p. 2588-2601.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  42. 2010
  43. Published

    D2-tree : A new overlay with deterministic bounds. / Brodal, Gerth Stølting; Sioutas, Spyros; Tsichlas, Kostas; Zaroliagis, Christos.

    Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II. ed. / Otfried Cheong ; Kyung-Yong Chwa ; Kunsoo Park. Springer VS, 2010. p. 1-12.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  44. Published

    A Cache-Oblivious Implicit Dictionary with the Working Set Property. / Brodal, Gerth Stølting; Kejlberg-Rasmussen, Casper; Truelsen, Jakob.

    In: Lecture Notes in Computer Science, Vol. 6507, 2010, p. 37-48.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  45. Published

    Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff. / Brodal, Gerth Stølting; Demaine, Erik D.; Fineman, Jeremy T.; Iacono, John; Langerman, Stefan; Munro, J. Ian.

    In: Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 2010, p. 1448-1456.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  46. Published

    On Space Efficient Two Dimensional Range Minimum Data Structures. / Davoodi, Pooya; Brodal, Gerth Stølting; Rao, S. Srinivasa.

    In: Lecture Notes in Computer Science, Vol. 6347, Part 2 , 2010, p. 171-182.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  47. Published

    Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. / Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf; Jacob, Riko; Vicari, Elias.

    In: Theory of Computing Systems, Vol. 47, No. 4, 2010, p. 934-962.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  48. 2009
  49. Published

    Counting in the Presence of Memory Faults. / Jørgensen, Allan Grønlund; Brodal, Gerth Stølting; Mølhave, Thomas; Moruz, Gabriel.

    In: Lecture Notes in Computer Science, Vol. 5878, 2009, p. 842-851.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  50. Published

    Data Structures for Range Median Queries. / Jørgensen, Allan Grønlund; Brodal, Gerth Stølting.

    In: Lecture Notes in Computer Science, 2009, p. 842-851.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  51. Published

    Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time. / Brodal, Gerth Stølting; Kaporis, Alexis C.; Sioutas, Spyros; Tsakalidis, Konstantinos; Tsichlas, Kostas.

    In: Lecture Notes in Computer Science, Vol. 5878, 2009, p. 193-202.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  52. Published

    Fault Tolerant External Memory Algorithms. / Jørgensen, Allan Grønlund; Brodal, Gerth Stølting; Mølhave, Thomas.

    In: Lecture Notes in Computer Science, Vol. 5664, 2009, p. 411-422.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  53. Published

    Online Sorted Range Reporting. / Brodal, Gerth Stølting; Fagerberg, Rolf; Greve, Mark; López-Ortis, Alejandro.

    In: Lecture Notes in Computer Science, Vol. 5878, 2009, p. 173-182.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  54. 2008
  55. Published

    An O(n log n) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree. / Brodal, Gerth Stølting; Georgiadis, Loukas; Katriel, Irit.

    In: Operations Research Letters, Vol. 36, No. 1, 2008, p. 14 -18.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  56. Published

    Cache-Oblivious Sorting. / Brodal, Gerth Stølting.

    Encyclopedia of Algorithms. ed. / Ming-Yang Kao. Vol. 3 Springer, 2008. p. 126-129.

    Research output: Contribution to book/anthology/report/proceedingEncyclopedia entryResearch

  57. Published

    Computing the all-pairs quartet distance on a set of evolutionary trees. / Stissing, Martin; Mailund, Thomas; Pedersen, Christian Storm; Brodal, Gerth Stølting; Fagerberg, Rolf.

    In: Journal of Bioinformatics and Computational Biology, Vol. 6, No. 1, 2008, p. 37-50.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  58. Published

    External Memory Planar Point Location with Logarithmic Updates. / Arge, Lars; Brodal, Gerth Stølting; Satti, Srinivasa Rao.

    Proceedings of the twenty-fourth annual symposium on Computational geometry. ed. / Monique Teilaud. Association for Computing Machinery, 2008. p. 139-147.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  59. Published

    On the Adaptiveness of Quicksort. / Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel.

    In: Journal of Experimental Algorithmics, Vol. 12, 2008.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  60. Published

    Selecting Sums in Arrays. / Brodal, Gerth Stølting; Jørgensen, Allan Grønlund.

    In: Lecture Notes in Computer Science, Vol. 5369, 2008, p. 100-111.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  61. 2007
  62. Published

    A Linear Time Algorithm for the k Maximal Sums Problem. / Brodal, Gerth Stølting; Jørgensen, Allan Grønlund.

    Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007 Proceedings. ed. / Ludek Kucera; Antonin Kucera. Springer, 2007. p. 442-453.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  63. Published

    Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. / Stissing, Martin; Mailund, Thomas; Pedersen, Christian Nørgaard Storm; Brodal, Gerth Stølting; Fagerberg, Rolf.

    Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC). 2007. p. 91-100.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  64. Published

    Computing the Quartet Distance between Evolutionary Trees of Bounded Degree. / Stissing, Martin; Pedersen, Christian Nørgaard Storm; Mailund, Thomas; Brodal, Gerth Stølting.

    Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC). 2007. p. 101-110.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  65. Published

    Dynamic Matchings in Convex Bipartite Graphs. / Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt; Katriel, Irit.

    Proc. 32nd International Symposium on Mathematical Foundations of Computer Science. ed. / Ludek Kucera; Antonin Kucera. Springer, 2007. p. 406-417.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  66. Published

    Engineering a Cache-Oblivious Sorting Algorithm. / Brodal, Gerth Stølting; Fagerberg, Rolf; Vinther, Kristoffer.

    In: Journal of Experimental Algorithmics, Vol. 12, 2007.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  67. Published

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

    Algorithms – ESA 2007: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings. ed. / Lars Arge; Michael Hoffmann; Emo Welzl. Springer, 2007. p. 347-358.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  68. Published

    Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. / Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf; Jacob, Riko; Vicari, Elias.

    SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures. 2007. p. 61-70.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  69. Published

    The ComBack Method - Extending Hash Compaction with Backtracking. / Westergaard, Michael; Kristensen, Lars Michael; Brodal, Gerth Stølting; Arge, Lars.

    Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings. Springer, 2007. p. 455-464.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  70. 2006
  71. Published

    Cache-oblivious String Dictionaries. / Brodal, Gerth Stølting; Fagerberg, Rolf.

    SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm . Association for Computing Machinery, 2006. p. 581-590.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  72. Published

    Faster Algorithms for Computing Longest Common Increasing Subsequences. / Brodal, Gerth Stølting; Kaligosi, Kanela; Katriel, Irit; Kutz, Martin.

    Combinatorial Pattern Matching. ed. / Moshe Lewenstein; Gabriel Valiente. Springer, 2006. p. 330-341.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  73. Published

    Improved Dynamic Planar Point Location. / Brodal, Gerth Stølting; Arge, Lars; Georgiadis, Loukas.

    Proceedings of the 47th Annual Symposium on Foundations of Computer Science. IEEE, 2006. p. 305-314.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  74. Published

    Purely Functional Worst Case Constant Time Catenable Sorted Lists. / Brodal, Gerth Stølting; Makris, Christos; Tsichlas, Kostas.

    Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings. ed. / Yossi Azar; Thomas Erlebach. Springer, 2006. p. 172-183.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  75. Published

    Recrafting the Neighbor-Joining Method. / Mailund, ; Brodal, Gerth Stølting; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm; Phillips, Derek.

    In: B M C Bioinformatics, Vol. 7, No. 29, 2006.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  76. Published

    Skewed Binary Search Trees. / Brodal, Gerth Stølting; Moruz, Gabriel.

    Algorithms – ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings. ed. / Yossi Azar; Thomas Erlebach. Springer, 2006. p. 708-719.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  77. 2005
  78. Published

    Cache-Aware and Cache-Oblivious Adaptive Sorting. / Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel.

    Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings. ed. / Luis Caires; Guseppe F. Italiano; Luis Monteiro; Catuscia Palamidessi; Moti Yung. Springer, 2005. p. 576-588.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  79. Published

    Cache-Oblivious Data Structures. / Arge, Lars; Brodal, Gerth Stølting; Fagerberg, Rolf.

    Handbook of Data Structures and Applications. ed. / Dinesh Mehta; Sartaj Sahni. CRC Press, 2005.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  80. Published

    Cache-Oblivious Planar Orthogonal Range Searching and Counting. / Arge, Lars; Brodal, Gerth Stølting; Fagerberg, Rolf; Laustsen, Morten.

    Proceedings of the twenty-first annual symposium on Computational geometry. Association for Computing Machinery, 2005. p. 160-169.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  81. Published

    ESA 2005: 13th Annual European Symposium : . / Brodal, Gerth Stølting (Editor); Leonardi, Stefano (Editor).

    Springer LNCS 3669, 2005.

    Research output: Book/anthology/dissertation/reportAnthologyResearch

  82. Published

    Fast Allocation and Deallocation with an Improved Buddy System. / Brodal, Gerth Stølting; Demaine, Erik D.; Munro, J. Ian.

    In: Acta Informatica, Vol. 41, No. 4-5, 2005, p. 273-291.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  83. Published

    Faster Algorithms for Computing Longest Common Increasing Subsequences. / Brodal, Gerth Stølting; Kaligosi, Kanela; Katriel, Irit; Kutz, Martin.

    In: B R I C S Report Series, No. RS-05-37, 2005.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  84. Published

    Finger Search Trees. / Brodal, Gerth Stølting.

    Handbook of Data Structures and Applications. ed. / D. Mehta; S. Sahni. CRC Press, 2005.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  85. Published

    On the Adaptiveness of Quicksort. / Brodal, Gerth Stølting; Fagerberg, Rolf; Moruz, Gabriel.

    ALENEX05. Society for Industrial and Applied Mathematics, 2005. p. 130-140.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  86. Published

    Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. / Brodal, Gerth Stølting; Moruz, Gabriel.

    Algorithms and Data Structures: 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005. Proceedings. ed. / Frank Dehne; Alejandro Lopez-Ortiz; Jörg-Rüdiger Sack. Springer, 2005. p. 385-395.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  87. 2004
  88. Published

    Cache-Oblivious Algorithms and Data Structures. / Brodal, Gerth Stølting.

    Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings. ed. / Torben Hagerup; Jyrki Katajainen. Springer, 2004. p. 3-13.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  89. Published

    Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. / Brodal, G.S.; Fagerberg, R.; Meyer, U.; Zeh, N.

    Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings. ed. / Torben Hagerup; Jyrki Katajainen. Springer, 2004. p. 480-492.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  90. Published

    Engineering a Cache-Oblivious Sorting Algorithm. / Brodal, G.S.; Fagerberg, R.; Vinther, K.

    Proceedings of the Sixth Annual Workshop on Algorithm Engineering and Experiments, ALENEX '04. Society for Industrial and Applied Mathematics, 2004. p. 4-17.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  91. Published

    On External-Memory MST, SSP and Multi-Way Planar Graph Separation. / Arge, L.; Brodal, G.S.; Toma, L.

    In: Journal of Algorithms, Vol. 53, No. 2, 2004, p. 186-206.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  92. Published

    On the Adaptiveness of Quicksort. / Brodal, G.S.; Fagerberg, R.; Moruz, G.

    In: B R I C S Report Series, No. RS-04-27, 2004.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  93. 2003
  94. Published

    Computing Refined Buneman Trees in Cubic Time. / Brodal, G.S.; Fagerberg, R.; Östlin, A.; Pedersen, C.N.S.; Rao, S.S.

    Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings. ed. / Gary Benson; Roderic Page. Springer, 2003. p. 259-270.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  95. Published

    Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n). / Brodal, Gerth Sølfting; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm.

    In: Algorithmica, Vol. 38, No. 2, 2003, p. 377-395.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  96. Published

    Lower Bounds for External Memory Dictionaries. / Brodal, Gerth Stølting; Fagerberg, Rolf; Farach-Colton, Martin (Editor).

    Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2003. p. 546-554.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearch

  97. Published

    On the Limits of Cache-Obliviousness. / Brodal, Gerth Stølting; Fagerberg, Rolf; Goemans, Michel Xi (Editor).

    Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. Association for Computing Machinery, 2003. p. 307-315.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearch

  98. Published

    Optimal Finger Search Trees in the Pointer Machine. / Brodal, Gerth Stølting; Lagogiannis, George; Makris, Christos; Tsakalidis, Athanasios; Tsichlas, Kostas.

    In: Journal of Computer and System Sciences, Vol. 67, No. 2, 2003, p. 381-418.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  99. Published

    Speeding Up Neighbour-Joining Tree Construction. / Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, Thomas; Pedersen, Christian Nørgaard Storm; Phillips, Derek.

    Work package 5 ed. www.brics.dk : ALCOM-FT, 2003. 9 p.

    Research output: Book/anthology/dissertation/reportReportResearch

  100. Published

    Speeding Up Neighbour-Joining Tree Construction. / Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, T; Pedersen, Christian N. Storm; Phillips, Derek.

    2003.

    Research output: Working paperResearch

  101. Published

    The Cost of Cache-Oblivious Searching. / Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf; Ge, Dongdong; He, Simai; Hu, Haodong; Iacono, John; López-Ortiz, Alejandro.

    Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C.. Vol. Session 6 http://dblp.uni-trier.de : IEEE Computer Society Press, 2003. p. 271-282.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  102. Published

    Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries. / Brodal, Gert Stølting; Jacob, Rico.

    In: Electronic Notes in Theoretical Computer Science, Vol. 92, 2003, p. 3-15.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearch

  103. 2002
  104. Published

    Cache Oblivious Distribution Sweeping. / Brodal, G.S.; Fagerberg, R.

    Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings. ed. / Peter Widmayer; Stephan Eidenbenz; Francisco Triguero; Rafael Morales; Ricardo Conejo; Matthew Hennessy. Springer, 2002. p. 426-438.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  105. Published

    Cache-Oblivious Search Trees via Binary Trees of Small Height. / Brodal, G.S.; Fagerberg, R.; Jacob, R.

    Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms . Association for Computing Machinery, 2002. p. 39-48.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  106. Published

    Dynamic Planar Convex Hull. / Brodal, Gerth Stølfting; Jacob, Rico.

    Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science: . IEEE Press, 2002. p. 617-626.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  107. Published

    Funnel Heap - A Cache Oblivious Priority Queue. / Brodal, Gerth Stølting; Fagerberg, Rolf; Bose, Prosenjit (Editor); Morin, Pat (Editor).

    Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21–23, 2002 Proceedings. ed. / Prosenijt Bose; Pat Morin. Springer, 2002. p. 219-228.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearch

  108. Published

    Optimal Solutions for the Temporal Precedence Problem. / Brodal, Gerth Stølting; Makris, Christos; Sioutas, Spyros; Tsakalidis, Athanasios K.; Tsichlas, Kosta.

    In: Algorithmica, Vol. 33, No. 4, 2002, p. 494-510.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  109. Published

    Solving the String Statistics Problem in Time O(n log n). / Brodal, Gerth Stølting; Lyngsø, Rune B.; Östlin, Anna; Pedersen, Christian Nørgaard Storm.

    Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings. ed. / Peter Widmayer; Stephan Eidenbenz; Francisco Triguero; Rafael Morales; Ricardo Conejo; Matthew Hennessy. Springer, 2002. p. 728-739.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  110. Published

    Time and Space Efficient Multi-Method Dispatching. / Alstrup, S.; Brodal, G.S.; Gørtz, I.L.; Rauhe, T.

    Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. ed. / Martti Penttonen; Erik Meineche Schmidt. Springer, 2002. p. 20-29.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

  111. 2001
  112. Published

    Algorithm Engineering : Proceedings of 5th International Workshop on Algorithm Engineering (WAE 2001). / Brodal, Gerth Stølting (Editor); Frigioni, Daniele (Editor); Marchetti-Spaccamela, Alberto (Editor).

    2141 i Lecture Notes in Computer Science ed. Springer, 2001. 198 p.

    Research output: Book/anthology/dissertation/reportAnthologyResearch

  113. Published

    Cache Oblivious Search Trees via Binary Trees of Small Height. / Brodal, G.S.; Fagerberg, R.; Jacob, R.

    In: B R I C S Report Series, No. RS-01-36, 2001, p. 1-20.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  114. Published

    Comparator Networks for Binary Heap Construction. / Brodal, G.S.; Pinotti, M.C.

    In: Theoretical Computer Science, Vol. 250, No. 1-2, 2001, p. 235-245.

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  115. Published

    Computing the Quartet Distance Between Evolutionary Trees in Time O(n log² n). / Brodal, Gerth S.; Fagerberg, Rolf; Pedersen, Christian N.S.; Eades, P. (Editor); Takaoka, T. (Editor).

    Proceedings of Algorithms and Computation : 12th International Symposium, ISAAC 2001. Vol. 2223/2001 2223 of Lecture Notes in Computer Science. ed. Springer, 2001. p. 731-742.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  116. Published

    Optimal Static Range Reporting in One Dimension. / Alstrup, Stephen; Brodal, Gerth Stølting; Rauhe, Theis.

    Proceedings of the thirty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, 2001. p. 476-482.

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearch

  117. Published

    The Complexity of Constructing Evolutionary Trees Using Experiments. / Brodal, Gerth Stølting; Fagerberg, Rolf; Pedersen, Christian N.S.; Östlin, Anna.

    Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings. ed. / Fernando Orejas; Paul G. Spirakis; Jan van Leeuwen. Springer, 2001. p. 140-151.

    Research output: Contribution to book/anthology/report/proceedingBook chapterResearch

Previous 1 2 Next