Abhishek Bhowmick, Zeev Dvir, Shachar Lovett. New bounds for matching vector families. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 823-832, ACM, 2013. [doi]
@inproceedings{BhowmickDL13,
title = {New bounds for matching vector families},
author = {Abhishek Bhowmick and Zeev Dvir and Shachar Lovett},
year = {2013},
doi = {10.1145/2488608.2488713},
url = {http://doi.acm.org/10.1145/2488608.2488713},
researchr = {https://researchr.org/publication/BhowmickDL13},
cites = {0},
citedby = {0},
pages = {823-832},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
publisher = {ACM},
isbn = {978-1-4503-2029-0},
}