According to our database1, Leonard Berman authored at least 15 papers between 1975 and 2004.
Legend:Book In proceedings Article PhD thesis Other
Developing innovative technologies for commercial grids.
Proceedings of the Grid Computing: The New Frontier of High Performance Computing [post-proceedings of the High Performance Computing Workshop, 2004
Supply chain simulation: distributed supply chain simulation using a generic job running framework.
Proceedings of the 35th Winter Simulation Conference: Driving Innovation, 2003
Optimal Circuits and Transitive Automorphism Groups.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Some Observations Concerning Alternating Turing Machines Using Small Space.
Inf. Process. Lett., 1987
A Fast Algorithm for Steiner Trees.
Acta Inf., 1981
On logic comparison.
Proceedings of the 18th Design Automation Conference, 1981
The Complexitiy of Logical Theories.
Theor. Comput. Sci., 1980
On Polynomial Time Isomorphisms of Some New Complete Sets.
J. Comput. Syst. Sci., 1978
On Isomorphisms and Density of NP and Other Complete Sets.
SIAM J. Comput., 1977
On polynomial time isomorphisms of complete sets.
Proceedings of the Theoretical Computer Science, 1977
Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977
On Tape Bounds for Single Letter Alphabet Language Processing.
Theor. Comput. Sci., 1976
On Isomorphisms and Density of NP and Other Complete Sets
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976
On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976
A Note on Tape Bounds for SLA Language Processing
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975