( en | de | ru )

 

Disambiguation of "Berman, Leonard"

Author of the publication

copydeleteadd this publication to your clipboard
Some Observations Concerning Alternating Turing Machines Using Small Space.

, , , and . Inf. Process. Lett., 25 (1): 1-9 (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nina Berman

Judith Berman

Leo Berman

Jakob Berman

David Berman

 

Other publications of authors with the same name

On logic comparison.. DAC, page 854-861. ACM/IEEE, (1981)Some Observations Concerning Alternating Turing Machines Using Small Space., , , and . Inf. Process. Lett., 25 (1): 1-9 (1987)Supply chain simulation: distributed supply chain simulation using a generic job running framework., , , and . WSC, page 1305-1312. IEEE Computer Society, (2003)On Polynomial Time Isomorphisms of Some New Complete Sets., and . J. Comput. Syst. Sci., 16 (3): 418-422 (1978)Optimal Circuits and Transitive Automorphism Groups., and . ICALP, volume 317 of Lecture Notes in Computer Science, page 516-524. Springer, (1988)On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup. FOCS, page 76-80. IEEE Computer Society, (1976)Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report. FOCS, page 95-99. IEEE Computer Society, (1977)The Complexity of Logical Theories.. Theor. Comput. Sci., (1980)On polynomial time isomorphisms of complete sets., and . Theoretical Computer Science, volume 48 of Lecture Notes in Computer Science, page 1-16. Springer, (1977)A Note on Tape Bounds for SLA Language Processing, and . FOCS, page 65-70. IEEE Computer Society, (1975)