Stanislav Zk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
5
Active years
1979–2013
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2013 | LATA | A Turing Machine Distance Hierarchy. | Stanislav Zk, Jir Sma |
| 2012 | SOFSEM | A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). | Jir Sma, Stanislav Zk |
| 2011 | CSR | Almost | Jir Sma, Stanislav Zk |
| 2007 | SOFSEM | A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. | Jir Sma, Stanislav Zk |
| 2000 | SOFSEM | Some Notes on the Information Flow in Read-Once Branching Programs. | Stasys Jukna, Stanislav Zk |
| 1998 | ICALP | On Branching Programs With Bounded Uncertainty (Extended Abstract). | Stasys Jukna, Stanislav Zk |
| 1997 | MFCS | A Hierarchy for (1, +k)-Branching Programs with Respect of k. | Petr Savick, Stanislav Zk |
| 1995 | MFCS | A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. | Stanislav Zk |
| 1984 | MFCS | An Exponential Lower Bound for One-Time-Only Branching Programs. | Stanislav Zk |
| 1979 | MFCS | A Turing Machine Oracle Hierarchy. | Stanislav Zk |