- Some bounds for multiparty communication complexity of pointer jumping1996 | Faculty of Mathematics and Physics
- Lower Bounds for Elimination via Weak Regularity2017 | Faculty of Mathematics and Physics
- Generalized probabilistic theories and conic extensions of polytopes2015 | Faculty of Mathematics and Physics
- Towards a Reverse Newman's Theorem in Interactive Information Complexity2016 | Faculty of Mathematics and Physics
- Simulation Theorems via Pseudo-random Properties2019 | Faculty of Mathematics and Physics
- Randomized feasible interpolation and monotone circuits with a local oracle2018 | Faculty of Mathematics and Physics
- On Protocols for Monotone Feasible Interpolation2023 | Faculty of Mathematics and Physics
- A New Approach to the Sensitivity Conjecture2015 | Faculty of Mathematics and Physics
- A Communication Game Related to the Sensitivity Conjecture2017 | Faculty of Mathematics and Physics
- Simulation beats richness: new data-structure lower bounds2018 | Faculty of Mathematics and Physics
- Parallel Communicating Grammar Systems with Regular Control2009 | Faculty of Mathematics and Physics
- Parallel communicating grammar systems and analysis by reduction2008 | Faculty of Mathematics and Physics
- Parallel communicating grammar systems with regular control and skeleton preserving FRR automata2011 | Faculty of Mathematics and Physics
- The evolution of cooperative language: Analogies and homologies2017 | Faculty of Arts
- Extended formulations, nonnegative factorizations, and randomized communication protocols2015 | Faculty of Mathematics and Physics
- The Umbrian cave of Grotta Bella. The diachronic evolution of a meeting place2022 | Faculty of Arts