Search results

  1. 1.
    0404724 - UIVT-O 20030013 RIV SK eng J - Journal Article
    Žák, Stanislav
    A Sharp Separation on Sublogarithmic Space Complexity Classes.
    Computing and Informatics. Roč. 21 (2003), s. 617-624. ISSN 1335-9150. E-ISSN 1335-9150
    R&D Projects: GA ČR GA201/02/1456
    Institutional research plan: AV0Z1030915
    Keywords : space complexity * separation * diagonalization
    Subject RIV: BA - General Mathematics
    Impact factor: 0.254, year: 2003
    http://www.cai.sk/ojs/index.php/cai/article/view/478
    Permanent Link: http://hdl.handle.net/11104/0124962
     
     
  2. 2.
    0404608 - UIVT-O 220471 NL eng J - Journal Article
    Žák, Stanislav
    Letter to the Editor.
    Information Processing Letters. Roč. 18, č. 5 (1984), s. 297-298. ISSN 0020-0190. E-ISSN 1872-6119
    Permanent Link: http://hdl.handle.net/11104/0124850
     
     
  3. 3.
    0404104 - UIVT-O 20020142 RIV NL eng J - Journal Article
    Jukna, S. - Žák, Stanislav
    On Uncertainty versus Size in Branching Programs.
    Theoretical Computer Science. Roč. 290, - (2003), s. 1851-1867. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/98/0717; GA MŠMT LN00A056; GA ČR GA201/02/1456
    Keywords : computational complexity * branching programs * decision trees * lower bounds * kraft inequality * entropy
    Subject RIV: BA - General Mathematics
    Impact factor: 0.764, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0124375
     
     
  4. 4.
    0403395 - UIVT-O 20000006 RIV NL eng J - Journal Article
    Žák, Stanislav - Savický, Petr
    A Read-once Lower Bound and a (1,+k) - Hierarchy for Branching Programs.
    Theoretical Computer Science. Roč. 238, č. 1-2 (2000), s. 347-362. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/98/0717
    Grant - others:MŠMT ČR(CZ) OK 304
    Institutional research plan: AV0Z1030915
    Keywords : Boolean functions * branching programs * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.417, year: 2000
    Permanent Link: http://hdl.handle.net/11104/0123705
     
     
  5. 5.
    0403364 - UIVT-O 200622 CS1 cze J - Journal Article
    Žák, Stanislav
    Exponenciální dolní odhad složitosti pro programy s větvením počítající v reálném čase.
    Acta Polytechnica. Roč. 17, č. 2 (1985), s. 43-50
    Permanent Link: http://hdl.handle.net/11104/0123676
     
     
  6. 6.
    0403363 - UIVT-O 200621 CS1 cze J - Journal Article
    Žák, Stanislav
    Větvící se programy a disjunktní predikáty.
    Acta Polytechnica. Roč. 14, č. 2 (1984), s. 79-83
    Permanent Link: http://hdl.handle.net/11104/0123675
     
     
  7. 7.
    0402774 - UIVT-O 970010 NL eng J - Journal Article
    Savický, Petr - Žák, Stanislav
    A Lower Bound on Branching Programs Reading Some Bits Twice.
    Theoretical Computer Science. Roč. 172, - (1997), s. 293-301. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/95/0976
    Keywords : branching programs
    Impact factor: 0.361, year: 1997
    Permanent Link: http://hdl.handle.net/11104/0123156
     
     
  8. 8.
    0401125 - UIVT-O 862121 US eng J - Journal Article
    Žák, Stanislav
    An Exponential Lower Bound for Real-Time Branching Programs.
    Information and Computation. Roč. 71, 1-2 (1986), s. 87-94. ISSN 0890-5401. E-ISSN 1090-2651
    Permanent Link: http://hdl.handle.net/11104/0121599
     
     
  9. 9.
    0400952 - UIVT-O 001272 CS1 eng J - Journal Article
    Žák, Stanislav
    A Turing Machine Space Hierarchy.
    Kybernetika. Roč. 15, č. 2 (1979), s. 100-121. ISSN 0023-5954
    http://dml.cz/handle/10338.dmlcz/124477
    Permanent Link: http://hdl.handle.net/11104/0121427
    FileDownloadSizeCommentaryVersionAccess
    Kybernetika_15-1979-2_3.pdf0972.3 KBPublisher’s postprintopen-access
     
     
  10. 10.
    0400951 - UIVT-O 001271 CS1 eng J - Journal Article
    Žák, Stanislav
    Information in Computation Structures.
    Acta Polytechnica. Roč. 20, č. 4 (1983), s. 47-54. ISSN 1210-2709. E-ISSN 1805-2363
    Permanent Link: http://hdl.handle.net/11104/0121426
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.