Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/innovations/innovations2017.bht:"
@inproceedings{DBLP:conf/innovations/AaronsonGS17, author = {Scott Aaronson and Daniel Grier and Luke Schaeffer}, editor = {Christos H. Papadimitriou}, title = {The Classification of Reversible Bit Operations}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {23:1--23:34}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.23}, doi = {10.4230/LIPICS.ITCS.2017.23}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/AaronsonGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/AbboudB17, author = {Amir Abboud and Arturs Backurs}, editor = {Christos H. Papadimitriou}, title = {Towards Hardness of Approximation for Polynomial Time Problems}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {11:1--11:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.11}, doi = {10.4230/LIPICS.ITCS.2017.11}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/AbboudB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/AlwenRNV17, author = {Jo{\"{e}}l Alwen and Susanna F. de Rezende and Jakob Nordstr{\"{o}}m and Marc Vinyals}, editor = {Christos H. Papadimitriou}, title = {Cumulative Space in Black-White Pebbling and Resolution}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {38:1--38:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.38}, doi = {10.4230/LIPICS.ITCS.2017.38}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/AlwenRNV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/AnariGSS17, author = {Nima Anari and Shayan Oveis Gharan and Amin Saberi and Mohit Singh}, editor = {Christos H. Papadimitriou}, title = {Nash Social Welfare, Matrix Permanent, and Stable Polynomials}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {36:1--36:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.36}, doi = {10.4230/LIPICS.ITCS.2017.36}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/AnariGSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ApplebaumHIKV17, author = {Benny Applebaum and Naama Haramaty and Yuval Ishai and Eyal Kushilevitz and Vinod Vaikuntanathan}, editor = {Christos H. Papadimitriou}, title = {Low-Complexity Cryptographic Hash Functions}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {7:1--7:31}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.7}, doi = {10.4230/LIPICS.ITCS.2017.7}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ApplebaumHIKV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/AradLVV17, author = {Itai Arad and Zeph Landau and Umesh V. Vazirani and Thomas Vidick}, editor = {Christos H. Papadimitriou}, title = {Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {46:1--46:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.46}, doi = {10.4230/LIPICS.ITCS.2017.46}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/AradLVV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BabichenkoB17, author = {Yakov Babichenko and Siddharth Barman}, editor = {Christos H. Papadimitriou}, title = {Algorithmic Aspects of Private Bayesian Persuasion}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {34:1--34:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.34}, doi = {10.4230/LIPICS.ITCS.2017.34}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BabichenkoB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BavarianVY17, author = {Mohammad Bavarian and Thomas Vidick and Henry Yuen}, editor = {Christos H. Papadimitriou}, title = {Parallel Repetition via Fortification: Analytic View and the Quantum Case}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {22:1--22:33}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.22}, doi = {10.4230/LIPICS.ITCS.2017.22}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BavarianVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Ben-DavidHT17, author = {Shalev Ben{-}David and Pooya Hatami and Avishay Tal}, editor = {Christos H. Papadimitriou}, title = {Low-Sensitivity Functions from Unambiguous Certificates}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {28:1--28:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.28}, doi = {10.4230/LIPICS.ITCS.2017.28}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Ben-DavidHT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BernsteinKPPS17, author = {Aaron Bernstein and Tsvi Kopelowitz and Seth Pettie and Ely Porat and Clifford Stein}, editor = {Christos H. Papadimitriou}, title = {Simultaneously Load Balancing for Every p-norm, With Reassignments}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {51:1--51:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.51}, doi = {10.4230/LIPICS.ITCS.2017.51}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BernsteinKPPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BhangaleDN17, author = {Amey Bhangale and Irit Dinur and Inbal Livni Navon}, editor = {Christos H. Papadimitriou}, title = {Cube vs. Cube Low Degree Test}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {40:1--40:31}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.40}, doi = {10.4230/LIPICS.ITCS.2017.40}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BhangaleDN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BlaisB17, author = {Eric Blais and Abhinav Bommireddi}, editor = {Christos H. Papadimitriou}, title = {Testing Submodularity and Other Properties of Valuation Functions}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {33:1--33:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.33}, doi = {10.4230/LIPICS.ITCS.2017.33}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BlaisB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Blocki0DV17, author = {Jeremiah Blocki and Manuel Blum and Anupam Datta and Santosh S. Vempala}, editor = {Christos H. Papadimitriou}, title = {Towards Human Computable Passwords}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {10:1--10:47}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.10}, doi = {10.4230/LIPICS.ITCS.2017.10}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Blocki0DV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BrakerskiCGJSS17, author = {Zvika Brakerski and Nishanth Chandran and Vipul Goyal and Aayush Jain and Amit Sahai and Gil Segev}, editor = {Christos H. Papadimitriou}, title = {Hierarchical Functional Encryption}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {8:1--8:27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.8}, doi = {10.4230/LIPICS.ITCS.2017.8}, timestamp = {Sun, 16 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BrakerskiCGJSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BravermanGS17, author = {Mark Braverman and Sumegha Garg and Ariel Schvartzman}, editor = {Christos H. Papadimitriou}, title = {Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {18:1--18:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.18}, doi = {10.4230/LIPICS.ITCS.2017.18}, timestamp = {Thu, 04 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BravermanGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BrietDG17, author = {Jop Bri{\"{e}}t and Zeev Dvir and Sivakanth Gopi}, editor = {Christos H. Papadimitriou}, title = {Outlaw Distributions and Locally Decodable Codes}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {20:1--20:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.20}, doi = {10.4230/LIPICS.ITCS.2017.20}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BrietDG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BuhrmanCZ17, author = {Harry Buhrman and Matthias Christandl and Jeroen Zuiddam}, editor = {Christos H. Papadimitriou}, title = {Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {24:1--24:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.24}, doi = {10.4230/LIPICS.ITCS.2017.24}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BuhrmanCZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BussKKK17, author = {Sam Buss and Valentine Kabanets and Antonina Kolokolova and Michal Kouck{\'{y}}}, editor = {Christos H. Papadimitriou}, title = {Expander Construction in {VNC1}}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {31:1--31:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.31}, doi = {10.4230/LIPICS.ITCS.2017.31}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BussKKK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/CanonneGG0W17, author = {Cl{\'{e}}ment L. Canonne and Elena Grigorescu and Siyao Guo and Akash Kumar and Karl Wimmer}, editor = {Christos H. Papadimitriou}, title = {Testing k-Monotonicity}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {29:1--29:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.29}, doi = {10.4230/LIPICS.ITCS.2017.29}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/CanonneGG0W17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ChaoRSV17, author = {Rui Chao and Ben W. Reichardt and Chris Sutherland and Thomas Vidick}, editor = {Christos H. Papadimitriou}, title = {Overlapping Qubits}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {48:1--48:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.48}, doi = {10.4230/LIPICS.ITCS.2017.48}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ChaoRSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ChazelleW17, author = {Bernard Chazelle and Chu Wang}, editor = {Christos H. Papadimitriou}, title = {Self-Sustaining Iterated Learning}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {17:1--17:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.17}, doi = {10.4230/LIPICS.ITCS.2017.17}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ChazelleW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ChenCT17, author = {Xi Chen and Yu Cheng and Bo Tang}, editor = {Christos H. Papadimitriou}, title = {Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {57:1--57:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.57}, doi = {10.4230/LIPICS.ITCS.2017.57}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ChenCT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Chierichetti0PT17, author = {Flavio Chierichetti and Ravi Kumar and Alessandro Panconesi and Erisa Terolli}, editor = {Christos H. Papadimitriou}, title = {The Distortion of Locality Sensitive Hashing}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {54:1--54:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.54}, doi = {10.4230/LIPICS.ITCS.2017.54}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Chierichetti0PT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinitzZ17, author = {Michael Dinitz and Zeyu Zhang}, editor = {Christos H. Papadimitriou}, title = {Approximating Approximate Distance Oracles}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {52:1--52:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.52}, doi = {10.4230/LIPICS.ITCS.2017.52}, timestamp = {Tue, 11 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/DinitzZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurHVY17, author = {Irit Dinur and Prahladh Harsha and Rakesh Venkat and Henry Yuen}, editor = {Christos H. Papadimitriou}, title = {Multiplayer Parallel Repetition for Expanding Games}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {37:1--37:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.37}, doi = {10.4230/LIPICS.ITCS.2017.37}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurHVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/FeldmanG17, author = {Vitaly Feldman and Badih Ghazi}, editor = {Christos H. Papadimitriou}, title = {On the Power of Learning from k-Wise Queries}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {41:1--41:32}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.41}, doi = {10.4230/LIPICS.ITCS.2017.41}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/FeldmanG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Furer17, author = {Martin F{\"{u}}rer}, editor = {Christos H. Papadimitriou}, title = {Multi-Clique-Width}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {14:1--14:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.14}, doi = {10.4230/LIPICS.ITCS.2017.14}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Furer17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GellesK17, author = {Ran Gelles and Yael Tauman Kalai}, editor = {Christos H. Papadimitriou}, title = {Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {21:1--21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.21}, doi = {10.4230/LIPICS.ITCS.2017.21}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GellesK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GhaziHKS17, author = {Badih Ghazi and Elad Haramaty and Pritish Kamath and Madhu Sudan}, editor = {Christos H. Papadimitriou}, title = {Compression in a Distributed Setting}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {19:1--19:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.19}, doi = {10.4230/LIPICS.ITCS.2017.19}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GhaziHKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GhoshK17, author = {Arpita Ghosh and Robert Kleinberg}, editor = {Christos H. Papadimitriou}, title = {Inferential Privacy Guarantees for Differentially Private Mechanisms}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {9:1--9:3}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.9}, doi = {10.4230/LIPICS.ITCS.2017.9}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GhoshK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GoldwasserH17, author = {Shafi Goldwasser and Dhiraj Holden}, editor = {Christos H. Papadimitriou}, title = {The Complexity of Problems in {P} Given Correlated Instances}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {13:1--13:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.13}, doi = {10.4230/LIPICS.ITCS.2017.13}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GoldwasserH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GulikersLM17, author = {Lennart Gulikers and Marc Lelarge and Laurent Massouli{\'{e}}}, editor = {Christos H. Papadimitriou}, title = {Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {44:1--44:27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.44}, doi = {10.4230/LIPICS.ITCS.2017.44}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GulikersLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GurR17, author = {Tom Gur and Ron D. Rothblum}, editor = {Christos H. Papadimitriou}, title = {A Hierarchy Theorem for Interactive Proofs of Proximity}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {39:1--39:43}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.39}, doi = {10.4230/LIPICS.ITCS.2017.39}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GurR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Hastings17, author = {Matthew B. Hastings}, editor = {Christos H. Papadimitriou}, title = {Quantum Codes from High-Dimensional Manifolds}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {25:1--25:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.25}, doi = {10.4230/LIPICS.ITCS.2017.25}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Hastings17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/HenzingerL0W17, author = {Monika Henzinger and Andrea Lincoln and Stefan Neumann and Virginia Vassilevska Williams}, editor = {Christos H. Papadimitriou}, title = {Conditional Hardness for Sensitivity Problems}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {26:1--26:31}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.26}, doi = {10.4230/LIPICS.ITCS.2017.26}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/HenzingerL0W17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/HubacekNY17, author = {Pavel Hub{\'{a}}cek and Moni Naor and Eylon Yogev}, editor = {Christos H. Papadimitriou}, title = {The Journey from {NP} to {TFNP} Hardness}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {60:1--60:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.60}, doi = {10.4230/LIPICS.ITCS.2017.60}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/HubacekNY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/IvanyosQS17, author = {G{\'{a}}bor Ivanyos and Youming Qiao and K. V. Subrahmanyam}, editor = {Christos H. Papadimitriou}, title = {Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {55:1--55:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.55}, doi = {10.4230/LIPICS.ITCS.2017.55}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/IvanyosQS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Juba17, author = {Brendan Juba}, editor = {Christos H. Papadimitriou}, title = {Conditional Sparse Linear Regression}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {45:1--45:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.45}, doi = {10.4230/LIPICS.ITCS.2017.45}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Juba17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanM17, author = {Tali Kaufman and David Mass}, editor = {Christos H. Papadimitriou}, title = {High Dimensional Random Walks and Colorful Expansion}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {4:1--4:27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.4}, doi = {10.4230/LIPICS.ITCS.2017.4}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KennedyW17, author = {Christopher Kennedy and Rachel A. Ward}, editor = {Christos H. Papadimitriou}, title = {Fast Cross-Polytope Locality-Sensitive Hashing}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {53:1--53:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.53}, doi = {10.4230/LIPICS.ITCS.2017.53}, timestamp = {Thu, 04 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/KennedyW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KerenidisP17, author = {Iordanis Kerenidis and Anupam Prakash}, editor = {Christos H. Papadimitriou}, title = {Quantum Recommendation Systems}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {49:1--49:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.49}, doi = {10.4230/LIPICS.ITCS.2017.49}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KerenidisP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KleinbergMR17, author = {Jon M. Kleinberg and Sendhil Mullainathan and Manish Raghavan}, editor = {Christos H. Papadimitriou}, title = {Inherent Trade-Offs in the Fair Determination of Risk Scores}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {43:1--43:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.43}, doi = {10.4230/LIPICS.ITCS.2017.43}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/KleinbergMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/LauriereT17, author = {Mathieu Lauri{\`{e}}re and Dave Touchette}, editor = {Christos H. Papadimitriou}, title = {The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {47:1--47:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.47}, doi = {10.4230/LIPICS.ITCS.2017.47}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/LauriereT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Lee17, author = {James R. Lee}, editor = {Christos H. Papadimitriou}, title = {Separators in Region Intersection Graphs}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {1:1--1:8}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.1}, doi = {10.4230/LIPICS.ITCS.2017.1}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Lee17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/LynchMP17, author = {Nancy A. Lynch and Cameron Musco and Merav Parter}, editor = {Christos H. Papadimitriou}, title = {Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {15:1--15:44}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.15}, doi = {10.4230/LIPICS.ITCS.2017.15}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/LynchMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/MehtaPPTV17, author = {Ruta Mehta and Ioannis Panageas and Georgios Piliouras and Prasad Tetali and Vijay V. Vazirani}, editor = {Christos H. Papadimitriou}, title = {Mutation, Sexual Reproduction and Survival in Dynamic Environments}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {16:1--16:29}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.16}, doi = {10.4230/LIPICS.ITCS.2017.16}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/MehtaPPTV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Micali17, author = {Silvio Micali}, editor = {Christos H. Papadimitriou}, title = {Very Simple and Efficient Byzantine Agreement}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {6:1--6:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.6}, doi = {10.4230/LIPICS.ITCS.2017.6}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Micali17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ODonnell17, author = {Ryan O'Donnell}, editor = {Christos H. Papadimitriou}, title = {{SOS} Is Not Obviously Automatizable, Even Approximately}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {59:1--59:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.59}, doi = {10.4230/LIPICS.ITCS.2017.59}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ODonnell17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/PallavoorRV17, author = {Ramesh Krishnan S. Pallavoor and Sofya Raskhodnikova and Nithin Varma}, editor = {Christos H. Papadimitriou}, title = {Parameterized Property Testing of Functions}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {12:1--12:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.12}, doi = {10.4230/LIPICS.ITCS.2017.12}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/PallavoorRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/PanageasP17, author = {Ioannis Panageas and Georgios Piliouras}, editor = {Christos H. Papadimitriou}, title = {Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {2:1--2:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.2}, doi = {10.4230/LIPICS.ITCS.2017.2}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/PanageasP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/PeresSV17, author = {Yuval Peres and Mohit Singh and Nisheeth K. Vishnoi}, editor = {Christos H. Papadimitriou}, title = {Random Walks in Polytopes and Negative Dependence}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {50:1--50:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.50}, doi = {10.4230/LIPICS.ITCS.2017.50}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/PeresSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/RaghavendraRS17, author = {Prasad Raghavendra and Nick Ryder and Nikhil Srivastava}, editor = {Christos H. Papadimitriou}, title = {Real Stability Testing}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {5:1--5:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.5}, doi = {10.4230/LIPICS.ITCS.2017.5}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/RaghavendraRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Rossman17, author = {Benjamin Rossman}, editor = {Christos H. Papadimitriou}, title = {An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {27:1--27:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.27}, doi = {10.4230/LIPICS.ITCS.2017.27}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Rossman17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Rubinstein17, author = {Aviad Rubinstein}, editor = {Christos H. Papadimitriou}, title = {Detecting communities is Hard (And Counting Them is Even Harder)}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {42:1--42:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.42}, doi = {10.4230/LIPICS.ITCS.2017.42}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/Rubinstein17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/SchneiderSW17, author = {Jon Schneider and Ariel Schvartzman and S. Matthew Weinberg}, editor = {Christos H. Papadimitriou}, title = {Condorcet-Consistent and Approximately Strategyproof Tournament Rules}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {35:1--35:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.35}, doi = {10.4230/LIPICS.ITCS.2017.35}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/SchneiderSW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/SchuldenzuckerS17, author = {Steffen Schuldenzucker and Sven Seuken and Stefano Battiston}, editor = {Christos H. Papadimitriou}, title = {Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {32:1--32:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.32}, doi = {10.4230/LIPICS.ITCS.2017.32}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/SchuldenzuckerS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/SchulmanV17, author = {Leonard J. Schulman and Umesh V. Vazirani}, editor = {Christos H. Papadimitriou}, title = {The Duality Gap for Two-Team Zero-Sum Games}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {56:1--56:8}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.56}, doi = {10.4230/LIPICS.ITCS.2017.56}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/SchulmanV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ServedioT17, author = {Rocco A. Servedio and Li{-}Yang Tan}, editor = {Christos H. Papadimitriou}, title = {What Circuit Classes Can Be Learned with Non-Trivial Savings?}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {30:1--30:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.30}, doi = {10.4230/LIPICS.ITCS.2017.30}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ServedioT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/StubbsW17, author = {Daniel Stubbs and Virginia Vassilevska Williams}, editor = {Christos H. Papadimitriou}, title = {Metatheorems for Dynamic Weighted Matching}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {58:1--58:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.58}, doi = {10.4230/LIPICS.ITCS.2017.58}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/StubbsW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/X17, editor = {Christos H. Papadimitriou}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {0:i--0:x}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.0}, doi = {10.4230/LIPICS.ITCS.2017.0}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/X17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ZhuO17, author = {Zeyuan Allen Zhu and Lorenzo Orecchia}, editor = {Christos H. Papadimitriou}, title = {Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {3:1--3:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.3}, doi = {10.4230/LIPICS.ITCS.2017.3}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/ZhuO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/innovations/2017, editor = {Christos H. Papadimitriou}, title = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-029-3}, isbn = {978-3-95977-029-3}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.