Stanislav Zák - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2021

A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3Jirí Síma, Stanislav Zák. FUIN, 184(4):307-354, 2021. [doi]

2019

A Logical Characteristic of Read-Once Branching ProgramsStanislav Zák. eccc, 26:150, 2019. [doi]

2017

On Tight Separation for Blum Measures Applied to Turing Machine Buffer ComplexityJirí Síma, Stanislav Zák. FUIN, 152(4):397-409, 2017. [doi]

2015

Inherent logic and complexityStanislav Zák. eccc, 22:29, 2015. [doi]

2013

A Turing Machine Distance HierarchyStanislav Zák, Jirí Síma. LATA 2013: 570-578 [doi]

2012

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)Jirí Síma, Stanislav Zák. sofsem 2012: 406-418 [doi]

2011

Almost ::::k::::-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching ProgramsJirí Síma, Stanislav Zák. csr 2011: 120-133 [doi]

2010

A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3Jirí Síma, Stanislav Zák. eccc, 17:88, 2010. [doi]

2007

A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3Jirí Síma, Stanislav Zák. sofsem 2007: 522-531 [doi]

2003

On uncertainty versus size in branching programsStasys Jukna, Stanislav Zák. TCS, 290(3):1851-1867, 2003.

2002

A Sharp Separation of Sublogarithmic Space Complexity ClassesStanislav Zák. cai, 21(6), 2002.

2001

On Uncertainty versus Size in Branching ProgramsStasys Jukna, Stanislav Zák. eccc, 8(39), 2001. [doi]

2000

Some Notes on the Information Flow in Read-Once Branching ProgramsStasys Jukna, Stanislav Zák. sofsem 2000: 356-364 [doi]

A read-once lower bound and a (1, +k)-hierarchy for branching programsPetr Savický, Stanislav Zák. TCS, 238(1-2):347-362, 2000. [doi]

1998

On Branching Programs With Bounded UncertaintyStasys Jukna, Stanislav Zák. eccc, 5(30), 1998. [doi]

On Branching Programs With Bounded Uncertainty (Extended Abstract)Stasys Jukna, Stanislav Zák. icalp 1998: 259-270 [doi]

1997

A Hierarchy for (1, +k)-Branching Programs with Respect of kPetr Savický, Stanislav Zák. mfcs 1997: 478-487

A Lower Bound on Branching Programs Reading Some Bits TwicePetr Savický, Stanislav Zák. TCS, 172(1-2):293-301, 1997. [doi]

A subexponential lower bound for branching programs restricted with regard to some semantic aspectsStanislav Zák. eccc, 4(50), 1997. [doi]

1996

A large lower bound for 1-branching programsPetr Savický, Stanislav Zák. eccc, 3(36), 1996. [doi]

1995

A Superpolynomial Lower Bound for (1, +k(n))-Branching ProgramsStanislav Zák. mfcs 1995: 319-325

1986

An Exponential Lower Bound for Real-Time Branching ProgramsStanislav Zák. iandc, 71(1/2):87-94, October/November 1986.

1985

Polynomial Division on Systolic ArraysStanislav Zák, Kai Hwang. TC, 34(6):577-578, 1985.

1984

An Exponential Lower Bound for One-Time-Only Branching ProgramsStanislav Zák. mfcs 1984: 562-566

1983

A Turing Machine Time HierarchyStanislav Zák. TCS, 26:327-333, 1983.

1979

A Turing Machine Oracle HierarchyStanislav Zák. mfcs 1979: 542-551

A Turing machine space hierarchyStanislav Zák. kybernetika, 15(2):100-121, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL