Peter Dixon

15 papers A* 3A 1B 2Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2024 A* conf
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma.
NeurIPS
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2023 J jnl
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma.
CoRR
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2023 A* conf
List and Certificate Complexities in Replicable Learning.
NeurIPS
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2023 J jnl
List and Certificate Complexities in Replicable Learning.
CoRR
Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran
2022 J jnl
Geometry of Rounding.
CoRR
Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran
2022 — —
Probabilistic computations: Mild derandomizatons and zero-knowledge classes.
Peter Dixon
2022 A* conf
Pseudodeterminism: promises and lowerbounds.
STOC
Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran
2022 J jnl
The Geometry of Rounding.
Electron. Colloquium Comput. Complex.
Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran
2021 A conf
Complete Problems for Multi-Pseudodeterministic Computations.
ITCS
Peter Dixon, A. Pavan, N. V. Vinodchandran
2021 J jnl
Promise Problems Meet Pseudodeterminism.
CoRR
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2021 J jnl
Promise Problems Meet Pseudodeterminism.
Electron. Colloquium Comput. Complex.
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2020 — conf
Perfect Zero Knowledge: New Upperbounds and Relativized Separations.
TCC (1)
Peter Dixon, Sutanu Gayen, Aduri Pavan, N. V. Vinodchandran
2020 J jnl
Perfect Zero Knowledge: New Upperbounds and Relativized Separations.
IACR Cryptol. ePrint Arch.
Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran
2018 B conf
On Pseudodeterministic Approximation Algorithms.
MFCS
Peter Dixon, Aduri Pavan, N. V. Vinodchandran
2016 B conf
A Note on the Advice Complexity of Multipass Randomized Logspace.
MFCS
Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran