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


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