Leonard Berman

15 papers A* 6Misc 2Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2004 Misc conf
Developing innovative technologies for commercial grids.
High Performance Computing Workshop
Jean-Pierre Prost, Leonard Berman, Rong N. Chang, Murthy V. Devarakonda, Matt Haynos, Wen-Syan Li, Ying Li, Inderpal Narang, Jay Unger, Dinesh C. Verma
2003 Misc conf
Supply chain simulation: distributed supply chain simulation using a generic job running framework.
WSC
Haifeng Xi, Heng Cao, Leonard Berman, David L. Jensen
1988 A* conf
Optimal Circuits and Transitive Automorphism Groups.
ICALP
Steven Rudich, Leonard Berman
1987 J jnl
Some Observations Concerning Alternating Turing Machines Using Small Space.
Inf. Process. Lett.
Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman
1981 J jnl
A Fast Algorithm for Steiner Trees.
Acta Informatica
Lawrence T. Kou, George Markowsky, Leonard Berman
1981 A* conf
On logic comparison.
DAC
Leonard Berman
1980 J jnl
The Complexity of Logical Theories.
Theor. Comput. Sci.
Leonard Berman
1978 J jnl
On Polynomial Time Isomorphisms of Some New Complete Sets.
J. Comput. Syst. Sci.
Juris Hartmanis, Leonard Berman
1977 J jnl
On Isomorphisms and Density of NP and Other Complete Sets.
SIAM J. Comput.
Leonard Berman, Juris Hartmanis
1977 — conf
On polynomial time isomorphisms of complete sets.
Theoretical Computer Science
Leonard Berman, Juris Hartmanis
1977 A* conf
Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report
FOCS
Leonard Berman
1976 A* conf
On Isomorphisms and Density of NP and Other Complete Sets
STOC
Juris Hartmanis, Leonard Berman
1976 J jnl
On Tape Bounds for Single Letter Alphabet Language Processing.
Theor. Comput. Sci.
Juris Hartmanis, Leonard Berman
1976 A* conf
On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup
FOCS
Leonard Berman
1975 A* conf
A Note on Tape Bounds for SLA Language Processing
FOCS
Juris Hartmanis, Leonard Berman