A Turing Machine Oracle Hierarchy. - Stanislav Zák (MFCS, 1979)

A Turing machine space hierarchy. - Stanislav Zák (Kybernetika, 1979)

A Turing Machine Time Hierarchy. - Stanislav Zák (Theor. Comput. Sci., 1983)

An Exponential Lower Bound for One-Time-Only Branching Programs. - Stanislav Zák (MFCS, 1984)

Polynomial Division on Systolic Arrays. - Stanislav Zák; Kai Hwang 001 (IEEE Trans. Computers, 1985)

An Exponential Lower Bound for Real-Time Branching Programs - Stanislav Zák (Inf. Control., 1986)

A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. - Stanislav Zák (MFCS, 1995)

A large lower bound for 1-branching programs - Petr Savický; Stanislav Zák (Electron. Colloquium Comput. Complex., 1996)

A hierarchy for (1,+k)-branching programs with respect to k - Petr Savický; Stanislav Zák (Electron. Colloquium Comput. Complex., 1996)

A Hierarchy for (1, +k)-Branching Programs with Respect of k. - Petr Savický; Stanislav Zák (MFCS, 1997)

A subexponential lower bound for branching programs restricted with regard to some semantic aspects - Stanislav Zák (Electron. Colloquium Comput. Complex., 1997)

A Lower Bound on Branching Programs Reading Some Bits Twice. - Petr Savický; Stanislav Zák (Theor. Comput. Sci., 1997)

On Branching Programs With Bounded Uncertainty (Extended Abstract). - Stasys Jukna; Stanislav Zák (ICALP, 1998)

On Branching Programs With Bounded Uncertainty - Stasys Jukna; Stanislav Zák (Electron. Colloquium Comput. Complex., 1998)

Some Notes on the Information Flow in Read-Once Branching Programs. - Stasys Jukna; Stanislav Zák (SOFSEM, 2000)

A read-once lower bound and a (1, +k)-hierarchy for branching programs. - Petr Savický; Stanislav Zák (Theor. Comput. Sci., 2000)

A Sharp Separation of Sublogarithmic Space Complexity Classes. - Stanislav Zák (Comput. Artif. Intell., 2002)

On uncertainty versus size in branching programs. - Stasys Jukna; Stanislav Zák (Theor. Comput. Sci., 2003)

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. - Jirí Síma; Stanislav Zák (SOFSEM (1), 2007)

Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. - Jirí Síma; Stanislav Zák (CSR, 2011)

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). - Jirí Síma; Stanislav Zák (SOFSEM, 2012)

A Turing Machine Distance Hierarchy. - Stanislav Zák; Jirí Síma (LATA, 2013)

Inherent logic and complexity. - Stanislav Zák (Electron. Colloquium Comput. Complex., 2015)

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. - Jirí Síma; Stanislav Zák (Fundam. Informaticae, 2017)

A Logical Characteristic of Read-Once Branching Programs. - Stanislav Zák (Electron. Colloquium Comput. Complex., 2019)

A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. - Jirí Síma; Stanislav Zák (Fundam. Informaticae, 2021)