Yechezkel Zalcstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2003

A Note on Square Rooting of Time Functions of Turing MachinesRichard J. Lipton, Mitsunori Ogihara, Yechezkel Zalcstein. mst, 36(3):295-299, 2003. [doi]

2000

The Complexity of the A B C ProblemJin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein. SICOMP, 29(6):1878-1888, 2000.

1994

The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational MatricesJin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein. focs 1994: 135-142

1993

Clique Partitions of Chordal GraphsPaul Erdös, Edward T. Ordman, Yechezkel Zalcstein. cpc, 2:409-415, 1993.

1991

The Complexity of Grigorchuk Groups with Application to CryptographyMax H. Garzon, Yechezkel Zalcstein. TCS, 88(1):83-98, 1991.

On Isomorphism Testing of a Class of 2-Nilpotent GroupsMax H. Garzon, Yechezkel Zalcstein. jcss, 42(2):237-248, 1991.

1989

The size of chordal, interval and threshold subgraphsPaul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein. combinatorica, 9(3):245-253, 1989.

An NC::2:: Algorithm for Testing Similarity of MatricesYechezkel Zalcstein, Max H. Garzon. ipl, 30(5):253-254, 1989.

1987

Alternative Methods for the Reconstruction of Trees from Their TraversalsH. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein. bit, 27(2):134-140, 1987.

1986

The Complexity of Isomorphism TestingMax H. Garzon, Yechezkel Zalcstein. focs 1986: 313-321

Testing homotopy equivalence is isomorphism completeYechezkel Zalcstein, Stanley P. Franklin. DAM, 13(1):101-104, 1986. [doi]

1985

Bounds on threshold dimension and disjoint threshold coverings (abstract only)Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein. acm 1985: 422 [doi]

1980

Synchronization Problems Solvable by Generalized PV SystemsPeter B. Henderson, Yechezkel Zalcstein. JACM, 27(1):60-71, 1980. [doi]

1977

Algebras Having Linear Multiplicative ComplexitiesCharles M. Fiduccia, Yechezkel Zalcstein. JACM, 24(2):311-331, 1977. [doi]

A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing PrimitivesPeter B. Henderson, Yechezkel Zalcstein. SICOMP, 6(1):88-108, 1977.

Word Problems Solvable in LogspaceRichard J. Lipton, Yechezkel Zalcstein. JACM, 24(3):522-526, 1977. [doi]

1976

Characterization of the Synchronization Languages for PV SystemsPeter B. Henderson, Yechezkel Zalcstein. focs 1976: 9-18

1975

Group-Complexity and Reversals of Finite SemigroupsYechezkel Zalcstein. mst, 8(3):235-242, 1975.

1974

A Comparative Study of Models of Parallel ComputationRichard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein. focs 1974: 145-155

1973

On the semigroups of linear sequential machinesYechezkel Zalcstein. ijpp, 2(1):25-28, 1973. [doi]

1972

Syntactic Semigroups of Some Classes of Star-Free LanguagesYechezkel Zalcstein. icalp 1972: 135-144

Locally Testable LanguagesYechezkel Zalcstein. jcss, 6(2):151-167, 1972.

1971

A Note on Fast Cyclic ConvolutionYechezkel Zalcstein. TC, 20(6):665-666, 1971. [doi]

1970

Algebraic Structures in Linear Systems TheoryYehoshafat Give on, Yechezkel Zalcstein. jcss, 4(6):539-556, 1970.

On Star-Free EventsYechezkel Zalcstein. focs 1970: 76-80

Sign in or sign up to see more results.

runs on WebDSL