Stanislav Zák

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