The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leonard Berman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leonard Berman
    Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:95-99 [Conf]
  2. Leonard Berman
    The Complexitiy of Logical Theories. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:71-77 [Journal]
  3. Leonard Berman
    On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:76-80 [Conf]
  4. Juris Hartmanis, Leonard Berman
    A Note on Tape Bounds for SLA Language Processing [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:65-70 [Conf]
  5. Steven Rudich, Leonard Berman
    Optimal Circuits and Transitive Automorphism Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:516-524 [Conf]
  6. Juris Hartmanis, Leonard Berman
    On Isomorphisms and Density of NP and Other Complete Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:30-40 [Conf]
  7. Leonard Berman, Juris Hartmanis
    On polynomial time isomorphisms of complete sets. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:1-16 [Conf]
  8. Haifeng Xi, Heng Cao, Leonard Berman, David Jensen
    Supply chain simulation: distributed supply chain simulation using a generic job running framework. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2003, pp:1305-1312 [Conf]
  9. Lawrence T. Kou, George Markowsky, Leonard Berman
    A Fast Algorithm for Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:141-145 [Journal]
  10. Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman
    Some Observations Concerning Alternating Turing Machines Using Small Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:1, pp:1-9 [Journal]
  11. Juris Hartmanis, Leonard Berman
    On Polynomial Time Isomorphisms of Some New Complete Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:418-422 [Journal]
  12. Leonard Berman, Juris Hartmanis
    On Isomorphisms and Density of NP and Other Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:305-322 [Journal]
  13. Juris Hartmanis, Leonard Berman
    On Tape Bounds for Single Letter Alphabet Language Processing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:2, pp:213-224 [Journal]

Search in 0.002secs, Finished in 0.003secs
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