Stanislav Zák

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	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. Electronic Colloquium on Computational Complexity (ECCC) 17: 88 (2010)
	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
j7		Stasys Jukna, Stanislav Zák: On uncertainty versus size in branching programs. Theor. Comput. Sci. 290(3): 1851-1867 (2003)
	2002
j6		Stanislav Zák: A Sharp Separation of Sublogarithmic Space Complexity Classes. Computers and Artificial Intelligence 21(6) (2002)
	2001
i5		Stasys Jukna, Stanislav Zák: On Uncertainty versus Size in Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 8(39) (2001)
	2000
j5		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
	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. Electronic Colloquium on Computational Complexity (ECCC) 5(30) (1998)
	1997
j4		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. Electronic Colloquium on Computational Complexity (ECCC) 4(50) (1997)
	1996
i2		Petr Savický, Stanislav Zák: A large lower bound for 1-branching programs. Electronic Colloquium on Computational Complexity (ECCC) 3(36) (1996)
i1		Petr Savický, Stanislav Zák: A hierarchy for (1,+k)-branching programs with respect to k. Electronic Colloquium on Computational Complexity (ECCC) 3(50) (1996)
	1995
c3		Stanislav Zák: A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs. MFCS 1995: 319-325
	1986
j3		Stanislav Zák: An Exponential Lower Bound for Real-Time Branching Programs. Information and Control 71(1/2): 87-94 (1986)
	1985
j2		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
j1		Stanislav Zák: A Turing Machine Time Hierarchy. Theor. Comput. Sci. 26: 327-333 (1983)
	1979
c1		Stanislav Zák: A Turing Machine Oracle Hierarchy. MFCS 1979: 542-551

Coauthor Index

1	Kai Hwang	[j2]
2	Stasys Jukna	[j7] [i5] [c6] [c5] [i4]
3	Petr Savický	[j5] [j4] [c4] [i2] [i1]
4	Jirí Síma	[c10] [c9] [c8] [i6] [c7]

Last update Tue May 21 16:51:49 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page