11
TITLE: Lower Bounds for Elimination via Weak Regularity
AUTHORS: Arkadev Chattopadhyay; Pavel Dvorák; Michal Koucký; Bruno Loff ; Sagnik Mukhopadhyay;
SOURCE: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017 in 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, VOLUME: 66, PUBLISHED: 2017
INDEXED IN: Scopus DBLP
IN MY: ORCID | DBLP
12
TITLE: Catalytic Space: Non-determinism and Hierarchy  Full Text
AUTHORS: Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman;
SOURCE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, ISSUE: 1, PUBLISHED: 2016
INDEXED IN: Scopus DBLP CrossRef: 4
IN MY: ORCID | DBLP
13
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
SOURCE: Algorithmica, VOLUME: 76, ISSUE: 3, PUBLISHED: 2016
INDEXED IN: Scopus DBLP CrossRef: 3
IN MY: ORCID | DBLP
14
TITLE: Hardness of Approximation for Knapsack Problems  Full Text
AUTHORS: Harry Buhrman; Bruno Loff ; Leen Torenvliet;
SOURCE: Theory Comput. Syst., VOLUME: 56, ISSUE: 2, PUBLISHED: 2015
INDEXED IN: Scopus DBLP CrossRef: 1
IN MY: ORCID | DBLP
15
TITLE: Computing with a full memory: catalytic space
AUTHORS: Harry Buhrman; Richard Cleve; Michal Koucký; Bruno Loff ; Florian Speelman;
SOURCE: 4th Annual ACM Symposium on Theory of Computing, STOC 2014 in Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, PUBLISHED: 2014
INDEXED IN: Scopus DBLP CrossRef: 6
IN MY: ORCID | DBLP
16
TITLE: Reductions to the set of random strings: The resource-bounded case PDF  Full Text
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
SOURCE: 37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012 in Logical Methods in Computer Science, VOLUME: 10, ISSUE: 3, PUBLISHED: 2014
INDEXED IN: Scopus DBLP arXiv CrossRef: 3
IN MY: ORCID | DBLP
17
TITLE: Learning Reductions to Sparse Sets
AUTHORS: Harry Buhrman; Lance Fortnow; John M Hitchcock; Bruno Loff ;
SOURCE: 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 in Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, VOLUME: 8087, PUBLISHED: 2013
INDEXED IN: Scopus DBLP CrossRef
IN MY: ORCID | DBLP
18
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTHORS: Joshua Brody; Harry Buhrman; Michal Koucký; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
SOURCE: 2013 IEEE Conference on Computational Complexity, CCC 2013 in Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, PUBLISHED: 2013
INDEXED IN: Scopus DBLP CrossRef: 11
IN MY: ORCID | DBLP
19
TITLE: Monotonicity Constraints in Characterizations of PSPACE
AUTHORS: Amir M Ben Amram; Bruno Loff ; Isabel Oitavem ;
SOURCE: JOURNAL OF LOGIC AND COMPUTATION, VOLUME: 22, ISSUE: 2, PUBLISHED: 2012
INDEXED IN: Scopus WOS DBLP CrossRef: 1
IN MY: ORCID | DBLP
20
TITLE: Reductions to the Set of Random Strings: The Resource-Bounded Case  Full Text
AUTHORS: Eric Allender; Harry Buhrman; Luke Friedman; Bruno Loff ;
SOURCE: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, VOLUME: 7464, ISSUE: 3, PUBLISHED: 2012
INDEXED IN: Scopus DBLP CrossRef: 3
IN MY: ORCID | DBLP
Page 2 of 3. Total results: 30.