Published in: LIPIcs, Volume 304, 5th Conference on Information-Theoretic Cryptography (ITC 2024)
Yuval Ishai, Mahimna Kelkar, Daniel Lee, and Yiping Ma. Information-Theoretic Single-Server PIR in the Shuffle Model. In 5th Conference on Information-Theoretic Cryptography (ITC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 304, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ishai_et_al:LIPIcs.ITC.2024.6, author = {Ishai, Yuval and Kelkar, Mahimna and Lee, Daniel and Ma, Yiping}, title = {{Information-Theoretic Single-Server PIR in the Shuffle Model}}, booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-333-1}, ISSN = {1868-8969}, year = {2024}, volume = {304}, editor = {Aggarwal, Divesh}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.6}, URN = {urn:nbn:de:0030-drops-205142}, doi = {10.4230/LIPIcs.ITC.2024.6}, annote = {Keywords: Private information retrieval, Shuffle model} }
Published in: LIPIcs, Volume 300, 39th Computational Complexity Conference (CCC 2024)
Gil Cohen and Tal Yankovitz. Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{cohen_et_al:LIPIcs.CCC.2024.8, author = {Cohen, Gil and Yankovitz, Tal}, title = {{Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries}}, booktitle = {39th Computational Complexity Conference (CCC 2024)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-331-7}, ISSN = {1868-8969}, year = {2024}, volume = {300}, editor = {Santhanam, Rahul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.8}, URN = {urn:nbn:de:0030-drops-204045}, doi = {10.4230/LIPIcs.CCC.2024.8}, annote = {Keywords: Relaxed locally decodable codes, Relxaed locally correctable codes, RLCC, RLDC} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Arnab Bhattacharyya, L. Sunil Chandran, and Suprovat Ghoshal. Combinatorial Lower Bounds for 3-Query LDCs. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 85:1-85:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhattacharyya_et_al:LIPIcs.ITCS.2020.85, author = {Bhattacharyya, Arnab and Chandran, L. Sunil and Ghoshal, Suprovat}, title = {{Combinatorial Lower Bounds for 3-Query LDCs}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {85:1--85:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.85}, URN = {urn:nbn:de:0030-drops-117704}, doi = {10.4230/LIPIcs.ITCS.2020.85}, annote = {Keywords: Coding theory, Graph theory, Hypergraphs} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, and Avi Wigderson. Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dvir_et_al:LIPIcs.ITCS.2019.32, author = {Dvir, Zeev and Gopi, Sivakanth and Gu, Yuzhou and Wigderson, Avi}, title = {{Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {32:1--32:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.32}, URN = {urn:nbn:de:0030-drops-101258}, doi = {10.4230/LIPIcs.ITCS.2019.32}, annote = {Keywords: Locally correctable codes, spanoids, entropy, bootstrap percolation, gossip spreading, matroid, union-closed family} }
Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Jop Briët, Zeev Dvir, and Sivakanth Gopi. Outlaw Distributions and Locally Decodable Codes. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{briet_et_al:LIPIcs.ITCS.2017.20, author = {Bri\"{e}t, Jop and Dvir, Zeev and Gopi, Sivakanth}, title = {{Outlaw Distributions and Locally Decodable Codes}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.20}, URN = {urn:nbn:de:0030-drops-81888}, doi = {10.4230/LIPIcs.ITCS.2017.20}, annote = {Keywords: Locally Decodable Code, VC-dimension, Incidence Geometry, Cayley Hypergraphs} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Arnab Bhattacharyya, Sivakanth Gopi, and Avishay Tal. Lower Bounds for 2-Query LCCs over Large Alphabet. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 30:1-30:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bhattacharyya_et_al:LIPIcs.APPROX-RANDOM.2017.30, author = {Bhattacharyya, Arnab and Gopi, Sivakanth and Tal, Avishay}, title = {{Lower Bounds for 2-Query LCCs over Large Alphabet}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {30:1--30:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.30}, URN = {urn:nbn:de:0030-drops-75792}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.30}, annote = {Keywords: Locally correctable code, Private information retrieval, Szemer\'{e}di regularity lemma} }
Published in: LIPIcs, Volume 50, 31st Conference on Computational Complexity (CCC 2016)
Arnab Bhattacharyya and Sivakanth Gopi. Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bhattacharyya_et_al:LIPIcs.CCC.2016.12, author = {Bhattacharyya, Arnab and Gopi, Sivakanth}, title = {{Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs}}, booktitle = {31st Conference on Computational Complexity (CCC 2016)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-008-8}, ISSN = {1868-8969}, year = {2016}, volume = {50}, editor = {Raz, Ran}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.12}, URN = {urn:nbn:de:0030-drops-58400}, doi = {10.4230/LIPIcs.CCC.2016.12}, annote = {Keywords: Locally correctable code, Locally testable code, Affine Invariance, Gowers uniformity norm} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Zeev Dvir and Sivakanth Gopi. On the Number of Rich Lines in Truly High Dimensional Sets. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 584-598, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dvir_et_al:LIPIcs.SOCG.2015.584, author = {Dvir, Zeev and Gopi, Sivakanth}, title = {{On the Number of Rich Lines in Truly High Dimensional Sets}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {584--598}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.584}, URN = {urn:nbn:de:0030-drops-51110}, doi = {10.4230/LIPIcs.SOCG.2015.584}, annote = {Keywords: Incidences, Combinatorial Geometry, Designs, Polynomial Method, Additive Combinatorics} }
Feedback for Dagstuhl Publishing