Leonard Berman

According to our database, Leonard Berman authored at least 14 papers between 1975 and 2004.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2004

Developing innovative technologies for commercial grids.

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

Proceedings of the Grid Computing: The New Frontier of High Performance Computing [post-proceedings of the High Performance Computing Workshop, 2004

2003

Supply chain simulation: distributed supply chain simulation using a generic job running framework.

Haifeng Xi, Heng Cao, Leonard Berman, David L. Jensen

Proceedings of the 35th Winter Simulation Conference: Driving Innovation, 2003

1988

Optimal Circuits and Transitive Automorphism Groups.

Steven Rudich, Leonard Berman

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

Some Observations Concerning Alternating Turing Machines Using Small Space.

Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman

Inf. Process. Lett., 1987

1981

A Fast Algorithm for Steiner Trees.

Lawrence T. Kou, George Markowsky, Leonard Berman

Acta Informatica, 1981

On logic comparison.

Leonard Berman

Proceedings of the 18th Design Automation Conference, 1981

1980

The Complexity of Logical Theories.

Leonard Berman

Theor. Comput. Sci., 1980

1978

On Polynomial Time Isomorphisms of Some New Complete Sets.

Juris Hartmanis, Leonard Berman

J. Comput. Syst. Sci., 1978

1977

On Isomorphisms and Density of NP and Other Complete Sets.

Leonard Berman, Juris Hartmanis

SIAM J. Comput., 1977

On polynomial time isomorphisms of complete sets.

Leonard Berman, Juris Hartmanis

Proceedings of the Theoretical Computer Science, 1977

Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report

Leonard Berman

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

On Tape Bounds for Single Letter Alphabet Language Processing.

Juris Hartmanis, Leonard Berman

Theor. Comput. Sci., 1976

On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup

Leonard Berman

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

A Note on Tape Bounds for SLA Language Processing

Juris Hartmanis, Leonard Berman

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975