Peter Dixon

According to our database, Peter Dixon authored at least 9 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma.

Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran

CoRR, 2023

List and Certificate Complexities in Replicable Learning.

Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

The Geometry of Rounding.

Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2022

Pseudodeterminism: promises and lowerbounds.

Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Promise Problems Meet Pseudodeterminism.

Peter Dixon, Aduri Pavan, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2021

Complete Problems for Multi-Pseudodeterministic Computations.

Peter Dixon, A. Pavan, N. V. Vinodchandran

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Perfect Zero Knowledge: New Upperbounds and Relativized Separations.

Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran

IACR Cryptol. ePrint Arch., 2020

2018

On Pseudodeterministic Approximation Algorithms.

Peter Dixon, Aduri Pavan, N. V. Vinodchandran

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2016

A Note on the Advice Complexity of Multipass Randomized Logspace.

Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016