Stanislav Zák

According to our database, Stanislav Zák authored at least 26 papers between 1979 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3.

Jirí Síma, Stanislav Zák

Fundam. Informaticae, 2021

2019

A Logical Characteristic of Read-Once Branching Programs.

Stanislav Zák

Electron. Colloquium Comput. Complex., 2019

2017

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity.

Jirí Síma, Stanislav Zák

Fundam. Informaticae, 2017

2015

Inherent logic and complexity.

Stanislav Zák

Electron. Colloquium Comput. Complex., 2015

2013

A Turing Machine Distance Hierarchy.

Stanislav Zák, Jirí Síma

Proceedings of the Language and Automata Theory and Applications, 2013

2012

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract).

Jirí Síma, Stanislav Zák

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011

Almost <i>k</i>-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs.

Jirí Síma, Stanislav Zák

Proceedings of the Computer Science - Theory and Applications, 2011

2007

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3.

Jirí Síma, Stanislav Zák

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2003

On uncertainty versus size in branching programs.

Stasys Jukna, Stanislav Zák

Theor. Comput. Sci., 2003

2002

A Sharp Separation of Sublogarithmic Space Complexity Classes.

Stanislav Zák

Comput. Artif. Intell., 2002

2000

A read-once lower bound and a (1, +k)-hierarchy for branching programs.

Petr Savický, Stanislav Zák

Theor. Comput. Sci., 2000

Some Notes on the Information Flow in Read-Once Branching Programs.

Stasys Jukna, Stanislav Zák

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

1998

On Branching Programs With Bounded Uncertainty

Stasys Jukna, Stanislav Zák

Electron. Colloquium Comput. Complex., 1998

On Branching Programs With Bounded Uncertainty (Extended Abstract).

Stasys Jukna, Stanislav Zák

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

A Lower Bound on Branching Programs Reading Some Bits Twice.

Petr Savický, Stanislav Zák

Theor. Comput. Sci., 1997

A subexponential lower bound for branching programs restricted with regard to some semantic aspects

Stanislav Zák

Electron. Colloquium Comput. Complex., 1997

A Hierarchy for (1, +k)-Branching Programs with Respect of k.

Petr Savický, Stanislav Zák

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

A hierarchy for (1,+k)-branching programs with respect to k

Petr Savický, Stanislav Zák

Electron. Colloquium Comput. Complex., 1996

A large lower bound for 1-branching programs

Petr Savický, Stanislav Zák

Electron. Colloquium Comput. Complex., 1996

1995

A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs.

Stanislav Zák

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1986

An Exponential Lower Bound for Real-Time Branching Programs

Stanislav Zák

Inf. Control., 1986

1985

Polynomial Division on Systolic Arrays.

Stanislav Zák, Kai Hwang

IEEE Trans. Computers, 1985

1984

An Exponential Lower Bound for One-Time-Only Branching Programs.

Stanislav Zák

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

A Turing Machine Time Hierarchy.

Stanislav Zák

Theor. Comput. Sci., 1983

1979

A Turing machine space hierarchy.

Stanislav Zák

Kybernetika, 1979

A Turing Machine Oracle Hierarchy.

Stanislav Zák

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979