Pseudodeterminism: promises and lowerbounds. - Peter Dixon 002; Aduri Pavan; Jason Vander Woude; N. V. Vinodchandran (STOC, 2022)

The Geometry of Rounding. - Jason Vander Woude; Peter Dixon 002; A. Pavan 001; Jamie Radcliffe; N. V. Vinodchandran (Electron. Colloquium Comput. Complex., 2022)

List and Certificate Complexities in Replicable Learning. - Peter Dixon 002; Aduri Pavan; Jason Vander Woude; N. V. Vinodchandran (NeurIPS, 2023)

Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. - Jason Vander Woude; Peter Dixon 002; Aduri Pavan; Jamie Radcliffe; N. V. Vinodchandran (CoRR, 2023)

Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma. - Jason Vander Woude; Peter Dixon 002; Aduri Pavan; Jamie Radcliffe; N. V. Vinodchandran (NeurIPS, 2024)