default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Loff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Sepehr Assadi, Prantar Ghosh
, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC 2024: 7:1-7:16- [c19]Bruno Loff, Mateusz Skomra:
Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. ICALP 2024: 147:1-147:16 - [i19]Bruno Loff, Mateusz Skomra:
Smoothed analysis of deterministic discounted and mean-payoff games. CoRR abs/2402.03975 (2024) - [i18]Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CoRR abs/2405.14835 (2024) - [i17]Pavel Dvorák, Bruno Loff, Suhail Sherif:
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. CoRR abs/2409.04592 (2024) - [i16]Bruno Loff, Alexey Milovanov:
The hardness of decision tree complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 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
- [c16]Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-Round Communication Complexity. CCC 2021: 31:1-31:30 - [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) - [i13]Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-round Communication Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j10]Bruno Loff, Nelma Moreira, Rogério Reis:
The computational power of parsing expression grammars. J. Comput. Syst. Sci. 111: 1-21 (2020) - [c15]Rahul Ilango, Bruno Loff, Igor C. Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. CCC 2020: 22:1-22:36 - [c14]Pavel Dvorák, Bruno Loff:
Lower Bounds for Semi-adaptive Data Structures via Corruption. FSTTCS 2020: 20:1-20:15 - [i12]Pavel Dvorák, Bruno Loff:
Lower Bounds for Semi-adaptive Data Structures via Corruption. CoRR abs/2005.02238 (2020) - [i11]Rahul Ilango, Bruno Loff, Igor Carboni Oliveira:
NP-Hardness of Circuit Minimization for Multi-Output Functions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j9]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Theorems via Pseudo-random Properties. Comput. Complex. 28(4): 617-659 (2019) - [c13]Bruno Loff, Sagnik Mukhopadhyay:
Lifting Theorems for Equality. STACS 2019: 50:1-50:19 - [i10]Bruno Loff, Nelma Moreira, Rogério Reis:
The computational power of parsing expression grammars. CoRR abs/1902.08272 (2019) - 2018
- [j8]Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. 62(1): 116-135 (2018) - [c12]Bruno Loff, Nelma Moreira, Rogério Reis:
The Computational Power of Parsing Expression Grammars. DLT 2018: 491-502 - [c11]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation beats richness: new data-structure lower bounds. STOC 2018: 1013-1020 - [i9]Bruno Loff, Sagnik Mukhopadhyay:
Lifting Theorems for Equality. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c10]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. STACS 2017: 21:1-21:14 - [i8]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Theorems via Pseudorandom Properties. CoRR abs/1704.06807 (2017) - [i7]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Composition and Simulation Theorems via Pseudo-random Properties. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Simulation Beats Richness: New Data-Structure Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 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 - [i5]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. Electron. Colloquium Comput. Complex. TR16 (2016) - 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
- [j4]Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem:
Monotonicity Constraints in Characterizations of PSPACE. J. Log. Comput. 22(2): 179-195 (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
2000 – 2009
- 2009
- [j3]José Félix Costa, Bruno Loff, Jerzy Mycka:
A foundation for real recursive function theory. Ann. Pure Appl. Log. 160(3): 255-288 (2009) - [j2]Bruno Loff, José Félix Costa:
Five Views of Hypercomputation. Int. J. Unconv. Comput. 5(3-4): 193-207 (2009) - [i1]Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff:
Derandomizing from Random Strings. CoRR abs/0912.3162 (2009) - 2008
- [c3]Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker:
On the Complexity of Measurement in Classical Physics. TAMC 2008: 20-30 - [c2]Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker:
Oracles and Advice as Measurements. UC 2008: 33-50 - 2007
- [j1]Bruno Loff, José Félix Costa, Jerzy Mycka:
Computability on reals, infinite limits and differential equations. Appl. Math. Comput. 191(2): 353-371 (2007) - [c1]José Félix Costa, Bruno Loff, Jerzy Mycka:
The New Promise of Analog Computation. CiE 2007: 189-195
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-10 21:13 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:
