Stanislav Žák
Stanislav Žák
Institute of computer science, Czech Academy of Sciences
E-mailová adresa ověřena na: cs.cas.cz
Název
Citace
Citace
Rok
A Turing machine time hierarchy
S Žák
Theoretical Computer Science 26 (3), 327-333, 1983
1431983
An exponential lower bound for one-time-only branching programs
S Žák
International Symposium on Mathematical Foundations of Computer Science, 562-566, 1984
851984
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
282000
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
172011
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
151997
A lower bound on branching programs reading some bits twice
P Savický, S Žák
Theoretical Computer Science 172 (1-2), 293-301, 1997
151997
A superpolynomial lower bound for (1,+k(n))-branching programs
S Žák
International Symposium on Mathematical Foundations of Computer Science, 319-325, 1995
141995
On uncertainty versus size in branching programs
S Jukna, S Žák
Theoretical computer science 290 (3), 1851-1867, 2003
92003
A Turing machine space hierarchy
S Žák
Kybernetika 15 (2), (100)-121, 1979
91979
An exponential lower bound for real-time branching programs
S Zák
Information and control 71 (1-2), 87-94, 1986
71986
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
International Conference on Current Trends in Theory and Practice of …, 2012
52012
A polynomial time constructible hitting set for restricted 1-branching programs of width 3
J Šíma, S Žák
International Conference on Current Trends in Theory and Practice of …, 2007
52007
Some notes on the information flow in read-once branching programs
S Jukna, S Žák
International Conference on Current Trends in Theory and Practice of …, 2000
52000
A Turing machine oracle hierarchy
S Žák
International Symposium on Mathematical Foundations of Computer Science, 542-551, 1979
51979
A sharp separation below log (n)
S Žák
Tech. Rep. 655/1995, Inst. Comput. Sci., Czech Academy of Sciences, 1995
21995
A Turing Machine Distance Hierarchy
S Žák, J Šíma
International Conference on Language and Automata Theory and Applications …, 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
A sharp separation of sublogarithmic space complexity classes
S Žák
Computing and informatics 21 (6), 617–624, 2012
2012
Hovory s informatiky 2011
H Klímová, D Kuželová, JƎ Šíma, JƎ Wiedermann, S Žák
2011
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20