1
TITLE: Simulation Theorems via Pseudo-random Properties
AUTHORS: Chattopadhyay, A; Koucky, Michal ; Loff, B ; Mukhopadhyay, S;
PUBLISHED: 2019, SOURCE: COMPUTATIONAL COMPLEXITY, VOLUME: 28, ISSUE: 4
INDEXED IN: Scopus WOS DBLP CrossRef: 12
2
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2018, SOURCE: Theory Comput. Syst., VOLUME: 62, ISSUE: 1
INDEXED IN: Scopus DBLP
3
TITLE: Lower Bounds for Elimination via Weak Regularity
AUTHORS: Arkadev Chattopadhyay; Pavel Dvorák; Koucky, Michal ; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLISHED: 2017, SOURCE: STACS, VOLUME: 66
INDEXED IN: Scopus DBLP
4
TITLE: Catalytic Space: Non-determinism and Hierarchy
AUTHORS: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2016, SOURCE: STACS, VOLUME: 62, ISSUE: 1
INDEXED IN: Scopus DBLP CrossRef: 12
5
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLISHED: 2016, SOURCE: Algorithmica, VOLUME: 76, ISSUE: 3
INDEXED IN: Scopus DBLP CrossRef: 5
6
TITLE: Computing with a full memory: catalytic space. catalytic space  Full Text
AUTHORS: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLISHED: 2014, SOURCE: STOC
INDEXED IN: Scopus DBLP CrossRef: 21
7
TITLE: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTHORS: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLISHED: 2013, SOURCE: CCC
INDEXED IN: Scopus DBLP CrossRef: 10
8
TITLE: Derandomizing from Random Strings  Full Text
AUTHORS: Harry Buhrman; Fortnow, Lance ; Koucky, Michal ; Bruno Loff ;
PUBLISHED: 2010, SOURCE: CCC
INDEXED IN: Scopus DBLP CrossRef: 7