Stanislav Zák

Publication Activity (10 Years)

Years Active: 1979-2021
Publications (10 Years): 4

Top Topics

Top Venues

Fundam. Informaticae

Electron. Colloquium Comput. Complex.

Publications

Jirí Síma, Stanislav Zák
A polynomial time construction of a hitting set for read-once branching programs of width 3. CoRR (2021)
Jirí Síma, Stanislav Zák
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Fundam. Informaticae 184 (4) (2021)
Stanislav Zák
A Logical Characteristic of Read-Once Branching Programs. Electron. Colloquium Comput. Complex. 26 (2019)
Jirí Síma, Stanislav Zák
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. Fundam. Informaticae 152 (4) (2017)
Stanislav Zák
Inherent logic and complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Stanislav Zák, Jirí Síma
A Turing Machine Distance Hierarchy. LATA (2013)
Jirí Síma, Stanislav Zák
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). SOFSEM (2012)
Jirí Síma, Stanislav Zák
-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. CSR (2011)
Jirí Síma, Stanislav Zák
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Electron. Colloquium Comput. Complex. 17 (2010)
Jirí Síma, Stanislav Zák
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. SOFSEM (1) (2007)
Stasys Jukna, Stanislav Zák
On uncertainty versus size in branching programs. Theor. Comput. Sci. 290 (3) (2003)
Stanislav Zák
A Sharp Separation of Sublogarithmic Space Complexity Classes. Comput. Artif. Intell. 21 (6) (2002)
Stasys Jukna, Stanislav Zák
On Uncertainty versus Size in Branching Programs Electron. Colloquium Comput. Complex. 8 (39) (2001)
Stasys Jukna, Stanislav Zák
Some Notes on the Information Flow in Read-Once Branching Programs. SOFSEM (2000)
Petr Savický, Stanislav Zák
A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theor. Comput. Sci. 238 (1-2) (2000)
Stasys Jukna, Stanislav Zák
On Branching Programs With Bounded Uncertainty Electron. Colloquium Comput. Complex. 5 (30) (1998)
Stasys Jukna, Stanislav Zák
On Branching Programs With Bounded Uncertainty (Extended Abstract). ICALP (1998)
Stanislav Zák
A subexponential lower bound for branching programs restricted with regard to some semantic aspects Electron. Colloquium Comput. Complex. 4 (50) (1997)
Petr Savický, Stanislav Zák
A Hierarchy for (1, +k)-Branching Programs with Respect of k. MFCS (1997)
Petr Savický, Stanislav Zák
A Lower Bound on Branching Programs Reading Some Bits Twice. Theor. Comput. Sci. 172 (1-2) (1997)
Petr Savický, Stanislav Zák
A large lower bound for 1-branching programs Electron. Colloquium Comput. Complex. 3 (36) (1996)
Petr Savický, Stanislav Zák
A hierarchy for (1,+k)-branching programs with respect to k Electron. Colloquium Comput. Complex. 3 (50) (1996)
Stanislav Zák
A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. MFCS (1995)
Stanislav Zák
An Exponential Lower Bound for Real-Time Branching Programs Inf. Control. 71 (1/2) (1986)
Stanislav Zák, Kai Hwang
Polynomial Division on Systolic Arrays. IEEE Trans. Computers 34 (6) (1985)
Stanislav Zák
An Exponential Lower Bound for One-Time-Only Branching Programs. MFCS (1984)
Stanislav Zák
A Turing Machine Time Hierarchy. Theor. Comput. Sci. 26 (1983)
Stanislav Zák
A Turing machine space hierarchy. Kybernetika 15 (2) (1979)
Stanislav Zák
A Turing Machine Oracle Hierarchy. MFCS (1979)