default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLisa Yang 0001
Person information
- affiliation: Massachusetts Institute of Technology, CSAIL, Cambridge, MA, USA
Other persons with the same name
- Lisa Yang 0002 — Massachusetts Institute of Technology, Remote Sensing, Cambridge, MA, USA
- Lisa Yang 0003 — Intel Corporation, Folsom, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c5]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-local Game. STOC 2023: 1617-1628- 2022
- [c4]James Bartusek
, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CRYPTO (2) 2022: 195-211 - [i9]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. CoRR abs/2203.15877 (2022) - [i8]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CoRR abs/2206.14929 (2022) - [i7]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. IACR Cryptol. ePrint Arch. 2022: 400 (2022) - [i6]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 857 (2022) - 2020
- [c3]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. CRYPTO (3) 2020: 652-673
2010 – 2019
- 2019
- [j2]Yibo Gao, Zhaoqi Li, Thuy-Duong Vuong, Lisa Yang:
Toric Mutations in the dP2 Quiver and Subgraphs of the dP2 Brane Tiling. Electron. J. Comb. 26(2): 2 (2019) - [j1]Yibo Gao, Benjamin Krakoff, Lisa Yang:
The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes. Discret. Comput. Geom. 62(1): 209-238 (2019) - [c2]Justin Holmgren, Lisa Yang:
The parallel repetition of non-signaling games: counterexamples and dichotomy. STOC 2019: 185-192 - [c1]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
How to delegate computations publicly. STOC 2019: 1115-1124 - [i5]Yael Kalai, Omer Paneth, Lisa Yang:
How to Delegate Computations Publicly. IACR Cryptol. ePrint Arch. 2019: 603 (2019) - 2018
- [i4]Justin Holmgren, Lisa Yang:
Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem. Electron. Colloquium Comput. Complex. TR18 (2018) - [i3]Yael Kalai, Omer Paneth, Lisa Yang:
On Publicly Verifiable Delegation From Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 776 (2018) - 2017
- [i2]Justin Holmgren, Lisa Yang:
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games. Electron. Colloquium Comput. Complex. TR17 (2017) - [i1]Justin Holmgren, Lisa Yang:
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games. IACR Cryptol. ePrint Arch. 2017: 1138 (2017)
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-21 00:18 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:
