Meta data
- BibTeX key
- conf/innovations/BelovsS13
- entry type
- inproceedings
- booktitle
- ITCS
- year
- 2013
- pages
- 323-328
- publisher
- ACM
- crossref
- conf/innovations/2013
- ee
- https://doi.org/10.1145/2422436.2422474
- isbn
- 978-1-4503-1859-4
- url
- http://dblp.uni-trier.de/db/conf/innovations/innovations2013.html#BelovsS13
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/innovations/BelovsS13
%A Belovs, Aleksandrs
%A Spalek, Robert
%B ITCS
%D 2013
%E Kleinberg, Robert D.
%I ACM
%K dblp
%P 323-328
%T Adversary lower bound for the k-sum problem.
%U http://dblp.uni-trier.de/db/conf/innovations/innovations2013.html#BelovsS13
%@ 978-1-4503-1859-4
@inproceedings{conf/innovations/BelovsS13,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Belovs, Aleksandrs and Spalek, Robert},
biburl = {https://www.bibsonomy.org/bibtex/23c6d0e227bd6309e0e2c335ceae6f79b/dblp},
booktitle = {ITCS},
crossref = {conf/innovations/2013},
editor = {Kleinberg, Robert D.},
ee = {https://doi.org/10.1145/2422436.2422474},
interhash = {c841352938a07213e89cf4f23c77e484},
intrahash = {3c6d0e227bd6309e0e2c335ceae6f79b},
isbn = {978-1-4503-1859-4},
keywords = {dblp},
pages = {323-328},
publisher = {ACM},
timestamp = {2018-11-07T16:47:33.000+0100},
title = {Adversary lower bound for the k-sum problem.},
url = {http://dblp.uni-trier.de/db/conf/innovations/innovations2013.html#BelovsS13},
year = 2013
}