Gerth Stølting Brodal

  1. 2017
  2. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  3. Accepteret/In press
  4. 2016
  5. Udgivet

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

    I: Theoretical Computer Science, Bind 638, 25.07.2016, s. 33-43.

    Publikation: Forskning - peer reviewTidsskriftartikel

  6. Udgivet

    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). red. / Nicolas Ollinger; Heribert Vollmer. Bind 47 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. s. 23:1-23:14.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  7. 2015
  8. Udgivet

    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. red. / Frank Dehne; Jörg-Rüdiger Sack ; Ulrike Stege . Springer-VS, 2015. s. 91-102.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  9. Udgivet

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

    I: Algorithmica, Bind 72, Nr. 3, 2015, s. 860-883.

    Publikation: Forskning - peer reviewTidsskriftartikel

  10. Udgivet

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

    I: Theory of Computing Systems, Bind 56 , Nr. 1, 2015.

    Publikation: Forskning - peer reviewTidsskriftartikel

  11. 2014
  12. Udgivet

    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.

    I: Theoretical Computer Science, Bind 526, Nr. March, 20.03.2014, s. 58-74.

    Publikation: Forskning - peer reviewTidsskriftartikel

  13. Udgivet

    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. red. / R. Ravi; Inge Li Gørtz. Springer-VS, 2014. s. 26-37.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  14. Udgivet

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

    I: Journal of Discrete Algorithms, Bind 26, Nr. May, 2014, s. 34–44.

    Publikation: Forskning - peer reviewTidsskriftartikel

  15. Udgivet

    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) . red. / Catherine C. McGeoch; Ulrich Meyer. Society for Industriel & Applied Mathematics, 2014. s. 9-19.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  16. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  17. Udgivet

    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.

    I: Bioinformatics, Bind 30, Nr. 4, 2014, s. 2079-2080.

    Publikation: Forskning - peer reviewTidsskriftartikel

  18. 2013
  19. Udgivet

    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. red. / Hans L. Bodlaender; Giuseppe F. Italiano . Springer-VS, 2013. s. 229-240.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  20. Udgivet

    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. red. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman ; Alfredo Viola. Springer-VS, 2013. s. 150-163 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  21. Udgivet

    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.

    I: B M C Bioinformatics, Bind 14, Nr. Suppl 2, 2013, s. S18.

    Publikation: Forskning - peer reviewKonferenceartikel

  22. Udgivet

    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.

    I: Biology, Bind 2, Nr. 4, 2013, s. 1189-1209.

    Publikation: Forskning - peer reviewTidsskriftartikel

  23. Udgivet

    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. s. 61-72.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  24. Udgivet

    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.

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

    Publikation: Forskning - peer reviewKonferenceartikel

  25. 2012
  26. Udgivet

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

    I: Leibniz International Proceedings in Informatics, Bind 14, 2012, s. 112--123.

    Publikation: Forskning - peer reviewKonferenceartikel

  27. Udgivet

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

    I: Algorithmica, Bind 63, Nr. 1-2, 2012, s. 457-475.

    Publikation: Forskning - peer reviewTidsskriftartikel

  28. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 7676, 2012, s. 527-536 .

    Publikation: Forskning - peer reviewKonferenceartikel

  29. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferenceartikel

  30. Udgivet

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

    I: Algorithmica, Bind 63, Nr. 4, 2012, s. 815-830.

    Publikation: Forskning - peer reviewTidsskriftartikel

  31. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 7164, 2012, s. 164-175 .

    Publikation: Forskning - peer reviewKonferenceartikel

  32. Udgivet

    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. s. 1177-1184 .

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  33. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 7501, 2012, s. 217-228 .

    Publikation: Forskning - peer reviewKonferenceartikel

  34. 2011
  35. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6755 , 2011, s. 256-267.

    Publikation: Forskning - peer reviewKonferenceartikel

  36. Udgivet

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

    I: Journal of Discrete Algorithms, Bind 9, Nr. 4, 2011, s. 314-325.

    Publikation: Forskning - peer reviewTidsskriftartikel

  37. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6648, 2011, s. 206-217.

    Publikation: Forskning - peer reviewKonferenceartikel

  38. Udgivet

    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 Industriel & Applied Mathematics, 2011. s. 390-400.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  39. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6844 , 2011, s. 290-301.

    Publikation: Forskning - peer reviewKonferenceartikel

  40. Udgivet

    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.

    I: Algorithmica, Bind 61, Nr. 2, 2011, s. 463-505.

    Publikation: Forskning - peer reviewTidsskriftartikel

  41. Udgivet

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

    I: Theoretical Computer Science, Bind 412, Nr. 24, 2011, s. 2588-2601.

    Publikation: Forskning - peer reviewTidsskriftartikel

  42. 2010
  43. Udgivet

    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. red. / Otfried Cheong ; Kyung-Yong Chwa ; Kunsoo Park. Springer-VS, 2010. s. 1-12.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  44. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6507, 2010, s. 37-48.

    Publikation: Forskning - peer reviewKonferenceartikel

  45. Udgivet

    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.

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

    Publikation: Forskning - peer reviewKonferenceartikel

  46. Udgivet

    D2-Tree: A New Overlay with Deterministic Bounds. / Brodal, Gerth Stølting; Sioutas, Spyros; Tsichlas, Kostas; Zaroliagis, Christos D.

    I: Lecture Notes in Computer Science, Bind 6507, 2010, s. 1-12.

    Publikation: Forskning - peer reviewKonferenceartikel

  47. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 6347, Part 2 , 2010, s. 171-182.

    Publikation: Forskning - peer reviewKonferenceartikel

  48. Udgivet

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

    I: Theory of Computing Systems, Bind 47, Nr. 4, 2010, s. 934-962.

    Publikation: Forskning - peer reviewTidsskriftartikel

  49. 2009
  50. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 5878, 2009, s. 842-851.

    Publikation: Forskning - peer reviewKonferenceartikel

  51. Udgivet

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

    I: Lecture Notes in Computer Science, 2009, s. 842-851.

    Publikation: Forskning - peer reviewKonferenceartikel

  52. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 5878, 2009, s. 193-202.

    Publikation: Forskning - peer reviewKonferenceartikel

  53. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 5664, 2009, s. 411-422.

    Publikation: Forskning - peer reviewKonferenceartikel

  54. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 5878, 2009, s. 173-182.

    Publikation: Forskning - peer reviewKonferenceartikel

  55. 2008
  56. Udgivet

    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.

    I: Operations Research Letters, Bind 36, Nr. 1, 2008, s. 14 -18.

    Publikation: Forskning - peer reviewTidsskriftartikel

  57. Udgivet

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

    Encyclopedia of Algorithms. red. / Ming-Yang Kao. Bind 3 Springer, 2008. s. 126-129.

    Publikation: ForskningEncyclopædiartikel

  58. Udgivet

    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.

    I: Journal of Bioinformatics and Computational Biology, Bind 6, Nr. 1, 2008, s. 37-50.

    Publikation: Forskning - peer reviewTidsskriftartikel

  59. Udgivet

    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. red. / Monique Teilaud. Association for Computing Machinery, 2008. s. 139-147.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  60. Udgivet

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

    I: Journal of Experimental Algorithmics, Bind 12, 2008.

    Publikation: Forskning - peer reviewTidsskriftartikel

  61. Udgivet

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

    I: Lecture Notes in Computer Science, Bind 5369, 2008, s. 100-111.

    Publikation: Forskning - peer reviewKonferenceartikel

  62. 2007
  63. Udgivet

    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. red. / Ludek Kucera; Antonin Kucera. Springer, 2007. s. 442-453.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  64. Udgivet

    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. s. 91-100.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  65. Udgivet

    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. s. 101-110.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  66. Udgivet

    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. red. / Ludek Kucera; Antonin Kucera. Springer, 2007. s. 406-417.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  67. Udgivet

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

    I: Journal of Experimental Algorithmics, Bind 12, 2007.

    Publikation: Forskning - peer reviewTidsskriftartikel

  68. Udgivet

    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. red. / Lars Arge; Michael Hoffmann; Emo Welzl. Springer, 2007. s. 347-358.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  69. Udgivet

    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. s. 61-70.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  70. Udgivet

    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. s. 455-464.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  71. 2006
  72. Udgivet

    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. s. 581-590.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  73. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  74. Udgivet

    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. s. 305-314.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  75. Udgivet

    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. red. / Yossi Azar; Thomas Erlebach. Springer, 2006. s. 172-183.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  76. Udgivet

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

    I: B M C Bioinformatics, Bind 7, Nr. 29, 2006.

    Publikation: Forskning - peer reviewTidsskriftartikel

  77. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  78. 2005
  79. Udgivet

    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. red. / Luis Caires; Guseppe F. Italiano; Luis Monteiro; Catuscia Palamidessi; Moti Yung. Springer, 2005. s. 576-588.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  80. Udgivet

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

    Handbook of Data Structures and Applications. red. / Dinesh Mehta; Sartaj Sahni. C R C Press LLC, 2005.

    Publikation: ForskningBidrag til bog/antologi

  81. Udgivet

    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. s. 160-169.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  82. Udgivet

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

    Springer LNCS 3669, 2005.

    Publikation: ForskningAntologi

  83. Udgivet

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

    I: Acta Informatica, Bind 41, Nr. 4-5, 2005, s. 273-291.

    Publikation: ForskningTidsskriftartikel

  84. Udgivet

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

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

    Publikation: ForskningTidsskriftartikel

  85. Udgivet

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

    Handbook of Data Structures and Applications. red. / D. Mehta; S. Sahni. C R C Press LLC, 2005.

    Publikation: ForskningBidrag til bog/antologi

  86. Udgivet

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

    ALENEX05. Society for Industriel & Applied Mathematics, 2005. s. 130-140.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  87. Udgivet

    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. red. / Frank Dehne; Alejandro Lopez-Ortiz; Jörg-Rüdiger Sack. Springer, 2005. s. 385-395.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  88. 2004
  89. Udgivet

    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. red. / Torben Hagerup; Jyrki Katajainen. Springer, 2004. s. 3-13.

    Publikation: ForskningBidrag til bog/antologi

  90. Udgivet

    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. red. / Torben Hagerup; Jyrki Katajainen. Springer, 2004. s. 480-492.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  91. Udgivet

    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 Industriel & Applied Mathematics, 2004. s. 4-17.

    Publikation: ForskningBidrag til bog/antologi

  92. Udgivet

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

    I: Journal of Algorithms, Bind 53, Nr. 2, 2004, s. 186-206.

    Publikation: Forskning - peer reviewTidsskriftartikel

  93. Udgivet

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

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

    Publikation: ForskningTidsskriftartikel

  94. 2003
  95. Udgivet

    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. red. / Gary Benson; Roderic Page. Springer, 2003. s. 259-270.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  96. Udgivet

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

    I: Algorithmica, Bind 38, Nr. 2, 2003, s. 377-395.

    Publikation: Forskning - peer reviewTidsskriftartikel

  97. Udgivet

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

    Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industriel & Applied Mathematics, 2003. s. 546-554.

    Publikation: ForskningKonferencebidrag i proceedings

  98. Udgivet

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

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

    Publikation: ForskningKonferencebidrag i proceedings

  99. Udgivet

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

    I: Journal of Computer and System Sciences, Bind 67, Nr. 2, 2003, s. 381-418.

    Publikation: ForskningTidsskriftartikel

  100. Udgivet

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

    Work package 5 udg. www.brics.dk : ALCOM-FT, 2003. 9 s.

    Publikation: ForskningRapport

  101. Udgivet

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

    2003.

    Publikation: ForskningWorking paper

  102. Udgivet

    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.. Bind Session 6 http://dblp.uni-trier.de : IEEE Computer Society Press, 2003. s. 271-282.

    Publikation: ForskningBidrag til bog/antologi

  103. Udgivet

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

    I: Electronic Notes in Theoretical Computer Science, Bind 92, 2003, s. 3-15.

    Publikation: ForskningKonferenceartikel

  104. 2002
  105. Udgivet

    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. red. / Peter Widmayer; Stephan Eidenbenz; Francisco Triguero; Rafael Morales; Ricardo Conejo; Matthew Hennessy. Springer, 2002. s. 426-438.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  106. Udgivet

    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. s. 39-48.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  107. Udgivet

    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. s. 617-626.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  108. Udgivet

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

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

    Publikation: ForskningKonferencebidrag i proceedings

  109. Udgivet

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

    I: Algorithmica, Bind 33, Nr. 4, 2002, s. 494-510.

    Publikation: ForskningTidsskriftartikel

  110. Udgivet

    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. red. / Peter Widmayer; Stephan Eidenbenz; Francisco Triguero; Rafael Morales; Ricardo Conejo; Matthew Hennessy. Springer, 2002. s. 728-739.

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  111. Udgivet

    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. red. / Martti Penttonen; Erik Meineche Schmidt. Springer, 2002. s. 20-29.

    Publikation: ForskningBidrag til bog/antologi

  112. 2001
  113. Udgivet

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

    2141 i Lecture Notes in Computer Science udg. Springer, 2001. 198 s.

    Publikation: ForskningAntologi

  114. Udgivet

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

    I: B R I C S Report Series, Nr. RS-01-36, 2001, s. 1-20.

    Publikation: ForskningTidsskriftartikel

  115. Udgivet

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

    I: Theoretical Computer Science, Bind 250, Nr. 1-2, 2001, s. 235-245.

    Publikation: Forskning - peer reviewTidsskriftartikel

  116. Udgivet

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

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

    Publikation: Forskning - peer reviewKonferencebidrag i proceedings

  117. Udgivet

    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. s. 476-482.

    Publikation: ForskningKonferencebidrag i proceedings

Forrige 1 2 Næste