default search action
Peter Dixon 0002
Person information
- affiliation: Iowa State University, Ames, USA
Other persons with the same name
- Peter Dixon 0001 — Queen Mary University of London, School of English and Drama, UK
- Peter Dixon 0003 — California Institute of Technology, Jet Propulsion Laboratory, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c6]Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. NeurIPS 2023 - [i7]Peter Dixon, A. Pavan
, Jason Vander Woude, N. V. Vinodchandran:
List and Certificate Complexities in Replicable Learning. CoRR abs/2304.02240 (2023) - [i6]Jason Vander Woude, Peter Dixon, Aduri Pavan
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma. CoRR abs/2304.04837 (2023) - 2022
- [c5]Peter Dixon, Aduri Pavan
Pseudodeterminism: promises and lowerbounds. STOC 2022: 1552-1565 - [i5]Jason Vander Woude, Peter Dixon, Aduri Pavan, Jamie Radcliffe, N. V. Vinodchandran:
Geometry of Rounding. CoRR abs/2211.02694 (2022) - [i4]Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran:
The Geometry of Rounding. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c4]Peter Dixon, A. Pavan
Complete Problems for Multi-Pseudodeterministic Computations. ITCS 2021: 66:1-66:16 - [i3]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. CoRR abs/2103.08589 (2021) - [i2]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Peter Dixon, Sutanu Gayen, Aduri Pavan
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. TCC (1) 2020: 684-704 - [i1]Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran:
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. 2020: 768 (2020)
2010 – 2019
- 2018
- [c2]Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
On Pseudodeterministic Approximation Algorithms. MFCS 2018: 61:1-61:11 - 2016
- [c1]Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS 2016: 31:1-31:7
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: