Peter Dixon

Peter Dixon

Iowa State University

H-index: 3

North America-United States

About Peter Dixon

Peter Dixon, With an exceptional h-index of 3 and a recent h-index of 3 (since 2020), a distinguished researcher at Iowa State University, specializes in the field of complexity, randomness, pseudodeterminism, reproducibility.

His recent articles reflect a diverse array of research interests and contributions to the field:

List and certificate complexities in replicable learning

Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube

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

Pseudodeterminism: promises and lowerbounds

Promise Problems Meet Pseudodeterminism

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes

Complete problems for multi-pseudodeterministic computations

Perfect Zero Knowledge: New Upperbounds and Relativized Separations

Peter Dixon Information

University

Position

___

Citations(all)

38

Citations(since 2020)

38

Cited By

11

hIndex(all)

3

hIndex(since 2020)

3

i10Index(all)

1

i10Index(since 2020)

1

Email

University Profile Page

Google Scholar

Peter Dixon Skills & Research Interests

complexity

randomness

pseudodeterminism

reproducibility

Top articles of Peter Dixon

List and certificate complexities in replicable learning

Advances in Neural Information Processing Systems

2024/2/13

Peter Dixon
Peter Dixon

H-Index: 2

Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube

arXiv preprint arXiv:2306.12593

2023/6/21

Peter Dixon
Peter Dixon

H-Index: 2

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

arXiv preprint arXiv:2304.04837

2023/4/10

Peter Dixon
Peter Dixon

H-Index: 2

Pseudodeterminism: promises and lowerbounds

2022/6/9

Peter Dixon
Peter Dixon

H-Index: 2

Promise Problems Meet Pseudodeterminism

arXiv preprint arXiv:2103.08589

2021/3/15

Peter Dixon
Peter Dixon

H-Index: 2

Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes

2021

Peter Dixon
Peter Dixon

H-Index: 2

Complete problems for multi-pseudodeterministic computations

Innovations in Theoretical Computer Science

2021/1

Peter Dixon
Peter Dixon

H-Index: 2

Perfect Zero Knowledge: New Upperbounds and Relativized Separations

2020/11/16

Peter Dixon
Peter Dixon

H-Index: 2

See List of Professors in Peter Dixon University(Iowa State University)

Co-Authors

academic-engine