@InProceedings{xue_et_al:LIPIcs.SoCG.2018.73,
author = {Xue, Jie and Li, Yuan and Rahul, Saladi and Janardan, Ravi},
title = {{New Bounds for Range Closest-Pair Problems}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {73:1--73:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-066-8},
ISSN = {1868-8969},
year = {2018},
volume = {99},
editor = {Speckmann, Bettina and T\'{o}th, Csaba D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.73},
URN = {urn:nbn:de:0030-drops-87865},
doi = {10.4230/LIPIcs.SoCG.2018.73},
annote = {Keywords: Closest-pair, Range search, Candidate pairs, Average-case analysis}
}