Stanislav Zak

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A polynomial-time construction of a hitting set for read-once branching programs of width 3 Fundamenta Informaticae	2022-03-09	Paper
On tight separation for Blum measures applied to Turing machine buffer complexity Fundamenta Informaticae	2017-12-05	Paper
A Turing machine distance hierarchy Language and Automata Theory and Applications	2013-03-18	Paper
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 SOFSEM 2012: Theory and Practice of Computer Science	2012-06-15	Paper
Almost \(k\)-wise independent sets establish hitting sets for width-3 1-branching programs Computer Science – Theory and Applications	2011-06-17	Paper
A superpolynomial lower bound for \((1,+k(n))\)-branching programs Lecture Notes in Computer Science	2010-06-17	Paper
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3 Lecture Notes in Computer Science	2008-03-07	Paper
scientific article; zbMATH DE number 2172794 (Why is no real title available?)	2005-10-07	Paper
scientific article; zbMATH DE number 2079872 (Why is no real title available?)	2004-08-03	Paper
On uncertainty versus size in branching programs. Theoretical Computer Science	2003-08-17	Paper
A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs Theoretical Computer Science	2000-08-21	Paper
scientific article; zbMATH DE number 1361505 (Why is no real title available?)	1999-11-10	Paper
A lower bound on branching programs reading some bits twice Theoretical Computer Science	1998-07-23	Paper
An exponential lower bound for real-time branching programs Information and Control	1986-01-01	Paper
scientific article; zbMATH DE number 3890736 (Why is no real title available?)	1984-01-01	Paper
Letter to the editor Information Processing Letters	1984-01-01	Paper
A Turing machine time hierarchy Theoretical Computer Science	1983-01-01	Paper
scientific article; zbMATH DE number 3669861 (Why is no real title available?)	1980-01-01	Paper
scientific article; zbMATH DE number 3669860 (Why is no real title available?)	1980-01-01	Paper
scientific article; zbMATH DE number 3655356 (Why is no real title available?)	1979-01-01	Paper
scientific article; zbMATH DE number 3642710 (Why is no real title available?)	1979-01-01	Paper

Research outcomes over time

This page was built for person: Stanislav Zak