- A. Chattopadhyay, P. Dvořák, M. Koucký, B. Loff and S. Mukhopadhyay
**Lower Bounds for Elimination via Weak Regularity.**

-*34th Symposium on Theoretical Aspects of Computer Science*, STACS'17, pp. 21:1-21:14, 2017.

- S. Buss, V. Kabanets, A. Kolokolova, and M. Koucký.
**Expanders in VNC^1**

-*Conference on Innovations in Theoretical Computer Science*, ITCS'2017, pp. -, 2017.

- K. Arnsfelt Hansen, R. Ibsen-Jensen, M. Koucký.
**The Big Match in Small Space.**

-*9th International Symposium on Algorithmic Game Theory*, SAGT'2016, pp. 64-76, 2016,*best paper award*.

- D. Chakraborty, E. Goldenberg, M. Koucký.
**Streaming algorithms for embedding and computing edit distance in the low distance regime.**

-*48th Annual ACM Symposium on Theory of Computing*, STOC'16, pp. 712-725.

- P. Dvořák and T. Valla.
**Automorphisms of the Cube.**

-*22nd International Conference on Computing and Combinatorics*, COCOON'2016, pp. 405-416, 2016.

- M. Koucký.
**Catalytic computation.**

-*Bulletin of the EATCS*118 (2016).

- Z. Dvořák, S. Norin.
**Strongly sublinear separators and polynomial expansion.**

- SIAM J. Discrete Math. 30 (2016), 1095-1101.

- H. Buhrman, M. Koucký, B. Loff, F. Speelman.
**Catalytic Space: Non-determinism and Hierarchy.**

-*33rd Symposium on Theoretical Aspects of Computer Science*, STACS'16, pp. 24:1-24:13, 2016.

- J. Bulánek, M. Koucký, and M. Saks.
**Tight lower bounds for the online labeling problem.**

-*SIAM Journal on Computing*, 44(6):1765-1797, 2015.

- M. Agrawal, D. Chakraborty, D. Das, S. Nandakumar.
**Dimension, Pseudorandomness and Extraction of Pseudorandomness.**

-*35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science*, FSTTCS 2015, pp. 221-235, 2015.

- J.Gilmer, M.Koucký, M. Saks.
**A New Approach to the Sensitivity Conjecture.**

-*Conference on Innovations in Theoretical Computer Science*, ITCS'2015, pp. 247-254, 2015.

- H. Buhrman, E. Cleve, M. Koucký, B. Loff, F. Speelman.
**Computing with a full memory: Catalytic space.**

-*46th Annual ACM Symposium on Theory of Computing*, STOC'14, pp. 857-866, 2014.

### Preprints

- A. Chattopadhyay, M. Koucký, B. Loff and S. Mukhopadhyay
**Composition and Simulation Theorems via Pseudo-random Properties.**

- ECCC Tech Rep. TR17-14, 2017.

- D. Chakraborty, E. Goldenberg, M. Koucký.
**Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees.**

- arXiv:1607.03718, 2016.

- V. Girard, M. Koucký, P. McKenzie.
**Nonuniform catalytic space and the direct sum for space.**

- ECCC Tech Rep. TR15-138, 2015.

- Z. Dvořák, L. Yepremyan.
**Complete graph immersions and minimum degree.**

- arXiv::1512.00513, 2015.

- R. David, E. Goldenberg, R. Krauthgamer.
**Local Reconstruction of Low-Rank Matrices and Subspaces.**

- ECCC Tech Rep. TR15-128, 2015.

- D. Chakraborty.
**Information Complexity for Multiparty Communication.**

- ECCC Tech Rep. TR14-132, 2015.

### Thesis

- F. Hlásek.
**Bounds on existence of odd and unique expanders.**

- Master Thesis, Charles University, 2015.

The research leading to these results has received funding from the European Research Council under the European Union's Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 616787. |