The following pages link to Justin Thaler (Q378242):
Displaying 42 items.
- External-memory multimaps (Q378243) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- (Q2830865) (← links)
- Faster Algorithms for Privately Releasing Marginals (Q2843303) (← links)
- Time-Optimal Interactive Proofs for Circuit Evaluation (Q2849387) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Streaming Verification in Data Analysis (Q3459909) (← links)
- (Q4598150) (← links)
- Improved Bounds on the Sign-Rank of AC^0 (Q4598174) (← links)
- Semi-Streaming Algorithms for Annotated Graph Streams (Q4598198) (← links)
- (Q4601830) (← links)
- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (Q4916042) (← links)
- Annotations in Data Streams (Q4962165) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Sign-rank Can Increase under Intersection (Q5066143) (← links)
- (Q5091179) (← links)
- (Q5092454) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- Hierarchical Heavy Hitters with the Space Saving Algorithm (Q5233728) (← links)
- Quantum algorithms and approximating polynomials for composed functions with shared inputs (Q5236223) (← links)
- (Q5276185) (← links)
- Annotations for Sparse Data Streams (Q5384013) (← links)
- (Q5874384) (← links)
- (Q5875514) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- Ad Hoc Multi-Input Functional Encryption. (Q5875740) (← links)
- (Q6062143) (← links)
- (Q6176153) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup (Q6619943) (← links)
- \textsf{Jolt}: SNARKs for virtual machines via lookups (Q6637560) (← links)
- Unlocking the lookup singularity with \textsf{Lasso} (Q6637567) (← links)
- Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
