Peter Dixon

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 13

Top Topics

Confidence Bounds

Johnson Lindenstrauss

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran
List and Certificate Complexities in Replicable Learning. CoRR (2023)
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR (2023)
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
List and Certificate Complexities in Replicable Learning. NeurIPS (2023)
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
Pseudodeterminism: promises and lowerbounds. STOC (2022)
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
Geometry of Rounding. CoRR (2022)
Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran
The Geometry of Rounding. Electron. Colloquium Comput. Complex. (2022)
Peter Dixon, A. Pavan, N. V. Vinodchandran
Complete Problems for Multi-Pseudodeterministic Computations. ITCS (2021)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. 28 (2021)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
Promise Problems Meet Pseudodeterminism. CoRR (2021)
Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020 (2020)
Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) (2020)
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
On Pseudodeterministic Approximation Algorithms. MFCS (2018)
Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS (2016)