The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yechezkel Zalcstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.085secs, Finished in 0.086secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002