default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYechezkel Zalcstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j18]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
- [j17]Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein:
The Complexity of the A B C Problem. SIAM J. Comput. 29(6): 1878-1888 (2000)
1990 – 1999
- 1994
- [c7]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
- [j16]Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein:
Clique Partitions of Chordal Graphs. Comb. Probab. Comput. 2: 409-415 (1993) - 1991
- [j15]Max H. Garzon, Yechezkel Zalcstein:
On Isomorphism Testing of a Class of 2-Nilpotent Groups. J. Comput. Syst. Sci. 42(2): 237-248 (1991) - [j14]Max H. Garzon, Yechezkel Zalcstein:
The Complexity of Grigorchuk Groups with Application to Cryptography. Theor. Comput. Sci. 88(1): 83-98 (1991)
1980 – 1989
- 1989
- [j13]Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs. Comb. 9(3): 245-253 (1989) - [j12]Yechezkel Zalcstein, Max H. Garzon:
An NC2 Algorithm for Testing Similarity of Matrices. Inf. Process. Lett. 30(5): 253-254 (1989) - 1987
- [j11]H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein:
Alternative Methods for the Reconstruction of Trees from Their Traversals. BIT 27(2): 133-140 (1987) - 1986
- [j10]Yechezkel Zalcstein, Stanley P. Franklin:
Testing homotopy equivalence is isomorphism complete. Discret. Appl. Math. 13(1): 101-104 (1986) - [c6]Max H. Garzon, Yechezkel Zalcstein:
The Complexity of Isomorphism Testing. FOCS 1986: 313-321 - 1985
- [c5]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
- [j9]Peter B. Henderson, Yechezkel Zalcstein:
Synchronization Problems Solvable by Generalized PV Systems. J. ACM 27(1): 60-71 (1980)
1970 – 1979
- 1977
- [j8]Charles M. Fiduccia, Yechezkel Zalcstein:
Algebras Having Linear Multiplicative Complexities. J. ACM 24(2): 311-331 (1977) - [j7]Richard J. Lipton, Yechezkel Zalcstein:
Word Problems Solvable in Logspace. J. ACM 24(3): 522-526 (1977) - [j6]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
- [c4]Peter B. Henderson, Yechezkel Zalcstein:
Characterization of the Synchronization Languages for PV Systems. FOCS 1976: 9-18 - 1975
- [j5]Yechezkel Zalcstein:
Group-Complexity and Reversals of Finite Semigroups. Math. Syst. Theory 8(3): 235-242 (1975) - 1974
- [c3]Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein:
A Comparative Study of Models of Parallel Computation. SWAT 1974: 145-155 - 1973
- [j4]Yechezkel Zalcstein:
On the semigroups of linear sequential machines. Int. J. Parallel Program. 2(1): 25-28 (1973) - 1972
- [j3]Yechezkel Zalcstein:
Locally Testable Languages. J. Comput. Syst. Sci. 6(2): 151-167 (1972) - [c2]Yechezkel Zalcstein:
Syntactic Semigroups of Some Classes of Star-Free Languages. ICALP 1972: 135-144 - 1971
- [j2]Yechezkel Zalcstein:
A Note on Fast Cyclic Convolution. IEEE Trans. Computers 20(6): 665-666 (1971) - 1970
- [j1]Yehoshafat Give'on, Yechezkel Zalcstein:
Algebraic Structures in Linear Systems Theory. J. Comput. Syst. Sci. 4(6): 539-556 (1970) - [c1]Yechezkel Zalcstein:
On Star-Free Events. SWAT 1970: 76-80
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
