Michal Koucky


AuthID: R-00H-MKB

Publicações Confirmadas: 8



1
TÍTULO: Simulation Theorems via Pseudo-random Properties
AUTORES: Arkadev Chattopadhyay; Koucky, Michal ; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLICAÇÃO: 2019, FONTE: Comput. Complex., VOLUME: 28, NÚMERO: 4
INDEXADO EM: DBLP
2
TÍTULO: Catalytic Space: Non-determinism and Hierarchy
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2018, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 in Theory Comput. Syst., VOLUME: 62, NÚMERO: 1
INDEXADO EM: Scopus DBLP
3
TÍTULO: Lower Bounds for Elimination via Weak Regularity
AUTORES: Arkadev Chattopadhyay; Pavel Dvorák; Koucky, Michal ; Bruno Loff ; Sagnik Mukhopadhyay;
PUBLICAÇÃO: 2017, FONTE: 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
INDEXADO EM: Scopus DBLP
4
TÍTULO: Catalytic Space: Non-determinism and Hierarchy  Full Text
AUTORES: Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2016, FONTE: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, VOLUME: 47, NÚMERO: 1
INDEXADO EM: Scopus DBLP CrossRef: 4
5
TÍTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity  Full Text
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLICAÇÃO: 2016, FONTE: Algorithmica, VOLUME: 76, NÚMERO: 3
INDEXADO EM: Scopus DBLP CrossRef: 4
6
TÍTULO: Computing with a full memory: catalytic space. catalytic space
AUTORES: Harry Buhrman; Richard Cleve; Koucky, Michal ; Bruno Loff ; Florian Speelman;
PUBLICAÇÃO: 2014, FONTE: 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
INDEXADO EM: Scopus DBLP CrossRef: 8
7
TÍTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLICAÇÃO: 2013, FONTE: 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
INDEXADO EM: Scopus DBLP CrossRef: 10
8
TÍTULO: Derandomizing from Random Strings
AUTORES: Harry Buhrman; Fortnow, Lance ; Koucky, Michal ; Bruno Loff ;
PUBLICAÇÃO: 2010, FONTE: 25th Annual IEEE Conference on Computational Complexity, CCC 2010 in Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010
INDEXADO EM: Scopus DBLP CrossRef: 6

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service