default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanislav Zák
Person information
- unicode name: Stanislav Žák
- affiliation: Academy of Sciences of the Czech Republic, Institute of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Jirí Síma, Stanislav Zák:
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Fundam. Informaticae 184(4): 307-354 (2021)- [i9]Jirí Síma, Stanislav Zák:
A polynomial time construction of a hitting set for read-once branching programs of width 3. CoRR abs/2101.01151 (2021)
2010 – 2019
- 2019
- [i8]Stanislav Zák:
A Logical Characteristic of Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- [j9]Jirí Síma, Stanislav Zák:
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. Fundam. Informaticae 152(4): 397-409 (2017) - 2015
- [i7]Stanislav Zák:
Inherent logic and complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [c10]Stanislav Zák, Jirí Síma:
A Turing Machine Distance Hierarchy. LATA 2013: 570-578 - 2012
- [c9]Jirí Síma, Stanislav Zák:
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). SOFSEM 2012: 406-418 - 2011
- [c8]Jirí Síma, Stanislav Zák:
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. CSR 2011: 120-133 - 2010
- [i6]Jirí Síma, Stanislav Zák:
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2007
- [c7]Jirí Síma, Stanislav Zák:
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. SOFSEM (1) 2007: 522-531 - 2003
- [j8]Stasys Jukna
, Stanislav Zák:
On uncertainty versus size in branching programs. Theor. Comput. Sci. 290(3): 1851-1867 (2003) - 2002
- [j7]Stanislav Zák:
A Sharp Separation of Sublogarithmic Space Complexity Classes. Comput. Artif. Intell. 21(6) (2002) - 2001
- [i5]Stasys Jukna, Stanislav Zák:
On Uncertainty versus Size in Branching Programs. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Petr Savický, Stanislav Zák:
A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theor. Comput. Sci. 238(1-2): 347-362 (2000) - [c6]Stasys Jukna, Stanislav Zák:
Some Notes on the Information Flow in Read-Once Branching Programs. SOFSEM 2000: 356-364
1990 – 1999
- 1998
- [c5]Stasys Jukna, Stanislav Zák:
On Branching Programs With Bounded Uncertainty (Extended Abstract). ICALP 1998: 259-270 - [i4]Stasys Jukna, Stanislav Zák:
On Branching Programs With Bounded Uncertainty. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j5]Petr Savický, Stanislav Zák:
A Lower Bound on Branching Programs Reading Some Bits Twice. Theor. Comput. Sci. 172(1-2): 293-301 (1997) - [c4]Petr Savický, Stanislav Zák:
A Hierarchy for (1, +k)-Branching Programs with Respect of k. MFCS 1997: 478-487 - [i3]Stanislav Zák:
A subexponential lower bound for branching programs restricted with regard to some semantic aspects. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [i2]Petr Savický, Stanislav Zák:
A large lower bound for 1-branching programs. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Petr Savický, Stanislav Zák:
A hierarchy for (1,+k)-branching programs with respect to k. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c3]Stanislav Zák:
A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. MFCS 1995: 319-325
1980 – 1989
- 1986
- [j4]Stanislav Zák:
An Exponential Lower Bound for Real-Time Branching Programs. Inf. Control. 71(1/2): 87-94 (1986) - 1985
- [j3]Stanislav Zák, Kai Hwang:
Polynomial Division on Systolic Arrays. IEEE Trans. Computers 34(6): 577-578 (1985) - 1984
- [c2]Stanislav Zák:
An Exponential Lower Bound for One-Time-Only Branching Programs. MFCS 1984: 562-566 - 1983
- [j2]Stanislav Zák:
A Turing Machine Time Hierarchy. Theor. Comput. Sci. 26: 327-333 (1983)
1970 – 1979
- 1979
- [j1]Stanislav Zák:
A Turing machine space hierarchy. Kybernetika 15(2): 100-121 (1979) - [c1]Stanislav Zák:
A Turing Machine Oracle Hierarchy. MFCS 1979: 542-551
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
