Leonard Berman

Publication Activity (10 Years)

Years Active: 1975-2004
Publications (10 Years): 0

Publications

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