Go to the corresponding LIPIcs Volume Portal 
Bhattacharyya, Arnab ; Gopi, Sivakanth ; Tal, Avishay
pdfformat: 

@InProceedings{bhattacharyya_et_al:LIPIcs:2017:7579, author = {Arnab Bhattacharyya and Sivakanth Gopi and Avishay Tal}, title = {{Lower Bounds for 2Query LCCs over Large Alphabet}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {30:130:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7579}, URN = {urn:nbn:de:0030drops75792}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.30}, annote = {Keywords: Locally correctable code, Private information retrieval, Szemer{\'e}di regularity lemma} }
Keywords:  Locally correctable code, Private information retrieval, Szemerédi regularity lemma  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 