Search results
- 1.0465743 - MÚ 2017 RIV US eng J - Journal Article
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman’s theorem in interactive information complexity.
Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : communication complexity * information complexity * information theory
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Permanent Link: http://hdl.handle.net/11104/0264183File Download Size Commentary Version Access Koucky.pdf 4 630.8 KB Publisher’s postprint require - 2.0430344 - MÚ 2015 RIV US eng J - Journal Article
Ada, A. - Chattopadhyay, S. - Cook, S.A. - Fontes, L. - Koucký, Michal - Pitassi, T.
The hardness of being private.
ACM Transactions on Computation Theory. Roč. 6, č. 1 (2014), s. 1. ISSN 1942-3454
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : approximate privacy * communication complexity * information theory
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=2600088.2567671
Permanent Link: http://hdl.handle.net/11104/0235297File Download Size Commentary Version Access Koucky.pdf 3 191.8 KB Publisher’s postprint require - 3.0422134 - MÚ 2014 RIV US eng J - Journal Article
Gál, A. - Hansen, A. K. - Koucký, Michal - Pudlák, Pavel - Viola, E.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
IEEE Transactions on Information Theory. Roč. 59, č. 10 (2013), s. 6611-6627. ISSN 0018-9448. E-ISSN 1557-9654
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : bounded-depth circuits * error-correcting codes * hashing
Subject RIV: BA - General Mathematics
Impact factor: 2.650, year: 2013
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6578188
Permanent Link: http://hdl.handle.net/11104/0228346File Download Size Commentary Version Access Koucky.pdf 17 4.5 MB Publisher’s postprint require - 4.0369986 - MÚ 2012 RIV GB eng J - Journal Article
Alon, N. - Avin, Ch. - Koucký, Michal - Kozma, G. - Lotker, Z. - Tuttle, M.R.
Many random walks are faster than one.
Combinatorics Probability & Computing. Roč. 20, č. 4 (2011), s. 481-502. ISSN 0963-5483. E-ISSN 1469-2163
R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : multiple random walks * parallel random walks
Subject RIV: BA - General Mathematics
Impact factor: 0.778, year: 2011
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8280727
Permanent Link: http://hdl.handle.net/11104/0203914File Download Size Commentary Version Access Koucky1.pdf 2 300.4 KB Author’s postprint require - 5.0352607 - MÚ 2011 RIV US eng J - Journal Article
Allender, E. - Koucký, Michal - Ronneburger, D. - Roy, S.
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory.
Journal of Computer and System Sciences. Roč. 77, č. 1 (2011), s. 14-40. ISSN 0022-0000. E-ISSN 1090-2724
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit complexity * Distinguishing complexity * FewEXP * Formula size * Kolmogorov complexity
Subject RIV: BA - General Mathematics
Impact factor: 1.157, year: 2011
http://www.sciencedirect.com/science/article/pii/S0022000010000887
Permanent Link: http://hdl.handle.net/11104/0192081File Download Size Commentary Version Access Koucky.pdf 1 404.2 KB Publisher’s postprint require - 6.0352519 - MÚ 2011 RIV US eng J - Journal Article
Buhrman, H. - Fortnow, L. - Koucký, Michal - Rogers, J.D. - Vereshchagin, N.K.
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Theory of Computing Systems. Roč. 46, č. 1 (2010), s. 143-156. ISSN 1432-4350. E-ISSN 1433-0490.
[2nd International Computer Science Symposium in Russia (CSR 2007). Ekaterinburg, 03.09.2007-07.09.2007]
R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : one-way functions * polynomial hierarchy * Kolmogorov generic oracles
Subject RIV: BA - General Mathematics
Impact factor: 0.600, year: 2010
http://link.springer.com/article/10.1007%2Fs00224-008-9160-8
Permanent Link: http://hdl.handle.net/11104/0192010File Download Size Commentary Version Access Koucky2.pdf 1 382.5 KB Publisher’s postprint require - 7.0352511 - MÚ 2011 RIV US eng J - Journal Article
Allender, E. - Koucký, Michal
Amplifying lower bounds by means of self-reducibility.
Journal of the ACM. Roč. 57, č. 3 (2010), s. 1-36. ISSN 0004-5411. E-ISSN 1557-735X
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit Complexity * Lower Bounds * Natural Proofs * Self-Reducibility * Time-Space Tradeoffs
Subject RIV: BA - General Mathematics
Impact factor: 3.375, year: 2010
http://dl.acm.org/citation.cfm?doid=1706591.1706594
Permanent Link: http://hdl.handle.net/11104/0192003File Download Size Commentary Version Access Koucky.pdf 1 249.6 KB Author’s postprint require - 8.0352500 - MÚ 2011 RIV CH eng J - Journal Article
Hansen, A. K. - Koucký, Michal
A New Characterization of ACC(0) and Probabilistic CC0.
Computational Complexity. Roč. 19, č. 2 (2010), s. 211-234. ISSN 1016-3328. E-ISSN 1420-8954.
[24th Annual IEEE Conference on Computational Complexity. Paris, 15.07.2009-18.07.2009]
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded depth circuits * counting circuits * arithmetic circuits * complexity classes
Subject RIV: BA - General Mathematics
Impact factor: 1.450, year: 2010
http://link.springer.com/article/10.1007%2Fs00037-010-0287-z
Permanent Link: http://hdl.handle.net/11104/0191994File Download Size Commentary Version Access Koucky3.pdf 1 539.5 KB Publisher’s postprint require - 9.0336039 - MÚ 2010 RIV US eng J - Journal Article
Koucký, Michal
Circuit complexity of regular languages.
Theory of Computing Systems. Roč. 45, č. 4 (2009), s. 865-879. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : regular languages * circuit complexity * upper and lower bounds
Subject RIV: BA - General Mathematics
Impact factor: 0.726, year: 2009
Permanent Link: http://hdl.handle.net/11104/0180367File Download Size Commentary Version Access Koucky2.pdf 1 323.5 KB Publisher’s postprint require - 10.0318538 - MÚ 2009 RIV US eng J - Journal Article
Gál, A. - Koucký, Michal - McKenzie, P.
Incremental Branching Programs.
[Inkrementální rozhodovací programy.]
Theory of Computing Systems. Roč. 43, č. 2 (2008), s. 159-184. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GP201/07/P276; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : branching programs * models of computation * lower bounds
Subject RIV: BA - General Mathematics
Impact factor: 0.766, year: 2008
Permanent Link: http://hdl.handle.net/11104/0167927File Download Size Commentary Version Access Koucky4.pdf 1 444.2 KB Publisher’s postprint require