default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Slofstra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Kieran Mastel
, William Slofstra:
Two Prover Perfect Zero Knowledge for MIP. STOC 2024: 991-1002- [i5]Kieran Mastel, William Slofstra:
Two prover perfect zero knowledge for MIP. CoRR abs/2404.00926 (2024) - 2021
- [i4]Honghao Fu, Carl A. Miller, William Slofstra:
The membership problem for constant-sized quantum correlations is undecidable. CoRR abs/2101.11087 (2021)
2010 – 2019
- 2019
- [c3]Matthew Coudron, William Slofstra:
Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. CCC 2019: 25:1-25:20 - [c2]Alex Bredariol Grilo, William Slofstra, Henry Yuen:
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs. FOCS 2019: 611-635 - [i3]Alex Bredariol Grilo, William Slofstra, Henry Yuen:
Perfect zero knowledge for quantum multiprover interactive proofs. CoRR abs/1905.11280 (2019) - [i2]Matthew Coudron, William Slofstra:
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision. CoRR abs/1905.11635 (2019) - [i1]Alex Bredariol Grilo, William Slofstra, Henry Yuen:
Perfect zero knowledge for quantum multiprover interactive proofs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j5]Sara C. Billey, Matjaz Konvalinka, T. Kyle Petersen, William Slofstra, Bridget Eileen Tenner:
Parabolic Double Cosets in Coxeter Groups. Electron. J. Comb. 25(1): 1 (2018) - [j4]Edward Richmond, William Slofstra:
Smooth Schubert varieties in the affine flag variety of type Ã. Eur. J. Comb. 71: 125-138 (2018) - 2017
- [j3]Edward Richmond, William Slofstra:
Staircase diagrams and enumeration of smooth Schubert varieties. J. Comb. Theory A 150: 328-376 (2017) - 2010
- [j2]I. P. Goulden, William Slofstra:
Annular embeddings of permutations for arbitrary genus. J. Comb. Theory A 117(3): 272-288 (2010)
2000 – 2009
- 2008
- [j1]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. 17(2): 282-299 (2008) - 2007
- [c1]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC 2007: 109-114
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 2025-01-09 12:56 CET 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:
