| 2007 |
|---|
| 19 | EE | Jirí Síma,
Stanislav Zák:
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3.
SOFSEM (1) 2007: 522-531 |
| 2003 |
|---|
| 18 | | Stasys Jukna,
Stanislav Zák:
On uncertainty versus size in branching programs.
Theor. Comput. Sci. 290(3): 1851-1867 (2003) |
| 2002 |
|---|
| 17 | | Stanislav Zák:
A Sharp Separation of Sublogarithmic Space Complexity Classes.
Computers and Artificial Intelligence 21(6): (2002) |
| 2001 |
|---|
| 16 | EE | Stasys Jukna,
Stanislav Zák:
On Uncertainty versus Size in Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 8(39): (2001) |
| 2000 |
|---|
| 15 | EE | Stasys Jukna,
Stanislav Zák:
Some Notes on the Information Flow in Read-Once Branching Programs.
SOFSEM 2000: 356-364 |
| 14 | EE | Petr Savický,
Stanislav Zák:
A read-once lower bound and a (1, +k)-hierarchy for branching programs.
Theor. Comput. Sci. 238(1-2): 347-362 (2000) |
| 1998 |
|---|
| 13 | EE | Stasys Jukna,
Stanislav Zák:
On Branching Programs With Bounded Uncertainty (Extended Abstract).
ICALP 1998: 259-270 |
| 12 | EE | Stasys Jukna,
Stanislav Zák:
On Branching Programs With Bounded Uncertainty
Electronic Colloquium on Computational Complexity (ECCC) 5(30): (1998) |
| 1997 |
|---|
| 11 | | Petr Savický,
Stanislav Zák:
A Hierarchy for (1, +k)-Branching Programs with Respect of k.
MFCS 1997: 478-487 |
| 10 | EE | Stanislav Zák:
A subexponential lower bound for branching programs restricted with regard to some semantic aspects
Electronic Colloquium on Computational Complexity (ECCC) 4(50): (1997) |
| 9 | EE | Petr Savický,
Stanislav Zák:
A Lower Bound on Branching Programs Reading Some Bits Twice.
Theor. Comput. Sci. 172(1-2): 293-301 (1997) |
| 1996 |
|---|
| 8 | EE | Petr Savický,
Stanislav Zák:
A large lower bound for 1-branching programs
Electronic Colloquium on Computational Complexity (ECCC) 3(36): (1996) |
| 7 | EE | Petr Savický,
Stanislav Zák:
A hierarchy for (1,+k)-branching programs with respect to k
Electronic Colloquium on Computational Complexity (ECCC) 3(50): (1996) |
| 1995 |
|---|
| 6 | | Stanislav Zák:
A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs.
MFCS 1995: 319-325 |
| 1986 |
|---|
| 5 | | Stanislav Zák:
An Exponential Lower Bound for Real-Time Branching Programs
Information and Control 71(1/2): 87-94 (1986) |
| 1985 |
|---|
| 4 | | Stanislav Zák,
Kai Hwang:
Polynomial Division on Systolic Arrays.
IEEE Trans. Computers 34(6): 577-578 (1985) |
| 1984 |
|---|
| 3 | | Stanislav Zák:
An Exponential Lower Bound for One-Time-Only Branching Programs.
MFCS 1984: 562-566 |
| 1983 |
|---|
| 2 | | Stanislav Zák:
A Turing Machine Time Hierarchy.
Theor. Comput. Sci. 26: 327-333 (1983) |
| 1979 |
|---|
| 1 | | Stanislav Zák:
A Turing Machine Oracle Hierarchy.
MFCS 1979: 542-551 |
