Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Chierichetti:2014:CLF, author = "Flavio Chierichetti and Ravi Kumar and Mohammad Mahdian", title = "The complexity of {LSH} feasibility", journal = j-THEOR-COMP-SCI, volume = "530", number = "??", pages = "89--101", day = "17", month = apr, year = "2014", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed Mar 26 06:01:23 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib; http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397514001467", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Locality-Sensitive Hash (LSH)", }