2003 |
22 | EE | Richard J. Lipton,
Mitsunori Ogihara,
Yechezkel Zalcstein:
A Note on Square Rooting of Time Functions of Turing Machines.
Theory Comput. Syst. 36(3): 295-299 (2003) |
2000 |
21 | | Jin-yi Cai,
Richard J. Lipton,
Yechezkel Zalcstein:
The Complexity of the A B C Problem.
SIAM J. Comput. 29(6): 1878-1888 (2000) |
1994 |
20 | | Jin-yi Cai,
Richard J. Lipton,
Yechezkel Zalcstein:
The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices
FOCS 1994: 135-142 |
1993 |
19 | | Paul Erdös,
Edward T. Ordman,
Yechezkel Zalcstein:
Clique Partitions of Chordal Graphs.
Combinatorics, Probability & Computing 2: 409-415 (1993) |
1991 |
18 | | Max H. Garzon,
Yechezkel Zalcstein:
On Isomorphism Testing of a Class of 2-Nilpotent Groups.
J. Comput. Syst. Sci. 42(2): 237-248 (1991) |
17 | | Max H. Garzon,
Yechezkel Zalcstein:
The Complexity of Grigorchuk Groups with Application to Cryptography.
Theor. Comput. Sci. 88(1): 83-98 (1991) |
1989 |
16 | | Paul Erdös,
András Gyárfás,
Edward T. Ordman,
Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs.
Combinatorica 9(3): 245-253 (1989) |
15 | | Yechezkel Zalcstein,
Max H. Garzon:
An NC2 Algorithm for Testing Similarity of Matrices.
Inf. Process. Lett. 30(5): 253-254 (1989) |
1987 |
14 | | H. A. Burgdorff,
Sushil Jajodia,
Frederick N. Springsteel,
Yechezkel Zalcstein:
Alternative Methods for the Reconstruction of Trees from Their Traversals.
BIT 27(2): 134-140 (1987) |
1986 |
13 | | Max H. Garzon,
Yechezkel Zalcstein:
The Complexity of Isomorphism Testing
FOCS 1986: 313-321 |
1985 |
12 | EE | Paul Erdös,
Edward T. Ordman,
Yechezkel Zalcstein:
Bounds on threshold dimension and disjoint threshold coverings (abstract only).
ACM Conference on Computer Science 1985: 422 |
1980 |
11 | EE | Peter B. Henderson,
Yechezkel Zalcstein:
Synchronization Problems Solvable by Generalized PV Systems.
J. ACM 27(1): 60-71 (1980) |
1977 |
10 | EE | Charles M. Fiduccia,
Yechezkel Zalcstein:
Algebras Having Linear Multiplicative Complexities.
J. ACM 24(2): 311-331 (1977) |
9 | EE | Richard J. Lipton,
Yechezkel Zalcstein:
Word Problems Solvable in Logspace.
J. ACM 24(3): 522-526 (1977) |
8 | | Peter B. Henderson,
Yechezkel Zalcstein:
A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives.
SIAM J. Comput. 6(1): 88-108 (1977) |
1976 |
7 | | Peter B. Henderson,
Yechezkel Zalcstein:
Characterization of the Synchronization Languages for PV Systems
FOCS 1976: 9-18 |
1975 |
6 | | Yechezkel Zalcstein:
Group-Complexity and Reversals of Finite Semigroups.
Mathematical Systems Theory 8(3): 235-242 (1975) |
1974 |
5 | | Richard J. Lipton,
Lawrence Snyder,
Yechezkel Zalcstein:
A Comparative Study of Models of Parallel Computation
FOCS 1974: 145-155 |
1972 |
4 | | Yechezkel Zalcstein:
Syntactic Semigroups of Some Classes of Star-Free Languages.
ICALP 1972: 135-144 |
3 | | Yechezkel Zalcstein:
Locally Testable Languages.
J. Comput. Syst. Sci. 6(2): 151-167 (1972) |
1970 |
2 | | Yechezkel Zalcstein:
On Star-Free Events
FOCS 1970: 76-80 |
1 | | Yehoshafat Give'on,
Yechezkel Zalcstein:
Algebraic Structures in Linear Systems Theory.
J. Comput. Syst. Sci. 4(6): 539-556 (1970) |