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