Остановите войну!
for scientists:
default search action
Bruno Loff
- > Home > Persons > Bruno Loff
Publications
- 2022
- [c18]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. ITCS 2022: 31:1-31:12 - [c17]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Memory Compression with Quantum Random-Access Gates. TQC 2022: 10:1-10:19 - [i15]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Memory Compression with Quantum Random-Access Gates. CoRR abs/2203.05599 (2022) - 2021
- [i14]Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. CoRR abs/2106.02005 (2021) - 2018
- [j8]Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. 62(1): 116-135 (2018) - 2016
- [j7]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76(3): 749-781 (2016) - [c9]Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. STACS 2016: 24:1-24:13 - 2015
- [j6]Harry Buhrman, Bruno Loff, Leen Torenvliet:
Hardness of Approximation for Knapsack Problems. Theory Comput. Syst. 56(2): 372-393 (2015) - 2014
- [j5]Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff:
Reductions to the set of random strings: The resource-bounded case. Log. Methods Comput. Sci. 10(3) (2014) - [c8]Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman:
Computing with a full memory: catalytic space. STOC 2014: 857-866 - [i4]Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman:
Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c7]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC 2013: 24-33 - [c6]Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff:
Learning Reductions to Sparse Sets. MFCS 2013: 243-253 - 2012
- [c5]Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff:
Reductions to the Set of Random Strings: The Resource-Bounded Case. MFCS 2012: 88-99 - [i3]Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff:
Reductions to the set of random strings: the resource-bounded case. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [c4]Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff:
Derandomizing from Random Strings. CCC 2010: 58-63 - 2009
- [i1]Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff:
Derandomizing from Random Strings. CoRR abs/0912.3162 (2009)
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-21 17:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint