Yechezkel Zalcstein

According to our database, Yechezkel Zalcstein authored at least 25 papers between 1970 and 2003.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of one.

2003

A Note on Square Rooting of Time Functions of Turing Machines.

Richard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein

Theory Comput. Syst., 2003

2000

The Complexity of the A B C Problem.

Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein

SIAM J. Comput., 2000

1994

The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices

Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Clique Partitions of Chordal Graphs.

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Comb. Probab. Comput., 1993

1991

The Complexity of Grigorchuk Groups with Application to Cryptography.

Max H. Garzon, Yechezkel Zalcstein

Theor. Comput. Sci., 1991

On Isomorphism Testing of a Class of 2-Nilpotent Groups.

Max H. Garzon, Yechezkel Zalcstein

J. Comput. Syst. Sci., 1991

1989

An NC₂ Algorithm for Testing Similarity of Matrices.

Yechezkel Zalcstein, Max H. Garzon

Inf. Process. Lett., 1989

The size of chordal, interval and threshold subgraphs.

Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein

Comb., 1989

1987

Alternative Methods for the Reconstruction of Trees from Their Traversals.

H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein

BIT, 1987

1986

Testing homotopy equivalence is isomorphism complete.

Yechezkel Zalcstein, Stanley P. Franklin

Discret. Appl. Math., 1986

The Complexity of Isomorphism Testing

Max H. Garzon, Yechezkel Zalcstein

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Bounds on threshold dimension and disjoint threshold coverings (abstract only).

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

1980

Synchronization Problems Solvable by Generalized PV Systems.

Peter B. Henderson, Yechezkel Zalcstein

J. ACM, 1980

1977

A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives.

Peter B. Henderson, Yechezkel Zalcstein

SIAM J. Comput., 1977

Word Problems Solvable in Logspace.

Richard J. Lipton, Yechezkel Zalcstein

J. ACM, 1977

Algebras Having Linear Multiplicative Complexities.

Charles M. Fiduccia, Yechezkel Zalcstein

J. ACM, 1977

1976

Characterization of the Synchronization Languages for PV Systems

Peter B. Henderson, Yechezkel Zalcstein

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

Group-Complexity and Reversals of Finite Semigroups.

Yechezkel Zalcstein

Math. Syst. Theory, 1975

1974

A Comparative Study of Models of Parallel Computation

Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

On the semigroups of linear sequential machines.

Yechezkel Zalcstein

Int. J. Parallel Program., 1973

1972

Locally Testable Languages.

Yechezkel Zalcstein

J. Comput. Syst. Sci., 1972

Syntactic Semigroups of Some Classes of Star-Free Languages.

Yechezkel Zalcstein

Proceedings of the Automata, 1972

1971

A Note on Fast Cyclic Convolution.

Yechezkel Zalcstein

IEEE Trans. Computers, 1971

1970

Algebraic Structures in Linear Systems Theory.

Yehoshafat Give'on, Yechezkel Zalcstein

J. Comput. Syst. Sci., 1970

On Star-Free Events

Yechezkel Zalcstein

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970