Follow
Stanislav Žák
Stanislav Žák
Institute of computer science, Czech Academy of Sciences
Verified email at cs.cas.cz
Title
Cited by
Cited by
Year
A Turing machine time hierarchy
S Žák
Theoretical Computer Science 26 (3), 327-333, 1983
1881983
An exponential lower bound for one-time-only branching programs
S Žák
International Symposium on Mathematical Foundations of Computer Science, 562-566, 1984
951984
A read-once lower bound and a (1,+ k)-hierarchy for branching programs
P Savický, S Žák
Theoretical Computer Science 238 (1-2), 347-362, 2000
312000
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
J Šíma, S Žák
International Computer Science Symposium in Russia, 120-133, 2011
282011
A hierarchy for (1, +k)-branching programs with respect to k
P Savický, S Žák
International Symposium on Mathematical Foundations of Computer Science, 478-487, 1997
191997
A lower bound on branching programs reading some bits twice
P Savický, S Žák
Theoretical computer science 172 (1-2), 293-301, 1997
181997
A superpolynomial lower bound for (1,+k(n))-branching programs
S Žák
Mathematical Foundations of Computer Science 1995: 20th International …, 1995
141995
A polynomial-time construction of a hitting set for read-once branching programs of width 3
J Šíma, S Žák
Fundamenta Informaticae 184 (4), 307-354, 2021
112021
On uncertainty versus size in branching programs
S Jukna, S Žák
Theoretical computer science 290 (3), 1851-1867, 2003
92003
An exponential lower bound for real-time branching programs
S Žák
Information and control 71 (1-2), 87-94, 1986
91986
A Turing machine space hierarchy
S Žák
Kybernetika 15 (2), (100)-121, 1979
91979
Some notes on the information flow in read-once branching programs
S Jukna, S Žák
SOFSEM 2000: Theory and Practice of Informatics: 27th Conference on Current …, 2000
62000
On branching programs with bounded uncertainty
S Jukna, S Žák
International Colloquium on Automata, Languages, and Programming, 259-270, 1998
61998
A sufficient condition for sets hitting the class of read-once branching programs of width 3
J Šíma, S Žák
SOFSEM 2012: Theory and Practice of Computer Science: 38th Conference on …, 2012
52012
A polynomial time constructible hitting set for restricted 1-branching programs of width 3
J Šíma, S Žák
SOFSEM 2007: Theory and Practice of Computer Science: 33rd Conference on …, 2007
52007
A turing machine oracle hierarchy
S Žák
Mathematical Foundations of Computer Science 1979: Proceedings, 8th …, 1979
51979
A Turing Machine Distance Hierarchy
S Žák, J Šíma
Language and Automata Theory and Applications: 7th International Conference …, 2013
12013
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity
J Šíma, S Žák
Fundamenta Informaticae 152 (4), 397-409, 2017
2017
Hovory s informatiky 2011
H Klímová, D Kuželová, JƎ Šíma, JƎ Wiedermann, S Žák
2011
A sharp separation of sublogarithmic space complexity classes
S Žák
Computing and informatics 21 (6), 617–624-617–624, 2002
2002
The system can't perform the operation now. Try again later.
Articles 1–20