Go to the corresponding LIPIcs Volume Portal 
Aronov, Boris ; de Berg, Mark ; Cardinal, Jean ; Ezra, Esther ; Iacono, John ; Sharir, Micha
pdfformat: 

@InProceedings{aronov_et_al:LIPIcs.ISAAC.2021.3, author = {Aronov, Boris and de Berg, Mark and Cardinal, Jean and Ezra, Esther and Iacono, John and Sharir, Micha}, title = {{Subquadratic Algorithms for Some 3SumHard Geometric Problems in the Algebraic Decision Tree Model}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {3:13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772143}, ISSN = {18688969}, year = {2021}, volume = {212}, editor = {Ahn, HeeKap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15436}, URN = {urn:nbn:de:0030drops154363}, doi = {10.4230/LIPIcs.ISAAC.2021.3}, annote = {Keywords: Computational geometry, Algebraic decisiontree model, Polynomial partitioning, Primaldual range searching, Order types, Point location, Hierarchical partitions} }
Keywords:  Computational geometry, Algebraic decisiontree model, Polynomial partitioning, Primaldual range searching, Order types, Point location, Hierarchical partitions  
Collection:  32nd International Symposium on Algorithms and Computation (ISAAC 2021)  
Issue Date:  2021  
Date of publication:  30.11.2021 