We stand with Ukraine  

Peter Dixon

Affiliations:
  • Iowa State University, Ames, USA


According to our database1, Peter Dixon authored at least 11 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2024
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma.
[BibTeX]
[DOI]
Jason Vander Woude
,
Peter Dixon
,
Aduri Pavan
,
Jamie Radcliffe
,
N. V. Vinodchandran
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma.
[BibTeX]
[DOI]
Jason Vander Woude
,
Peter Dixon
,
Aduri Pavan
,
Jamie Radcliffe
,
N. V. Vinodchandran
CoRR, 2023

List and Certificate Complexities in Replicable Learning.
[BibTeX]
[DOI]
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
Probabilistic computations: Mild derandomizatons and zero-knowledge classes.
[BibTeX]
[DOI]
Peter Dixon
PhD thesis, 2022

The Geometry of Rounding.
[BibTeX]
[DOI]
Jason Vander Woude
,
Peter Dixon
,
A. Pavan
,
Jamie Radcliffe
,
N. V. Vinodchandran
Electron. Colloquium Comput. Complex., 2022

Pseudodeterminism: promises and lowerbounds.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Peter Dixon
,
Aduri Pavan
,
N. V. Vinodchandran
Electron. Colloquium Comput. Complex., 2021

Complete Problems for Multi-Pseudodeterministic Computations.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Peter Dixon
,
Sutanu Gayen
,
Aduri Pavan
,
N. V. Vinodchandran
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2018
On Pseudodeterministic Approximation Algorithms.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Peter Dixon
,
Debasis Mandal
,
Aduri Pavan
,
N. V. Vinodchandran
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016


  Loading...