| A Turing machine time hierarchy S Žák Theoretical Computer Science 26 (3), 327-333, 1983 | 186 | 1983 |
| An exponential lower bound for one-time-only branching programs S Žák International Symposium on Mathematical Foundations of Computer Science, 562-566, 1984 | 93 | 1984 |
| 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 | 30 | 2000 |
| 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 | 28 | 2011 |
| 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 | 19 | 1997 |
| A lower bound on branching programs reading some bits twice P Savický, S Žák Theoretical computer science 172 (1-2), 293-301, 1997 | 18 | 1997 |
| A superpolynomial lower bound for (1,+k(n))-branching programs S Žák Mathematical Foundations of Computer Science 1995: 20th International …, 1995 | 14 | 1995 |
| 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 | 11 | 2021 |
| A Turing machine space hierarchy S Žák Kybernetika 15 (2), (100)-121, 1979 | 10 | 1979 |
| On uncertainty versus size in branching programs S Jukna, S Žák Theoretical computer science 290 (3), 1851-1867, 2003 | 9 | 2003 |
| An exponential lower bound for real-time branching programs S Žák Information and control 71 (1-2), 87-94, 1986 | 9 | 1986 |
| 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 | 6 | 2000 |
| On branching programs with bounded uncertainty S Jukna, S Žák Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998 | 6 | 1998 |
| 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 | 5 | 2012 |
| 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 | 5 | 2007 |
| A turing machine oracle hierarchy S Žák Mathematical Foundations of Computer Science 1979: Proceedings, 8th …, 1979 | 5 | 1979 |
| A Turing Machine Distance Hierarchy S Žák, J Šíma Language and Automata Theory and Applications: 7th International Conference …, 2013 | 1 | 2013 |
| 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 |
