Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/innovations/innovations2019.bht:"
download as .bib file
@inproceedings{DBLP:conf/innovations/0001PSSV19,
author = {Ravi Kumar and
Manish Purohit and
Aaron Schild and
Zoya Svitkina and
Erik Vee},
editor = {Avrim Blum},
title = {Semi-Online Bipartite Matching},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {50:1--50:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.50},
doi = {10.4230/LIPICS.ITCS.2019.50},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001PSSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001R19,
author = {Oded Goldreich and
Dana Ron},
editor = {Avrim Blum},
title = {The Subgraph Testing Model},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {37:1--37:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.37},
doi = {10.4230/LIPICS.ITCS.2019.37},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001R19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001SS19,
author = {Shipra Agrawal and
Mohammad Shadravan and
Cliff Stein},
editor = {Avrim Blum},
title = {Submodular Secretary Problem with Shortlists},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {1:1--1:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.1},
doi = {10.4230/LIPICS.ITCS.2019.1},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001SS19a,
author = {Jingcheng Liu and
Alistair Sinclair and
Piyush Srivastava},
editor = {Avrim Blum},
title = {Fisher Zeros and Correlation Decay in the Ising Model},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {55:1--55:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.55},
doi = {10.4230/LIPICS.ITCS.2019.55},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001SS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0013TZ19,
author = {Wei Chen and
Shang{-}Hua Teng and
Hanrui Zhang},
editor = {Avrim Blum},
title = {Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {24:1--24:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.24},
doi = {10.4230/LIPICS.ITCS.2019.24},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0013TZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AharonovZ19,
author = {Dorit Aharonov and
Leo Zhou},
editor = {Avrim Blum},
title = {Hamiltonian Sparsification and Gap-Simulation},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {2:1--2:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.2},
doi = {10.4230/LIPICS.ITCS.2019.2},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/AharonovZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AndoniKP19,
author = {Alexandr Andoni and
Robert Krauthgamer and
Yosef Pogrow},
editor = {Avrim Blum},
title = {On Solving Linear Systems in Sublinear Time},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {3:1--3:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.3},
doi = {10.4230/LIPICS.ITCS.2019.3},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/AndoniKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ApplebaumV19,
author = {Benny Applebaum and
Prashant Nalini Vasudevan},
editor = {Avrim Blum},
title = {Placing Conditional Disclosure of Secrets in the Communication Complexity
Universe},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.4},
doi = {10.4230/LIPICS.ITCS.2019.4},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ApplebaumV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ArnostiW19,
author = {Nick Arnosti and
S. Matthew Weinberg},
editor = {Avrim Blum},
title = {Bitcoin: {A} Natural Oligopoly},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {5:1--5:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.5},
doi = {10.4230/LIPICS.ITCS.2019.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ArnostiW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiKK19,
author = {Sepehr Assadi and
Michael Kapralov and
Sanjeev Khanna},
editor = {Avrim Blum},
title = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
via Edge Sampling},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.6},
doi = {10.4230/LIPICS.ITCS.2019.6},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/AssadiKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AustrinKK19,
author = {Per Austrin and
Petteri Kaski and
Kaie Kubjas},
editor = {Avrim Blum},
title = {Tensor Network Complexity of Multilinear Maps},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {7:1--7:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.7},
doi = {10.4230/LIPICS.ITCS.2019.7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/AustrinKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BajpaiKKL019,
author = {Swapnam Bajpai and
Vaibhav Krishan and
Deepanshu Kush and
Nutan Limaye and
Srikanth Srinivasan},
editor = {Avrim Blum},
title = {A {\#}SAT Algorithm for Small Constant-Depth Circuits with {PTF} Gates},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.8},
doi = {10.4230/LIPICS.ITCS.2019.8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BajpaiKKL019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BarakKS19,
author = {Boaz Barak and
Pravesh K. Kothari and
David Steurer},
editor = {Avrim Blum},
title = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {9:1--9:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.9},
doi = {10.4230/LIPICS.ITCS.2019.9},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BarakKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Ben-Eliezer19,
author = {Omri Ben{-}Eliezer},
editor = {Avrim Blum},
title = {Testing Local Properties of Arrays},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.11},
doi = {10.4230/LIPICS.ITCS.2019.11},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Ben-Eliezer19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Ben-SassonS19,
author = {Eli Ben{-}Sasson and
Eden Saig},
editor = {Avrim Blum},
title = {The Complexity of User Retention},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {12:1--12:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.12},
doi = {10.4230/LIPICS.ITCS.2019.12},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Ben-SassonS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BhrushundiHLR19,
author = {Abhishek Bhrushundi and
Kaave Hosseini and
Shachar Lovett and
Sankeerth Rao},
editor = {Avrim Blum},
title = {Torus Polynomials: An Algebraic Approach to {ACC} Lower Bounds},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {13:1--13:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.13},
doi = {10.4230/LIPICS.ITCS.2019.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BhrushundiHLR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BiloCFIMPVZ19,
author = {Vittorio Bil{\`{o}} and
Ioannis Caragiannis and
Michele Flammini and
Ayumi Igarashi and
Gianpiero Monaco and
Dominik Peters and
Cosimo Vinci and
William S. Zwicker},
editor = {Avrim Blum},
title = {Almost Envy-Free Allocations with Connected Bundles},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {14:1--14:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.14},
doi = {10.4230/LIPICS.ITCS.2019.14},
timestamp = {Tue, 11 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BiloCFIMPVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlaserJ19,
author = {Markus Bl{\"{a}}ser and
Gorav Jindal},
editor = {Avrim Blum},
title = {On the Complexity of Symmetric Polynomials},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {47:1--47:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.47},
doi = {10.4230/LIPICS.ITCS.2019.47},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BlaserJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BoulandFNV19,
author = {Adam Bouland and
Bill Fefferman and
Chinmay Nirkhe and
Umesh V. Vazirani},
editor = {Avrim Blum},
title = {"Quantum Supremacy" and the Complexity of Random Circuit Sampling},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {15:1--15:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.15},
doi = {10.4230/LIPICS.ITCS.2019.15},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BoulandFNV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BoyleLV19,
author = {Elette Boyle and
Rio LaVigne and
Vinod Vaikuntanathan},
editor = {Avrim Blum},
title = {Adversarially Robust Property-Preserving Hash Functions},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {16:1--16:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.16},
doi = {10.4230/LIPICS.ITCS.2019.16},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BoyleLV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Chailloux19,
author = {Andr{\'{e}} Chailloux},
editor = {Avrim Blum},
title = {A Note on the Quantum Query Complexity of Permutation Symmetric Functions},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {19:1--19:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.19},
doi = {10.4230/LIPICS.ITCS.2019.19},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Chailloux19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChakrabartyS19,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Avrim Blum},
title = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {20:1--20:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.20},
doi = {10.4230/LIPICS.ITCS.2019.20},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChakrabartyS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChanHJ19,
author = {Timothy M. Chan and
Sariel Har{-}Peled and
Mitchell Jones},
editor = {Avrim Blum},
title = {On Locality-Sensitive Orderings and Their Applications},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {21:1--21:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.21},
doi = {10.4230/LIPICS.ITCS.2019.21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChanHJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChaseP19,
author = {Zachary Chase and
Siddharth Prasad},
editor = {Avrim Blum},
title = {Learning Time Dependent Choice},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {62:1--62:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.62},
doi = {10.4230/LIPICS.ITCS.2019.62},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChaseP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChattopadhyayHL19,
author = {Eshan Chattopadhyay and
Pooya Hatami and
Shachar Lovett and
Avishay Tal},
editor = {Avrim Blum},
title = {Pseudorandom Generators from the Second Fourier Level and Applications
to {AC0} with Parity Gates},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.22},
doi = {10.4230/LIPICS.ITCS.2019.22},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChattopadhyayHL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChenW19,
author = {Lijie Chen and
Ruosong Wang},
editor = {Avrim Blum},
title = {Classical Algorithms from Quantum and Arthur-Merlin Communication
Protocols},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {23:1--23:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.23},
doi = {10.4230/LIPICS.ITCS.2019.23},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChenW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChiesaMS19,
author = {Alessandro Chiesa and
Peter Manohar and
Igor Shinkar},
editor = {Avrim Blum},
title = {Probabilistic Checking Against Non-Signaling Strategies from Linearity
Testing},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.25},
doi = {10.4230/LIPICS.ITCS.2019.25},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChiesaMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChouCL19,
author = {Chi{-}Ning Chou and
Kai{-}Min Chung and
Chi{-}Jen Lu},
editor = {Avrim Blum},
title = {On the Algorithmic Power of Spiking Neural Networks},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {26:1--26:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.26},
doi = {10.4230/LIPICS.ITCS.2019.26},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChouCL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DaskalakisP19,
author = {Constantinos Daskalakis and
Ioannis Panageas},
editor = {Avrim Blum},
title = {Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {27:1--27:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.27},
doi = {10.4230/LIPICS.ITCS.2019.27},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DaskalakisP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DeLS19,
author = {Anindya De and
Philip M. Long and
Rocco A. Servedio},
editor = {Avrim Blum},
title = {Density Estimation for Shift-Invariant Multidimensional Distributions},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {28:1--28:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.28},
doi = {10.4230/LIPICS.ITCS.2019.28},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DeLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Dinur0G19,
author = {Irit Dinur and
Oded Goldreich and
Tom Gur},
editor = {Avrim Blum},
title = {Every Set in {P} Is Strongly Testable Under a Suitable Encoding},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {30:1--30:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.30},
doi = {10.4230/LIPICS.ITCS.2019.30},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Dinur0G19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DinurHKR19,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Noga Ron{-}Zewi},
editor = {Avrim Blum},
title = {From Local to Robust Testing via Agreement Testing},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {29:1--29:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.29},
doi = {10.4230/LIPICS.ITCS.2019.29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DinurHKR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Dughmi0Q19,
author = {Shaddin Dughmi and
David Kempe and
Ruixin Qiang},
editor = {Avrim Blum},
title = {Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {31:1--31:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.31},
doi = {10.4230/LIPICS.ITCS.2019.31},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Dughmi0Q19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DvirGGW19,
author = {Zeev Dvir and
Sivakanth Gopi and
Yuzhou Gu and
Avi Wigderson},
editor = {Avrim Blum},
title = {Spanoids - An Abstraction of Spanning Structures, and a Barrier for
LCCs},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {32:1--32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.32},
doi = {10.4230/LIPICS.ITCS.2019.32},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DvirGGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DworkI19,
author = {Cynthia Dwork and
Christina Ilvento},
editor = {Avrim Blum},
title = {Fairness Under Composition},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {33:1--33:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.33},
doi = {10.4230/LIPICS.ITCS.2019.33},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DworkI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FilmusOW19,
author = {Yuval Filmus and
Ryan O'Donnell and
Xinyu Wu},
editor = {Avrim Blum},
title = {A Log-Sobolev Inequality for the Multislice, with Applications},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {34:1--34:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.34},
doi = {10.4230/LIPICS.ITCS.2019.34},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/FilmusOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GalTN19,
author = {Anna G{\'{a}}l and
Avishay Tal and
Adrian Trejo Nu{\~{n}}ez},
editor = {Avrim Blum},
title = {Cubic Formula Size Lower Bounds Based on Compositions with Majority},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {35:1--35:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.35},
doi = {10.4230/LIPICS.ITCS.2019.35},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GalTN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GargS19,
author = {Sumegha Garg and
Jon Schneider},
editor = {Avrim Blum},
title = {The Space Complexity of Mirror Games},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {36:1--36:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.36},
doi = {10.4230/LIPICS.ITCS.2019.36},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GargS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoosKRS19,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Robert Robere and
Dmitry Sokolov},
editor = {Avrim Blum},
title = {Adventures in Monotone Complexity and {TFNP}},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {38:1--38:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.38},
doi = {10.4230/LIPICS.ITCS.2019.38},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GoosKRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiNS19,
author = {Venkatesan Guruswami and
Preetum Nakkiran and
Madhu Sudan},
editor = {Avrim Blum},
title = {Algorithmic Polarization for Hidden Markov Models},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {39:1--39:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.39},
doi = {10.4230/LIPICS.ITCS.2019.39},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HaitnerMORY19,
author = {Iftach Haitner and
Noam Mazor and
Rotem Oshman and
Omer Reingold and
Amir Yehudayoff},
editor = {Avrim Blum},
title = {On the Communication Complexity of Key-Agreement Protocols},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {40:1--40:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.40},
doi = {10.4230/LIPICS.ITCS.2019.40},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HaitnerMORY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HamiltonM19,
author = {Linus Hamilton and
Ankur Moitra},
editor = {Avrim Blum},
title = {The Paulsen Problem Made Simple},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {41:1--41:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.41},
doi = {10.4230/LIPICS.ITCS.2019.41},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HamiltonM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HorelPRV19,
author = {Thibaut Horel and
Sunoo Park and
Silas Richelson and
Vinod Vaikuntanathan},
editor = {Avrim Blum},
title = {How to Subvert Backdoored Encryption: Security Against Adversaries
that Decrypt All Ciphertexts},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {42:1--42:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.42},
doi = {10.4230/LIPICS.ITCS.2019.42},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HorelPRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JansenKMR19,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Marten Maack and
Malin Rau},
editor = {Avrim Blum},
title = {Empowering the Configuration-IP - New {PTAS} Results for Scheduling
with Setups Times},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {44:1--44:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.44},
doi = {10.4230/LIPICS.ITCS.2019.44},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/JansenKMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JansenR19,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Avrim Blum},
title = {On Integer Programming and Convolution},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.43},
doi = {10.4230/LIPICS.ITCS.2019.43},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Jin19,
author = {Ce Jin},
editor = {Avrim Blum},
title = {Simulating Random Walks on Graphs in the Streaming Model},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {46:1--46:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.46},
doi = {10.4230/LIPICS.ITCS.2019.46},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Jin19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JinMR19,
author = {Yan Jin and
Elchanan Mossel and
Govind Ramnarayan},
editor = {Avrim Blum},
title = {Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.45},
doi = {10.4230/LIPICS.ITCS.2019.45},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/JinMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KaneW19,
author = {Daniel M. Kane and
Richard Ryan Williams},
editor = {Avrim Blum},
title = {The Orthogonal Vectors Conjecture for Branching Programs and Formulas},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {48:1--48:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.48},
doi = {10.4230/LIPICS.ITCS.2019.48},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/KaneW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KothariOS19,
author = {Pravesh K. Kothari and
Ryan O'Donnell and
Tselil Schramm},
editor = {Avrim Blum},
title = {{SOS} Lower Bounds with Hard Constraints: Think Global, Act Local},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {49:1--49:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.49},
doi = {10.4230/LIPICS.ITCS.2019.49},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/KothariOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LeeRS19,
author = {Troy Lee and
Maharshi Ray and
Miklos Santha},
editor = {Avrim Blum},
title = {Strategies for Quantum Races},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {51:1--51:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.51},
doi = {10.4230/LIPICS.ITCS.2019.51},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LeeRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LeviW19,
author = {Amit Levi and
Erik Waingarten},
editor = {Avrim Blum},
title = {Lower Bounds for Tolerant Junta and Unateness Testing via Rejection
Sampling of Graphs},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {52:1--52:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.52},
doi = {10.4230/LIPICS.ITCS.2019.52},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LeviW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LinCGSW19,
author = {Fuchun Lin and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Reihaneh Safavi{-}Naini and
Huaxiong Wang},
editor = {Avrim Blum},
title = {Secret Sharing with Binary Shares},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {53:1--53:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.53},
doi = {10.4230/LIPICS.ITCS.2019.53},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LinCGSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LinialPS19,
author = {Nati Linial and
Toniann Pitassi and
Adi Shraibman},
editor = {Avrim Blum},
title = {On the Communication Complexity of High-Dimensional Permutations},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {54:1--54:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.54},
doi = {10.4230/LIPICS.ITCS.2019.54},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LinialPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/McKayW19,
author = {Dylan M. McKay and
Richard Ryan Williams},
editor = {Avrim Blum},
title = {Quadratic Time-Space Lower Bounds for Computing Natural Functions
with a Random Oracle},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {56:1--56:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.56},
doi = {10.4230/LIPICS.ITCS.2019.56},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/McKayW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/OliveiraST19,
author = {Igor Carboni Oliveira and
Rahul Santhanam and
Roei Tell},
editor = {Avrim Blum},
title = {Expander-Based Cryptography Meets Natural Proofs},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.18},
doi = {10.4230/LIPICS.ITCS.2019.18},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/OliveiraST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PapadimitriouV19,
author = {Christos H. Papadimitriou and
Santosh S. Vempala},
editor = {Avrim Blum},
title = {Random Projection in the Brain and Computation with Assemblies of
Neurons},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {57:1--57:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.57},
doi = {10.4230/LIPICS.ITCS.2019.57},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/PapadimitriouV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ParterRVY19,
author = {Merav Parter and
Ronitt Rubinfeld and
Ali Vakilian and
Anak Yodpinyanee},
editor = {Avrim Blum},
title = {Local Computation Algorithms for Spanners},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {58:1--58:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.58},
doi = {10.4230/LIPICS.ITCS.2019.58},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ParterRVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Pietrzak19,
author = {Krzysztof Pietrzak},
editor = {Avrim Blum},
title = {Proofs of Catalytic Space},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {59:1--59:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.59},
doi = {10.4230/LIPICS.ITCS.2019.59},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Pietrzak19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Pietrzak19a,
author = {Krzysztof Pietrzak},
editor = {Avrim Blum},
title = {Simple Verifiable Delay Functions},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {60:1--60:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.60},
doi = {10.4230/LIPICS.ITCS.2019.60},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Pietrzak19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Potechin19,
author = {Aaron Potechin},
editor = {Avrim Blum},
title = {Sum of Squares Lower Bounds from Symmetry and a Good Story},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {61:1--61:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.61},
doi = {10.4230/LIPICS.ITCS.2019.61},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Potechin19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/RaskhodnikovaRV19,
author = {Sofya Raskhodnikova and
Noga Ron{-}Zewi and
Nithin Varma},
editor = {Avrim Blum},
title = {Erasures vs. Errors in Local Decoding and Property Testing},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {63:1--63:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.63},
doi = {10.4230/LIPICS.ITCS.2019.63},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/RaskhodnikovaRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/RosenU19,
author = {Adi Ros{\'{e}}n and
Florent Urrutia},
editor = {Avrim Blum},
title = {A New Approach to Multi-Party Peer-to-Peer Communication Complexity},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {64:1--64:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.64},
doi = {10.4230/LIPICS.ITCS.2019.64},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/RosenU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SM19,
author = {{Karthik {C. S.}} and
Pasin Manurangsi},
editor = {Avrim Blum},
title = {On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {17:1--17:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.17},
doi = {10.4230/LIPICS.ITCS.2019.17},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/SM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Schild19,
author = {Aaron Schild},
editor = {Avrim Blum},
title = {A Schur Complement Cheeger Inequality},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {65:1--65:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.65},
doi = {10.4230/LIPICS.ITCS.2019.65},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Schild19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Thang19,
author = {Kim Thang Nguyen},
editor = {Avrim Blum},
title = {Game Efficiency Through Linear Programming Duality},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {66:1--66:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.66},
doi = {10.4230/LIPICS.ITCS.2019.66},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Thang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/WattsHKN19,
author = {Adam Bene Watts and
Aram W. Harrow and
Gurtej Kanwar and
Anand Natarajan},
editor = {Avrim Blum},
title = {Algorithms, Bounds, and Strategies for Entangled {XOR} Games},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {10:1--10:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.10},
doi = {10.4230/LIPICS.ITCS.2019.10},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/WattsHKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/X19,
editor = {Avrim Blum},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {0:i--0:xii},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.0},
doi = {10.4230/LIPICS.ITCS.2019.0},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/X19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2019,
editor = {Avrim Blum},
title = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-095-8},
isbn = {978-3-95977-095-8},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-10 05:13 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
