Gerth Stølting Brodal

According to our database1, Gerth Stølting Brodal
  • authored at least 124 papers between 1995 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.
CoRR, 2017

Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Cache-Oblivious Sorting.
Encyclopedia of Algorithms, 2016

Two dimensional range minimum queries and Fibonacci lattices.
Theor. Comput. Sci., 2016

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Theory Comput. Syst., 2015

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
CoRR, 2015

External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates.
CoRR, 2015

D2-Tree: A New Overlay with Deterministic Bounds.
Algorithmica, 2015

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
Dynamic 3-sided planar range queries with expected doubly-logarithmic time.
Theor. Comput. Sci., 2014

Integer representations towards efficient counting in the bit probe model.
J. Discrete Algorithms, 2014

tqDist: a library for computing the quartet and triplet distances between binary or general trees.
Bioinformatics, 2014

Optimal Planar Orthogonal Skyline Counting Queries.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).
Proceedings of the Algorithm Theory - SWAT 2014, 2014

On the Scalability of Computing Triplet and Quartet Distances.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
Optimal Planar Orthogonal Skyline Counting Queries
CoRR, 2013

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
BMC Bioinformatics, 2013

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
Proceedings of the Algorithms - ESA 2013, 2013

An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.
Proceedings of the Algorithms - ESA 2013, 2013

A Survey on Priority Queues.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
CoRR, 2012

On Space Efficient Two Dimensional Range Minimum Data Structures.
Algorithmica, 2012

External Memory Planar Point Location with Logarithmic Updates.
Algorithmica, 2012

Strict fibonacci heaps.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Fully persistent B-trees.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Finger Search in the Implicit Model.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Towards optimal range medians.
Theor. Comput. Sci., 2011

Faster algorithms for computing longest common increasing subsequences.
J. Discrete Algorithms, 2011

Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property
CoRR, 2011

The Cost of Cache-Oblivious Searching.
Algorithmica, 2011

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Path Minima Queries in Dynamic Weighted Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Integer Representations towards Efficient Counting in the Bit Probe Model.
Proceedings of the Theory and Applications of Models of Computation, 2011

Ordered and Unordered Top-K Range Reporting in Large Data Sets.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Dynamic Planar Range Maxima Queries.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst., 2010

D2-Tree: A New Overlay with Deterministic Bounds
CoRR, 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

D2-Tree: A New Overlay with Deterministic Bounds.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Cache-Oblivious Implicit Dictionary with the Working Set Property.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On Space Efficient Two Dimensional Range Minimum Data Structures.
Proceedings of the Algorithms, 2010

2009
Fault Tolerant External Memory Algorithms.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Counting in the Presence of Memory Faults.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Data Structures for Range Median Queries.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Online Sorted Range Reporting.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Cache-Oblivious Sorting.
Proceedings of the Encyclopedia of Algorithms, 2008

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett., 2008

On the adaptiveness of Quicksort.
ACM Journal of Experimental Algorithmics, 2008

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinformatics and Computational Biology, 2008

Selecting Sums in Arrays.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

External memory planar point location with logarithmic updates.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Engineering a cache-oblivious sorting algorithm.
ACM Journal of Experimental Algorithmics, 2007

Optimal sparse matrix dense vector multiplication in the I/O-model.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

A Linear Time Algorithm for the k Maximal Sums Problem.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Dynamic Matchings in Convex Bipartite Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007


The ComBack Method - Extending Hash Compaction with Backtracking.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Recrafting the neighbor-joining method.
BMC Bioinformatics, 2006

Cache-oblivious string dictionaries.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved Dynamic Planar Point Location.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Purely Functional Worst Case Constant Time Catenable Sorted Lists.
Proceedings of the Algorithms, 2006

Skewed Binary Search Trees.
Proceedings of the Algorithms, 2006

Faster Algorithms for Computing Longest Common Increasing Subsequences.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Fast allocation and deallocation with an improved buddy system.
Acta Inf., 2005

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Cache-Aware and Cache-Oblivious Adaptive Sorting.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-oblivious planar orthogonal range searching and counting.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

On the Adaptiveness of Quicksort.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Finger Search Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Cache-Oblivious Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

On external-memory MST, SSSP and multi-way planar graph separation.
J. Algorithms, 2004

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries.
Electr. Notes Theor. Comput. Sci., 2004

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica, 2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Proceedings of the Algorithm Theory, 2004

Cache-Oblivious Algorithms and Data Structures.
Proceedings of the Algorithm Theory, 2004

Engineering a Cache-Oblivious Sorting Algorith.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Optimal finger search trees in the pointer machine.
J. Comput. Syst. Sci., 2003

Computing Refined Buneman Trees in Cubic Time.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

On the limits of cache-obliviousness.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Lower bounds for external memory dictionaries.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

The Cost of Cache-Oblivious Searching.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Optimal Solutions for the Temporal Precedence Problem.
Algorithmica, 2002

Time and Space Efficient Multi-method Dispatching.
Proceedings of the Algorithm Theory, 2002

Optimal finger search trees in the pointer machine.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Cache oblivious search trees via binary trees of small height.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Funnel Heap - A Cache Oblivious Priority Queue.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Solving the String Statistics Problem in Time O(n log n).
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Cache Oblivious Distribution Sweeping.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Dynamic Planar Convex Hull.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Comparator networks for binary heap construction.
Theor. Comput. Sci., 2001

Optimal static range reporting in one dimension.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n).
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Improved bounds for dictionary look-up with one error.
Inf. Process. Lett., 2000

Dynamic Planar Convex Hull with Optimal Query Time.
Proceedings of the Algorithm Theory, 2000

On External-Memory MST, SSSP, and Multi-way Planar Graph Separation.
Proceedings of the Algorithm Theory, 2000

Pattern matching in dynamic texts.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

New Data Structures for Orthogonal Range Searching.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Finding Maximal Quasiperiodicities in Strings.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Priority queues on parallel machines.
Parallel Computing, 1999

Dynamic Representation of Sparse Graphs.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Finding Maximal Pairs with Bounded Gap.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
A Parallel Priority Queue with Constant Time Operations.
J. Parallel Distrib. Comput., 1998

Comparator Networks for Binary Heap Construction.
Proceedings of the Algorithm Theory, 1998

Worst-Case External-Memory Priority Queues.
Proceedings of the Algorithm Theory, 1998

Finger Search Trees with Constant Insertion Time.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Predecessor Queries in Dynamic Integer Sets.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Parallel Priority Data Structure with Applications.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996
The Randomized Complexity of Maintaining the Minimum.
Nord. J. Comput., 1996

Partially Persistent Data Structures of Bounded Degree with Constant Update Time.
Nord. J. Comput., 1996

Optimal Purely Functional Priority Queues.
J. Funct. Program., 1996

The Randomized Complexity of Maintaining the Minimum.
Proceedings of the Algorithm Theory, 1996

Priority Queues on Parallel Machines.
Proceedings of the Algorithm Theory, 1996

Worst-Case Efficient Priority Queues.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Approximate Dictionary Queries.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Fast Meldable Priority Queues.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995


  Loading...