Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{ezra_et_al:LIPIcs:2017:7185, author = {Esther Ezra and Micha Sharir}, title = {{A Nearly Quadratic Bound for the Decision Tree Complexity of kSUM}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {41:141:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770385}, ISSN = {18688969}, year = {2017}, volume = {77}, editor = {Boris Aronov and Matthew J. Katz}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7185}, URN = {urn:nbn:de:0030drops71853}, doi = {10.4230/LIPIcs.SoCG.2017.41}, annote = {Keywords: kSUM and kLDT, linear decision tree, hyperplane arrangements, pointlocation, vertical decompositions, Epsiloncuttings} }
Keywords:  kSUM and kLDT, linear decision tree, hyperplane arrangements, pointlocation, vertical decompositions, Epsiloncuttings  
Seminar:  33rd International Symposium on Computational Geometry (SoCG 2017)  
Issue Date:  2017  
Date of publication:  08.06.2017 