default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 161 matches
- 2025
- Suyash Bagad, Quang Dao, Yuval Domb, Justin Thaler:
Speeding Up Sum-Check Proving. IACR Cryptol. ePrint Arch. 2025: 1117 (2025) - Vineet Nair, Justin Thaler, Michael Zhu:
Proving CPU Executions in Small Space. IACR Cryptol. ePrint Arch. 2025: 611 (2025) - Srinath T. V. Setty, Justin Thaler:
Twist and Shout: Faster memory checking arguments via one-hot addressing and increments. IACR Cryptol. ePrint Arch. 2025: 105 (2025) - 2024
- Alexander R. Block
, Zhiyong Fang, Jonathan Katz
Field-Agnostic SNARKs from Expand-Accumulate Codes. CRYPTO (10) 2024: 276-307 - Arasu Arun, Srinath T. V. Setty, Justin Thaler:
Jolt: SNARKs for Virtual Machines via Lookups. EUROCRYPT (6) 2024: 3-33 - Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Unlocking the Lookup Singularity with Lasso. EUROCRYPT (6) 2024: 180-209 - Suyash Bagad, Yuval Domb, Justin Thaler:
The Sum-Check Protocol over Fields of Small Characteristic. IACR Cryptol. ePrint Arch. 2024: 1046 (2024) - Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang:
Field-Agnostic SNARKs from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2024: 1871 (2024) - Quang Dao, Justin Thaler:
Constraint-Packing and the Sum-Check Protocol over Binary Tower Fields. IACR Cryptol. ePrint Arch. 2024: 1038 (2024) - Quang Dao, Justin Thaler:
More Optimizations to Sum-Check Proving. IACR Cryptol. ePrint Arch. 2024: 1210 (2024) - Carl Kwan, Quang Dao, Justin Thaler:
Verifying Jolt zkVM Lookup Semantics. IACR Cryptol. ePrint Arch. 2024: 1841 (2024) - 2023
- Graham Cormode
Relative Error Streaming Quantiles. J. ACM 70(5): 30:1-30:48 (2023) - Alexander R. Block
Fiat-Shamir Security of FRI and Related SNARKs. ASIACRYPT (2) 2023: 3-40 - Alexander Golovnev, Jonathan Lee, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS. CRYPTO (2) 2023: 193-226 - Matteo Campanelli
sfTestudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. LATINCRYPT 2023: 331-351 - Arasu Arun, Srinath T. V. Setty, Justin Thaler:
Jolt: SNARKs for Virtual Machines via Lookups. IACR Cryptol. ePrint Arch. 2023: 1217 (2023) - Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac:
Fiat-Shamir Security of FRI and Related SNARKs. IACR Cryptol. ePrint Arch. 2023: 1071 (2023) - Matteo Campanelli, Nicolas Gailly, Rosario Gennaro, Philipp Jovanovic, Mara Mihali, Justin Thaler:
Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup. IACR Cryptol. ePrint Arch. 2023: 961 (2023) - Srinath T. V. Setty, Justin Thaler:
BabySpartan: Lasso-based SNARK for non-uniform computation. IACR Cryptol. ePrint Arch. 2023: 1799 (2023) - Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Customizable constraint systems for succinct arguments. IACR Cryptol. ePrint Arch. 2023: 552 (2023) - Srinath T. V. Setty, Justin Thaler, Riad S. Wahby:
Unlocking the lookup singularity with Lasso. IACR Cryptol. ePrint Arch. 2023: 1216 (2023) - 2022
- Justin Thaler:
Proofs, Arguments, and Zero-Knowledge. Found. Trends Priv. Secur. 4(2-4): 117-660 (2022) - Mark Bun
Approximate Degree in Classical and Quantum Computing. Found. Trends Theor. Comput. Sci. 15(3-4): 229-423 (2022) - Marcel Dall'Agnol, Tom Gur
Quantum Proofs of Proximity. Quantum 6: 834 (2022) - Graham Cormode
Relative Error Streaming Quantiles. SIGMOD Rec. 51(1): 69-76 (2022) - Charlie Dickens, Justin Thaler, Daniel Ting:
Order-Invariant Cardinality Estimators Are Differentially Private. NeurIPS 2022 - Charlie Dickens, Justin Thaler, Daniel Ting:
(Nearly) All Cardinality Estimators Are Differentially Private. CoRR abs/2203.15400 (2022) - 2021
- Mark Bun
Quantum algorithms and approximating polynomials for composed functions with shared inputs. Quantum 5: 543 (2021) - Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. Adv. Math. Commun. 17: 1-46 (2021) - Mark Bun
Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13(4): 24:1-24:17 (2021)
skipping 131 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-07-19 03:10 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: