Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta 0001, Zhouzi Li |
Graph Searching with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 12:1-12:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, João Ribeiro 0002 |
Asynchronous Multi-Party Quantum Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 62:1-62:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak |
Efficiently Testable Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 10:1-10:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Elaine Shi, Hao Chung, Ke Wu 0001 |
What Can Cryptography Do for Decentralized Mechanism Design? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 97:1-97:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anne Broadbent, Eric Culf |
Rigidity for Monogamy-Of-Entanglement Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 28:1-28:29, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pasin Manurangsi |
Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 85:1-85:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrew M. Childs, Matthew Coudron, Amin Shiraz Gilani |
Quantum Algorithms and the Power of Forgetting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 37:1-37:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Omrit Filtser, Mayank Goswami 0001, Joseph S. B. Mitchell, Valentin Polishchuk |
On Flipping the Fréchet Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 51:1-51:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang 0001 |
Quantum Meets the Minimum Circuit Size Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 47:1-47:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda |
Pseudorandom Self-Reductions for NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 65:1-65:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Peter Kiss |
Deterministic Dynamic Matching in Worst-Case Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 94:1-94:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld |
Local Access to Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 24:1-24:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gaurav Sinha |
Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 118:1-118:33, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anuj Dawar, Gregory Wilsenach |
Lower Bounds for Symmetric Circuits for the Determinant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 52:1-52:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anubhav Baweja, Justin Jia, David P. Woodruff |
An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 16:1-16:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Oded Goldreich 0001, Dana Ron |
Testing Distributions of Huge Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 78:1-78:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Brandt 0002, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky |
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 29:1-29:26, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Mojtaba Hosseini, Vijay V. Vazirani |
Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 86:1-86:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman |
Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 31:1-31:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nico Döttling, Vipul Goyal, Giulio Malavolta, Justin Raizes |
Interaction-Preserving Compilers for Secure Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 57:1-57:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Boaz Menuhin, Moni Naor |
Keep That Card in Mind: Card Guessing with Limited Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 107:1-107:28, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman |
Quantum Distributed Algorithms for Detection of Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 35:1-35:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Prabhanjan Ananth, Abhishek Jain 0002, Zhengzhong Jin, Giulio Malavolta |
Pre-Constrained Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 4:1-4:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shahar Dobzinski, Sigal Oren |
Mechanism Design with Moral Bidders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 55:1-55:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Zvika Brakerski, Vinod Vaikuntanathan |
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 28:1-28:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yuqing Kong |
More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 95:1-95:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava |
A Spectral Approach to Polytope Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 108:1-108:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sevag Gharibian, Dorian Rudolph |
On Polynomially Many Queries to NP or QMA Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 75:1-75:27, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid 0001 |
Continuous Tasks and the Asynchronous Computability Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 73:1-73:27, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Talya Eden, Piotr Indyk, Haike Xu |
Embeddings and Labeling Schemes for A. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 62:1-62:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi |
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 8:1-8:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara, Rahul Santhanam |
Excluding PH Pessiland. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 85:1-85:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gábor Ivanyos, Tushant Mittal, Youming Qiao |
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 87:1-87:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger |
Fixed-Parameter Sensitivity Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 23:1-23:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | James Bartusek, Giulio Malavolta |
Indistinguishability Obfuscation of Null Quantum Circuits and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 15:1-15:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Eshan Chattopadhyay, Jesse Goodman, David Zuckerman |
The Space Complexity of Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 40:1-40:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Guy Goldberg, Guy N. Rothblum |
Sample-Based Proofs of Proximity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 77:1-77:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere |
On Semi-Algebraic Proofs and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 69:1-69:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
Convex Influences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 53:1-53:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, Andrés Perlroth |
Maximizing Revenue in the Presence of Intermediaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 1:1-1:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | François Le Gall, Saeed Seddighin |
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 97:1-97:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam |
Larger Corner-Free Sets from Combinatorial Degenerations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 48:1-48:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon |
A Unifying Framework for Characterizing and Computing Width Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 63:1-63:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jieming Mao, Renato Paes Leme, Kangning Wang |
Interactive Communication in Bilateral Trade. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 105:1-105:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Lindermayr, Nicole Megow, Bertrand Simon 0001 |
Double Coverage with Machine-Learned Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 99:1-99:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Andrej Bogdanov, Krishnamoorthy Dinesh 0001, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan |
Bounded Indistinguishability for Simple Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 26:1-26:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anurag Anshu, Chinmay Nirkhe |
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 6:1-6:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard |
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 72:1-72:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou |
Noisy Boolean Hidden Matching with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 91:1-91:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ziv Scully, Isaac Grosof, Michael Mitzenmacher |
Uniform Bounds for Scheduling with Job Size Estimates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 114:1-114:30, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Weina Wang 0001, Anupam Gupta 0001, Jalani Williams |
Probing to Minimize. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 120:1-120:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Liron Bronfman, Ron D. Rothblum |
PCPs and Instance Compression from a Cryptographic Lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 30:1-30:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Aviad Rubinstein, Junyao Zhao 0001 |
Budget-Smoothed Analysis for Submodular Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 113:1-113:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Farzam Ebrahimnejad, James R. Lee |
Multiscale Entropic Regularization for MTS on General Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 60:1-60:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kunal Dutta, Arijit Ghosh, Shay Moran |
Uniform Brackets, Containers, and Combinatorial Macbeath Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 59:1-59:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Marshall Ball, Oded Goldreich 0001, Tal Malkin |
Randomness Extraction from Somewhat Dependent Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 12:1-12:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha |
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 13:1-13:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shaddin Dughmi |
Matroid Secretary Is Equivalent to Contention Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 58:1-58:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay |
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 39:1-39:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Amey Bhangale, Prahladh Harsha, Sourya Roy |
Mixing of 3-Term Progressions in Quasirandom Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 20:1-20:9, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shir Peleg, Ben Lee Volk, Amir Shpilka |
Lower Bounds on Stabilizer Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 110:1-110:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi |
Multi-Channel Bayesian Persuasion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 11:1-11:2, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arya Mazumdar, Soumyabrata Pal |
Support Recovery in Universal One-Bit Compressed Sensing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 106:1-106:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ronen Eldan, Dana Moshkovitz |
Reduction from Non-Unique Games to Boolean Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 64:1-64:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Brynmor Chapman, R. Ryan Williams |
Smaller ACC0 Circuits for Symmetric Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 38:1-38:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ronen Shaltiel, Emanuele Viola |
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 116:1-116:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nima Anari, Michal Derezinski, Thuy-Duong Vuong, Elizabeth Yang |
Domain Sparsification of Discrete Distributions Using Entropic Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 5:1-5:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sílvia Casacuberta, Rasmus Kyng |
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 33:1-33:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Varun Gupta 0006, Christopher Jung 0001, Georgy Noarov, Mallesh M. Pai, Aaron Roth 0001 |
Online Multivalid Learning: Means, Moments, and Prediction Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 82:1-82:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Hung Le 0001, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams |
Dynamic Matching Algorithms Under Vertex Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 96:1-96:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Giorgos Christodoulou 0001, Vasilis Gkatzelis, Daniel Schoepflin 0001 |
Optimal Deterministic Clock Auctions and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 49:1-49:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Meryem Essaidi, Matheus V. X. Ferreira, S. Matthew Weinberg |
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 66:1-66:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios Los, Thomas Sauerwald |
Balanced Allocations with Incomplete Information: The Power of Two Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 103:1-103:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Chris Jones, Aaron Potechin |
Almost-Orthogonal Bases for Inner Product Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 89:1-89:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jasper C. H. Lee, Paul Valiant |
Optimal Sub-Gaussian Mean Estimation in Very High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 98:1-98:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang |
Lifting with Sunflowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 104:1-104:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones |
A Complete Linear Programming Hierarchy for Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 51:1-51:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman |
The Importance of the Spectral Gap in Estimating Ground-State Energies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 54:1-54:6, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Bund, Christoph Lenzen 0001, Moti Medina |
Small Hazard-Free Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 32:1-32:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan |
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 61:1-61:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder |
Omnipredictors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 79:1-79:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Mohammad Roghani, Amin Saberi, David Wajc |
Beating the Folklore Algorithm for Dynamic Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 111:1-111:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl |
Adversarially Robust Coloring for Graph Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 37:1-37:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shiri Antaki, Quanquan C. Liu, Shay Solomon |
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 7:1-7:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma |
Sublinear-Time Computation in the Presence of Online Erasures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 90:1-90:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sitan Chen, Zhao Song 0002, Runzhou Tao, Ruizhe Zhang 0001 |
Symmetric Sparse Boolean Matrix Factorization and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 46:1-46:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jiahui Liu, Qipeng Liu 0001, Luowen Qian |
Beating Classical Impossibility of Position Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 100:1-100:11, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski |
Algebraic Restriction Codes and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 2:1-2:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sanjeev Khanna, Christian Konrad 0001 |
Optimal Bounds for Dominating Set in Graph Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 93:1-93:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su |
Adaptive Massively Parallel Constant-Round Tree Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 83:1-83:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gili Karni, Guy N. Rothblum, Gal Yona |
On Fairness and Stability in Two-Sided Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 92:1-92:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dieter van Melkebeek, Andrew Morgan |
Polynomial Identity Testing via Evaluation of Rational Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 119:1-119:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Roni Con, Itzhak Tamo |
Nonlinear Repair Schemes of Reed-Solomon Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 50:1-50:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Alex Lombardi, Vinod Vaikuntanathan |
Correlation-Intractable Hash Functions via Shift-Hiding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 102:1-102:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes 0002, Madhur Tulsiani |
Explicit Abelian Lifts and Quantum LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 88:1-88:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Masoud Seddighin, Saeed Seddighin |
3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 115:1-115:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yiling Chen 0001, Alon Eden, Juntao Wang 0004 |
Cursed yet Satisfied Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 44:1-44:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein |
Locality-Preserving Hashing for Shifts with Connections to Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 27:1-27:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | W. T. Gowers 0001, Emanuele Viola |
Mixing in Non-Quasirandom Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 80:1-80:9, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta |
On the Existence of Competitive Equilibrium with Chores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 41:1-41:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|