N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker, and M.R. Tuttle.
Many random walks are faster than one. - Combinatorics Probability and Computing, 20(4):481-502, 2011.
- 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'08, pp. 119-128, 2008.
K. A. Hansen, M. Koucký, N. Lauritzen, P. B. Miltersen, and E. P. Tsigaridas.
Exact algorithms for solving stochastic games. - 43rd Annual ACM Symposium on Theory of Computing, STOC'11, pp. 205-214, 2011.
H. Buhrman, L. Fortnow, M. Koucký, and B. Loff.
Derandomizing from random strings. - 25th Annual Conference on Computational Complexity, CCC'10, pp. 58-63, 2010.
K. A. Hansen and M. Koucký.
A new characterization of ACC0 and probabilistic CC0. - Computational Complexity (special issue for CCC'09), 19:211-234, 2010.
- 24th Annual IEEE Conference on Computational Complexity, CCC'09, pp. 27-34, 2009.
M. Koucký.
Circuit complexity of regular languages. - Theory of Computing Systems, 45:865-879, 2009.
- Prelimary version an invited paper in Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, CiE'07, pp. 426-435, 2007.
H. Buhrman, L. Fortnow, M. Koucký, J. D. Rogers, and N. Vereshchagin.
Does the polynomial hierarchy collapse if onto functions are invertible? - Theory of Computing Systems (special issue for CSR'07), 46:143-156, 2009.
- Preliminary version: Inverting onto functions and polynomial hierarchy.Second International Symposium on Computer Science in Russia, CSR'07, pp. 92-103, 2007.
A. Gál, M. Koucký, and P. McKenzie.
Incremental branching programs. - Theory of Computing Systems (special issue for CSR'06), 43:159-184, 2008.
- First International Computer Science Symposium in Russia, CSR'06, pp. 178-190, 2006.
H. Buhrman, M. Christandl, M. Koucký, Z. Lotker, B. Patt-Shamir, and N. Vereshchagin.
High entropy random selection protocols. - 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX'07/RANDOM'07, pp. 366-379, 2007.
E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, and D. Ronneburger.
Power from random strings. - SIAM Journal on Computing, 35:1467-1493, 2006.
- 43rd Symposium on Foundations of Computer Science, FOCS'02, pp. 669-678, 2002.
E. Allender, M. Koucký, R. Ronneburger, and S. Roy.
Derandomization and distinguishing complexity. - 18th Annual IEEE Conference on Computational Complexity, CCC'03, pp. 209-220, 2003.
M. Koucký.
Universal traversal sequences with backtracking. - Journal of Computer and System Sciences (special issue for CCC'01), 65:717-726, 2002.
- 16th Annual Conference on Computational Complexity, CCC'01, pp. 21-26, 2001.
E. Allender, M. Koucký, D. Ronneburger, S. Roy, and V. Vinay.
Time-space tradeoffs in the counting hierarchy. - 16th Annual Conference on Computational Complexity, CCC'01, pp. 295-302, 2001.