Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Michal Koucky
AuthID:
R-00H-MKB
Publications
Confirmed
To Validate
Document Source:
All
Document Type:
All Document Types
Proceedings Paper (5)
Article (3)
Year Start - End:
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
-
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
Order:
Year Dsc
Year Asc
Cit. WOS Dsc
IF WOS Dsc
Cit. Scopus Dsc
IF Scopus Dsc
Title Asc
Title Dsc
Results:
10
20
30
40
50
Confirmed Publications: 8
1
TITLE:
Simulation Theorems via Pseudo-random Properties
AUTHORS:
Arkadev Chattopadhyay;
Koucky, Michal
;
Bruno Loff
; Sagnik Mukhopadhyay;
PUBLISHED:
2019
,
SOURCE:
Comput. Complex.,
VOLUME:
28,
ISSUE:
4
INDEXED IN:
DBLP
2
TITLE:
Catalytic Space: Non-determinism and Hierarchy
AUTHORS:
Harry Buhrman;
Koucky, Michal
;
Bruno Loff
;
Florian Speelman
;
PUBLISHED:
2018
,
SOURCE:
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016
in
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:
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
INDEXED IN:
Scopus
DBLP
4
TITLE:
Catalytic Space: Non-determinism and Hierarchy
Full Text
AUTHORS:
Harry Buhrman;
Koucky, Michal
;
Bruno Loff
;
Florian Speelman
;
PUBLISHED:
2016
,
SOURCE:
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France,
VOLUME:
47,
ISSUE:
1
INDEXED IN:
Scopus
DBLP
CrossRef
:
4
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
:
4
6
TITLE:
Computing with a full memory: catalytic space. catalytic space
AUTHORS:
Harry Buhrman;
Richard Cleve
;
Koucky, Michal
;
Bruno Loff
;
Florian Speelman
;
PUBLISHED:
2014
,
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
INDEXED IN:
Scopus
DBLP
CrossRef
:
8
7
TITLE:
Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTHORS:
Joshua Brody; Harry Buhrman;
Koucky, Michal
;
Bruno Loff
;
Florian Speelman
;
Nikolay K Vereshchagin
;
PUBLISHED:
2013
,
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
INDEXED IN:
Scopus
DBLP
CrossRef
:
10
8
TITLE:
Derandomizing from Random Strings
AUTHORS:
Harry Buhrman;
Fortnow, Lance
;
Koucky, Michal
;
Bruno Loff
;
PUBLISHED:
2010
,
SOURCE:
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
INDEXED IN:
Scopus
DBLP
CrossRef
:
6
Add to Marked List
Check All
Export
×
Publication Export Settings
BibTex
EndNote
APA
CSV
PDF
Export Preview
Print
×
Publication Print Settings
HTML
PDF
Print Preview
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service