A Note on Tape Bounds for SLA Language Processing - Juris Hartmanis; Leonard Berman (FOCS, 1975)

On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup - Leonard Berman (FOCS, 1976)

On Tape Bounds for Single Letter Alphabet Language Processing. - Juris Hartmanis; Leonard Berman (Theor. Comput. Sci., 1976)

Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report - Leonard Berman (FOCS, 1977)

On polynomial time isomorphisms of complete sets. - Leonard Berman; Juris Hartmanis (Theoretical Computer Science, 1977)

On Isomorphisms and Density of NP and Other Complete Sets. - Leonard Berman; Juris Hartmanis (SIAM J. Comput., 1977)

On Polynomial Time Isomorphisms of Some New Complete Sets. - Juris Hartmanis; Leonard Berman (J. Comput. Syst. Sci., 1978)

The Complexity of Logical Theories. - Leonard Berman (Theor. Comput. Sci., 1980)

On logic comparison. - Leonard Berman (DAC, 1981)

A Fast Algorithm for Steiner Trees. - Lawrence T. Kou; George Markowsky; Leonard Berman (Acta Informatica, 1981)

Some Observations Concerning Alternating Turing Machines Using Small Space. - Jik H. Chang; Oscar H. Ibarra; Bala Ravikumar; Leonard Berman (Inf. Process. Lett., 1987)

Optimal Circuits and Transitive Automorphism Groups. - Steven Rudich; Leonard Berman (ICALP, 1988)

Supply chain simulation: distributed supply chain simulation using a generic job running framework. - Haifeng Xi; Heng Cao; Leonard Berman; David L. Jensen (WSC, 2003)

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 (High Performance Computing Workshop, 2004)