Author of the publication

Test for Planarity of a Circuit Given by an Expression.

, and . IEEE Trans. Electronic Computers, 15 (3): 372-375 (1966)

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.

 

Other publications of authors with the same name

Honest Bounds for Complexity Classes of Recursive Functions., and . J. Symb. Log., 39 (1): 127-138 (1974)A Note On Equivalences Among Logics of Programs., and . Logic of Programs, volume 131 of Lecture Notes in Computer Science, page 282-299. Springer, (1981)Reminiscences.. Pillars of Computer Science, volume 4800 of Lecture Notes in Computer Science, page 39-45. Springer, (2008)What is a Model of the Lambda Calculus?. Inf. Control., 52 (1): 87-122 (January 1982)Definability in Dynamic Logic, and . STOC, page 1-7. ACM, (1980)The Semantics of Local Storage, or What Makes the Free-List Free?, , and . POPL, page 245-257. ACM Press, (1984)Computable Values Can Be Classical., and . POPL, page 238-245. ACM Press, (1987)Word Problems Requiring Exponential Time: Preliminary Report, and . STOC, page 1-9. ACM, (1973)Cosmological lower bound on the circuit complexity of a small problem in logic., and . J. ACM, 49 (6): 753-784 (2002)Real Time Counter Machines (Preliminary Version), , and . SWAT, page 148-154. IEEE Computer Society, (1967)