No. Title Author Year
1 An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility Cardinal, Jean et al. 2021
2 Scalable Data Structures (Dagstuhl Seminar 21071) Brodal, Gerth Stølting et al. 2021
3 Worst-Case Efficient Dynamic Geometric Independent Set Cardinal, Jean et al. 2021
4 External Memory Planar Point Location with Fast Updates Iacono, John et al. 2019
5 External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms Iacono, John et al. 2019
6 Dynamic Trees with Almost-Optimal Access Cost Golin, Mordecai et al. 2018
7 Subquadratic Encodings for Point Configurations Cardinal, Jean et al. 2018
8 Subquadratic Algorithms for Algebraic Generalizations of 3SUM Barba, Luis et al. 2017
9 Incremental Voronoi diagrams Allen, Sarah R. et al. 2016
10 Solving k-SUM Using Few Linear Queries Cardinal, Jean et al. 2016
11 Mergeable Dictionaries Iacono, John et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI