default search action
Falk Unger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j7]Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin
:
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica 81(1): 179-200 (2019) - [j6]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. SIAM J. Comput. 48(4): 1147-1195 (2019) - 2014
- [c9]Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger:
Noisy Interactive Quantum Communication. FOCS 2014: 296-305 - 2013
- [j5]Ben W. Reichardt, Falk Unger, Umesh V. Vazirani:
Classical command of quantum systems. Nat. 496(7446): 456-460 (2013) - [c8]Ben W. Reichardt, Falk Unger, Umesh V. Vazirani:
A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. ITCS 2013: 321-322 - 2012
- [j4]Lasse Leskelä, Falk Unger:
Stability of a spatial polling system with greedy myopic service. Ann. Oper. Res. 198(1): 165-183 (2012) - 2010
- [j3]Julia Kempe
Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. 10(5&6): 361-376 (2010) - [i4]Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin:
Sparse Selfreducible Sets and Nonuniform Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010) - [i3]Falk Unger:
Better gates can make fault-tolerant computation impossible. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c7]Falk Unger:
A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems. FOCS 2009: 221-229 - [i2]Falk Unger:
A Probabilistic Inequality with Applications to Threshold Direct-product Theorems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. 17(2): 282-299 (2008) - [j1]Falk Unger:
Noise Threshold for Universality of Two-Input Gates. IEEE Trans. Inf. Theory 54(8): 3693-3698 (2008) - [c6]Julia Kempe
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 - 2007
- [c5]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC 2007: 109-114 - [c4]Falk Unger:
Noise threshold for universality of 2-input gates. ISIT 2007: 1901-1905 - [i1]Falk Unger:
Noise threshold for universality of 2-input gates. CoRR abs/0711.0351 (2007) - 2006
- [c3]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger:
New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 - [c2]Harry Buhrman, Leen Torenvliet, Falk Unger:
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468 - 2005
- [c1]Falk Unger:
On Small Hard Leaf Languages. MFCS 2005: 781-792
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-10-07 21:20 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: