default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th ITCS 2022
- Mark Braverman:
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA. LIPIcs 215, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-217-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:24
- Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, Andrés Perlroth:
Maximizing Revenue in the Presence of Intermediaries. 1:1-1:22 - Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta
, Maciej Obremski:
Algebraic Restriction Codes and Their Applications. 2:1-2:15 - Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. 3:1-3:25 - Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta:
Pre-Constrained Encryption. 4:1-4:20 - Nima Anari, Michal Derezinski, Thuy-Duong Vuong, Elizabeth Yang:
Domain Sparsification of Discrete Distributions Using Entropic Independence. 5:1-5:23 - Anurag Anshu, Chinmay Nirkhe:
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians. 6:1-6:22 - Shiri Antaki, Quanquan C. Liu, Shay Solomon:
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. 7:1-7:25 - Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. 8:1-8:23 - Sepehr Assadi, Vihan Shah:
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. 9:1-9:23 - Sepehr Assadi, Chen Wang:
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. 10:1-10:20 - Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Multi-Channel Bayesian Persuasion. 11:1-11:2 - Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. 12:1-12:14 - Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. 13:1-13:22 - Boaz Barak, Kunal Marwaha:
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs. 14:1-14:21 - James Bartusek, Giulio Malavolta:
Indistinguishability Obfuscation of Null Quantum Circuits and Applications. 15:1-15:13 - Anubhav Baweja, Justin Jia, David P. Woodruff:
An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes. 16:1-16:23 - Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, C. Seshadhri:
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. 17:1-17:24 - Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? 18:1-18:23 - Huck Bennett, Chris Peikert, Yi Tang:
Improved Hardness of BDD and SVP Under Gap-(S)ETH. 19:1-19:12 - Amey Bhangale, Prahladh Harsha, Sourya Roy:
Mixing of 3-Term Progressions in Quasirandom Groups. 20:1-20:9 - Amey Bhangale, Aleksa Stankovic:
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs. 21:1-21:21 - Vijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani:
Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. 22:1-22:17 - Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. 23:1-23:18 - Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld:
Local Access to Random Walks. 24:1-24:22 - Greg Bodwin, Michael Dinitz, Yasamin Nazari:
Vertex Fault-Tolerant Emulators. 25:1-25:22 - Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. 26:1-26:18 - Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. 27:1-27:24 - Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. 28:1-28:20 - Sebastian Brandt, 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. 29:1-29:26 - Liron Bronfman, Ron D. Rothblum:
PCPs and Instance Compression from a Cryptographic Lens. 30:1-30:19 - 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. 31:1-31:12 - Johannes Bund, Christoph Lenzen, Moti Medina:
Small Hazard-Free Transducers. 32:1-32:24 - Sílvia Casacuberta, Rasmus Kyng:
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. 33:1-33:24 - Bruno Pasqualotto Cavalar, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. 34:1-34:21 - Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. 35:1-35:25 - Keren Censor-Hillel, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan:
Distributed Vertex Cover Reconfiguration. 36:1-36:23 - Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Adversarially Robust Coloring for Graph Streams. 37:1-37:23 - Brynmor Chapman, R. Ryan Williams:
Smaller ACC0 Circuits for Symmetric Functions. 38:1-38:19 - Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay:
Monotone Complexity of Spanning Tree Polynomial Re-Visited. 39:1-39:21 - Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. 40:1-40:23 - Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
On the Existence of Competitive Equilibrium with Chores. 41:1-41:13 - Shuchi Chawla, Meena Jagadeesan:
Individual Fairness in Advertising Auctions Through Inverse Proportionality. 42:1-42:21 - Xue Chen, Kuan Cheng, Xin Li, Minghui Ouyang:
Improved Decoding of Expander Codes. 43:1-43:3 - Yiling Chen, Alon Eden, Juntao Wang:
Cursed yet Satisfied Agents. 44:1-44:1 - Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. 45:1-45:16 - Sitan Chen, Zhao Song, Runzhou Tao, Ruizhe Zhang:
Symmetric Sparse Boolean Matrix Factorization and Applications. 46:1-46:25 - Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. 47:1-47:16 - Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam:
Larger Corner-Free Sets from Combinatorial Degenerations. 48:1-48:20 - Giorgos Christodoulou, Vasilis Gkatzelis, Daniel Schoepflin:
Optimal Deterministic Clock Auctions and Beyond. 49:1-49:23 - Roni Con, Itzhak Tamo:
Nonlinear Repair Schemes of Reed-Solomon Codes. 50:1-50:1 - Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
A Complete Linear Programming Hierarchy for Linear Codes. 51:1-51:22 - Anuj Dawar, Gregory Wilsenach:
Lower Bounds for Symmetric Circuits for the Determinant. 52:1-52:22 - Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Convex Influences. 53:1-53:21 - Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman:
The Importance of the Spectral Gap in Estimating Ground-State Energies. 54:1-54:6 - Shahar Dobzinski, Sigal Oren:
Mechanism Design with Moral Bidders. 55:1-55:17 - Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs:
Small-Box Cryptography. 56:1-56:25 - Nico Döttling, Vipul Goyal, Giulio Malavolta, Justin Raizes:
Interaction-Preserving Compilers for Secure Computation. 57:1-57:18 - Shaddin Dughmi:
Matroid Secretary Is Equivalent to Contention Resolution. 58:1-58:23 - Kunal Dutta, Arijit Ghosh, Shay Moran:
Uniform Brackets, Containers, and Combinatorial Macbeath Regions. 59:1-59:10 - Farzam Ebrahimnejad, James R. Lee:
Multiscale Entropic Regularization for MTS on General Metric Spaces. 60:1-60:21 - Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan:
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs. 61:1-61:12 - Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and Labeling Schemes for A. 62:1-62:19 - Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. 63:1-63:23 - Ronen Eldan, Dana Moshkovitz:
Reduction from Non-Unique Games to Boolean Unique Games. 64:1-64:25 - Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda:
Pseudorandom Self-Reductions for NP-Complete Problems. 65:1-65:12 - Meryem Essaidi, Matheus V. X. Ferreira, S. Matthew Weinberg:
Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions. 66:1-66:19 - Michael Ezra, Ron D. Rothblum:
Small Circuits Imply Efficient Arthur-Merlin Protocols. 67:1-67:16 - Omar Fawzi, Alexander Müller-Hermes, Ala Shayeghi:
A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation. 68:1-68:20 - Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. 69:1-69:25 - Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. 70:1-70:23 - Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. 71:1-71:22 - Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard:
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. 72:1-72:19 - Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid:
Continuous Tasks and the Asynchronous Computability Theorem. 73:1-73:27 - Luca Ganassali, Laurent Massoulié, Marc Lelarge:
Correlation Detection in Trees for Planted Graph Alignment. 74:1-74:8 - Sevag Gharibian, Dorian Rudolph:
On Polynomially Many Queries to NP or QMA Oracles. 75:1-75:27 - Uma Girish, Ran Raz:
Eliminating Intermediate Measurements Using Pseudorandom Generators. 76:1-76:18 - Guy Goldberg, Guy N. Rothblum:
Sample-Based Proofs of Proximity. 77:1-77:19 - Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. 78:1-78:19 - Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. 79:1-79:21 - W. T. Gowers, Emanuele Viola:
Mixing in Non-Quasirandom Groups. 80:1-80:9 - Vipul Goyal, Justin Raizes, Pratik Soni:
Time-Traveling Simulators Using Blockchains and Their Applications. 81:1-81:19 - Varun Gupta, Christopher Jung, Georgy Noarov, Mallesh M. Pai, Aaron Roth:
Online Multivalid Learning: Means, Moments, and Prediction Intervals. 82:1-82:24 - MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-Round Tree Contraction. 83:1-83:23 - Shuichi Hirahara, Rahul Santhanam:
Errorless Versus Error-Prone Average-Case Complexity. 84:1-84:23 - Shuichi Hirahara, Rahul Santhanam:
Excluding PH Pessiland. 85:1-85:25 - Mojtaba Hosseini, Vijay V. Vazirani:
Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu. 86:1-86:20 - Gábor Ivanyos, Tushant Mittal, Youming Qiao:
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. 87:1-87:21 - Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, Madhur Tulsiani:
Explicit Abelian Lifts and Quantum LDPC Codes. 88:1-88:21 - Chris Jones, Aaron Potechin:
Almost-Orthogonal Bases for Inner Product Polynomials. 89:1-89:21 - Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. 90:1-90:25 - Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, Samson Zhou:
Noisy Boolean Hidden Matching with Applications. 91:1-91:19 - Gili Karni, Guy N. Rothblum, Gal Yona:
On Fairness and Stability in Two-Sided Matchings. 92:1-92:17 - Sanjeev Khanna, Christian Konrad:
Optimal Bounds for Dominating Set in Graph Streams. 93:1-93:23 - Peter Kiss:
Deterministic Dynamic Matching in Worst-Case Update Time. 94:1-94:21 - Yuqing Kong:
More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of Tasks. 95:1-95:20 - Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams:
Dynamic Matching Algorithms Under Vertex Updates. 96:1-96:24 - François Le Gall, Saeed Seddighin:
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. 97:1-97:23 - Jasper C. H. Lee, Paul Valiant:
Optimal Sub-Gaussian Mean Estimation in Very High Dimensions. 98:1-98:21 - Alexander Lindermayr, Nicole Megow, Bertrand Simon:
Double Coverage with Machine-Learned Advice. 99:1-99:18 - Jiahui Liu, Qipeng Liu, Luowen Qian:
Beating Classical Impossibility of Position Verification. 100:1-100:11 - Yang P. Liu, Ashwin Sah, Mehtaab Sawhney:
A Gaussian Fixed Point Random Walk. 101:1-101:10 - Alex Lombardi, Vinod Vaikuntanathan:
Correlation-Intractable Hash Functions via Shift-Hiding. 102:1-102:16 - Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with Incomplete Information: The Power of Two Queries. 103:1-103:23 - Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang:
Lifting with Sunflowers. 104:1-104:24 - Jieming Mao, Renato Paes Leme, Kangning Wang:
Interactive Communication in Bilateral Trade. 105:1-105:21 - Arya Mazumdar, Soumyabrata Pal:
Support Recovery in Universal One-Bit Compressed Sensing. 106:1-106:20 - Boaz Menuhin, Moni Naor:
Keep That Card in Mind: Card Guessing with Limited Memory. 107:1-107:28 - Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. 108:1-108:22 - Sam Olesker-Taylor, Luca Zanetti:
Geometric Bounds on the Fastest Mixing Markov Chain. 109:1-109:1 - Shir Peleg, Ben Lee Volk, Amir Shpilka:
Lower Bounds on Stabilizer Rank. 110:1-110:4 - Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. 111:1-111:23 - Gregory Rosenthal, Henry Yuen:
Interactive Proofs for Synthesizing Quantum States and Unitaries. 112:1-112:4 - Aviad Rubinstein, Junyao Zhao:
Budget-Smoothed Analysis for Submodular Maximization. 113:1-113:23 - Ziv Scully, Isaac Grosof, Michael Mitzenmacher:
Uniform Bounds for Scheduling with Job Size Estimates. 114:1-114:30 - Masoud Seddighin, Saeed Seddighin:
3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time. 115:1-115:22 - Ronen Shaltiel, Emanuele Viola:
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. 116:1-116:17 - Noah Shutty, Mary Wootters:
Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data. 117:1-117:19 - Gaurav Sinha:
Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In Two. 118:1-118:33 - Dieter van Melkebeek, Andrew Morgan:
Polynomial Identity Testing via Evaluation of Rational Functions. 119:1-119:24 - Weina Wang, Anupam Gupta, Jalani Williams:
Probing to Minimize. 120:1-120:23
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.
last updated on 2025-11-04 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
