Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Mark Braverman and Young Kun Ko. Semi-Direct Sum Theorem and Nearest Neighbor under l_infty. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2018.6, author = {Braverman, Mark and Ko, Young Kun}, title = {{Semi-Direct Sum Theorem and Nearest Neighbor under l\underlineinfty}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.6}, URN = {urn:nbn:de:0030-drops-94101}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.6}, annote = {Keywords: Asymmetric Communication Lower Bound, Data Structure Lower Bound, Nearest Neighbor Search} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Mark Braverman and Young Kun Ko. Information Value of Two-Prover Games. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{braverman_et_al:LIPIcs.ITCS.2018.12, author = {Braverman, Mark and Ko, Young Kun}, title = {{Information Value of Two-Prover Games}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.12}, URN = {urn:nbn:de:0030-drops-83466}, doi = {10.4230/LIPIcs.ITCS.2018.12}, annote = {Keywords: Two Prover Game, Parallel Repetition, Odd-Cycle Game, Amortized Value of the Game} }
Feedback for Dagstuhl Publishing