default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 19
Volume 19, 2023
- Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma:
Sublinear-Time Computation in the Presence of Online Erasures. 1-48 - Rahul Jain, Raghunath Tewari:
On Solving Reachability in Grid Digraphs using a Pseudoseparator. 1-23 - Irit Dinur
, Inbal Livni Navon:
Exponentially Small Soundness for the Direct Product Z-test. 1-56 - Shuichi Hirahara:
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. 1-61 - Jaroslaw Byrka, Raghu Meka:
Special Issue: APPROX-RANDOM 2020: Guest Editor's Foreword. 1-3 - Linh V. Tran, Van Vu:
Reaching a Consensus on Random Networks: The Power of Few. 1-21 - Yuval Filmus, Or Meir, Avishay Tal:
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. 1-51 - Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning Down the Strong Wilber-1 Bound for Binary Search Trees. 1-71 - Dmytro Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
Optimal Composition Theorem for Randomized Query Complexity. 1-35 - Elbert Du, Michael Mitzenmacher, David P. Woodruff, Guang Yang:
Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams. 1-44 - Joshua Brody, Jae Tak Kim, Peem Lerdputtipongporn, Hariharan Srinivasulu:
A Strong XOR Lemma for Randomized Query Complexity. 1-14 - Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. 1-30
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-12-04 22:08 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:
