| On pseudodeterministic approximation algorithms P Dixon, A Pavan, NV Vinodchandran 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 16 | 2018 |
| Complete problems for multi-pseudodeterministic computations P Dixon, A Pavan, NV Vinodchandran Innovations in Theoretical Computer Science, 2021 | 7 | 2021 |
| Pseudodeterminism: promises and lowerbounds P Dixon, A Pavan, JV Woude, NV Vinodchandran Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
| List and certificate complexities in replicable learning P Dixon, A Pavan, J Vander Woude, NV Vinodchandran Advances in Neural Information Processing Systems 36, 2024 | 3 | 2024 |
| Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma J Vander Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran arXiv e-prints, arXiv: 2304.04837, 2023 | 3* | 2023 |
| Perfect Zero Knowledge: New Upperbounds and Relativized Separations P Dixon, S Gayen, A Pavan, NV Vinodchandran TCC, 2020 | 3 | 2020 |
| Promise Problems Meet Pseudodeterminism P Dixon, A Pavan, NV Vinodchandran arXiv preprint arXiv:2103.08589, 2021 | 2 | 2021 |
| A Note on the Advice Complexity of Multipass Randomized Logspace P Dixon, D Mandal, A Pavan, NV Vinodchandran 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 1 | 2016 |
| Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube JV Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran arXiv preprint arXiv:2306.12593, 2023 | | 2023 |
| Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube J Vander Woude, P Dixon, A Pavan, J Radcliffe, NV Vinodchandran arXiv e-prints, arXiv: 2306.12593, 2023 | | 2023 |
| Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes P Dixon Iowa State University, 2021 | | 2021 |
Pavan AduriIowa State UniversityE-mailová adresa ověřena na: cs.iastate.edu
