The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stanislav Zák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stasys Jukna, Stanislav Zák
    On Branching Programs With Bounded Uncertainty (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:259-270 [Conf]
  2. Stanislav Zák
    A Turing Machine Oracle Hierarchy. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:542-551 [Conf]
  3. Stanislav Zák
    An Exponential Lower Bound for One-Time-Only Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:562-566 [Conf]
  4. Stanislav Zák
    A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:319-325 [Conf]
  5. Petr Savický, Stanislav Zák
    A Hierarchy for (1, +k)-Branching Programs with Respect of k. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:478-487 [Conf]
  6. Stasys Jukna, Stanislav Zák
    Some Notes on the Information Flow in Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:356-364 [Conf]
  7. Stanislav Zák
    A Sharp Separation of Sublogarithmic Space Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2002, v:21, n:6, pp:- [Journal]
  8. Stasys Jukna, Stanislav Zák
    On Uncertainty versus Size in Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:39, pp:- [Journal]
  9. Petr Savický, Stanislav Zák
    A large lower bound for 1-branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:36, pp:- [Journal]
  10. Stanislav Zák
    A subexponential lower bound for branching programs restricted with regard to some semantic aspects [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:50, pp:- [Journal]
  11. Stasys Jukna, Stanislav Zák
    On Branching Programs With Bounded Uncertainty [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:30, pp:- [Journal]
  12. Stanislav Zák
    An Exponential Lower Bound for Real-Time Branching Programs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:71, n:1/2, pp:87-94 [Journal]
  13. Stanislav Zák, Kai Hwang
    Polynomial Division on Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:6, pp:577-578 [Journal]
  14. Petr Savický, Stanislav Zák
    A read-once lower bound and a (1, +k)-hierarchy for branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:347-362 [Journal]
  15. Petr Savický, Stanislav Zák
    A Lower Bound on Branching Programs Reading Some Bits Twice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:293-301 [Journal]
  16. Stasys Jukna, Stanislav Zák
    On uncertainty versus size in branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1851-1867 [Journal]
  17. Stanislav Zák
    A Turing Machine Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:327-333 [Journal]
  18. Jirí Síma, Stanislav Zák
    A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:522-531 [Conf]

Search in 0.026secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002