Publikace
- A Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3 (2021)
- A Logical Characteristic of Read-Once Branching Programs (2019)
- A Logical Characteristic of Read-Once Branching Programs (2019)
- Inherent Logic and Complexity (2015)
- Inherent Logic and Complexity (2014)
- Hovory s informatiky 2012. Sborník studií (2012)
- A Lower Bound Method for Branching Programs and Its Application (2012)
- Hovory s informatiky 2011. Sborník studií (2011)
- Hovory s informatiky (2011)
- Hovory s informatiky 2010. Sborník studií (2010)
- A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (2010)
- A Characterization of Hitting Sets for 1-Branching Programs of Width 3 (Revised Version) (2009)
- Branching Programs: Paradoxes in the Method (2009)
- A Characterization of Hitting Sets for 1 Branching Programs of Width 3 (2008)
- A Lower Bound Technique for Restricted Branching Programs (version G) (2007)
- A Superpolynomial Lower Bound for a Class of Restricted Branching Programs (2007)
- A Lower Bound Technique for Restricted Branching Programs (version F) (2006)
- An Explicit Polynomial Size Hitting Set for Restricted 1-Branching Programs Width 3 (2005)
- On Uncertainty versus Size in Branching Programs (2003)
- A Subexponential Lower Bound on Read-once Branching Programs by a New Argument (2000)
- A Read-once Lower Bound and a (1,+k) - Hierarchy for Branching Programs (2000)
- Upper Bounds for Gentle Branching Programs (1999)
- A Subexponential Lower Bounds for Branching Programs Restricted with Regard to Some Semantic Aspects (1997)
- A Lower Bound on Branching Programs Reading Some Bits Twice (1997)
- The Turing Machine Space Measure Revised at the Occasion of Sublog Separation (1997)
- A Hierarchy for (1,+k)-branching programs with respect to k (1996)
- A Large Lower Bound for 1-branching Programs (1996)
- A Superpolynomial Lower Bound for (1,+k(n))-Branching Programs (1995)
- A Lower Bound on Branching Programs Reading Some Bits Twice (1995)
- A Sharp Separation Below Log (1995)
- The Computational Power of Bi-Greedy In-Branching Programs, and its Bounds (1994)