%0 Conference Paper %1 conf/compgeom/EzraS17 %A Ezra, Esther %A Sharir, Micha %B SoCG %D 2017 %E Aronov, Boris %E Katz, Matthew J. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 41:1-41:15 %T A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. %U http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#EzraS17 %V 77 %@ 978-3-95977-038-5

@inproceedings{conf/compgeom/EzraS17, added-at = {2021-06-16T00:00:00.000+0200}, author = {Ezra, Esther and Sharir, Micha}, biburl = {https://www.bibsonomy.org/bibtex/2c2801a44488267b933061a7d49526867/dblp}, booktitle = {SoCG}, crossref = {conf/compgeom/2017}, editor = {Aronov, Boris and Katz, Matthew J.}, ee = {https://doi.org/10.4230/LIPIcs.SoCG.2017.41}, interhash = {14204cbb1f2d5e2d2bfb3f95cfdcd998}, intrahash = {c2801a44488267b933061a7d49526867}, isbn = {978-3-95977-038-5}, keywords = {dblp}, pages = {41:1-41:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T14:33:25.000+0200}, title = {A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM.}, url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#EzraS17}, volume = 77, year = 2017 }