1
TITLE: Lower Bounds for Semi-adaptive Data Structures via Corruption
AUTHORS: Pavel Dvorák; Bruno Loff ;
SOURCE: CoRR, VOLUME: abs/2005.02238, PUBLISHED: 2020
INDEXED IN: DBLP
IN MY: ORCID | DBLP
2
TITLE: NP-Hardness of Circuit Minimization for Multi-Output Functions
AUTHORS: Rahul Ilango; Bruno Loff ; Igor Carboni Oliveira;
SOURCE: Electronic Colloquium on Computational Complexity (ECCC), VOLUME: 27, PUBLISHED: 2020
INDEXED IN: DBLP
IN MY: ORCID | DBLP
3
TITLE: NP-Hardness of Circuit Minimization for Multi-Output Functions
AUTHORS: Rahul Ilango; Bruno Loff ; Igor Carboni Oliveira;
SOURCE: 35th Computational Complexity Conference, CCC 2020 in 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., VOLUME: 169, PUBLISHED: 2020
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
4
TITLE: The computational power of parsing expression grammars
AUTHORS: Bruno Loff ; Nelma Moreira ; Rogerio Reis ;
SOURCE: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, VOLUME: 111, PUBLISHED: 2020
INDEXED IN: Scopus WOS DBLP CrossRef
IN MY: ORCID | DBLP
5
TITLE: Lifting Theorems for Equality
AUTHORS: Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: 36th International Symposium on Theoretical Aspects of Computer Science (STACS) in 36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), VOLUME: 126, PUBLISHED: 2019
INDEXED IN: WOS DBLP
IN MY: ORCID | DBLP
6
TITLE: Simulation Theorems via Pseudo-random Properties  Full Text
AUTHORS: Arkadev Chattopadhyay; Michal Koucky; Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: COMPUTATIONAL COMPLEXITY, VOLUME: 28, ISSUE: 4, PUBLISHED: 2019
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
7
TITLE: Simulation Theorems via Pseudo-random Properties
AUTHORS: Arkadev Chattopadhyay; Michal Koucký; Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: Comput. Complex., VOLUME: 28, ISSUE: 4, PUBLISHED: 2019
INDEXED IN: DBLP
IN MY: ORCID | DBLP
8
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman;
SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, ISSUE: 1, PUBLISHED: 2018
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
9
TITLE: Simulation Beats Richness: New Data-Structure Lower Bounds
AUTHORS: Arkadev Chattopadhyay; Michal Koucky; Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC) in STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, PUBLISHED: 2018
INDEXED IN: Scopus WOS DBLP CrossRef
IN MY: ORCID | DBLP
10
TITLE: The Computational Power of Parsing Expression Grammars
AUTHORS: Bruno Loff ; Nelma Moreira ; Rogério Reis ;
SOURCE: 22nd International Conference on Developments in Language Theory, DLT 2018 in Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, VOLUME: 11088, PUBLISHED: 2018
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
Page 1 of 3. Total results: 30.