Author of the publication

Parity, Circuits, and the Polynomial-Time Hierarchy

, , and . FOCS, page 260-270. IEEE Computer Society, (1981)

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

PLDI 2002: Extended static checking for Java., , , , , and . ACM SIGPLAN Notices, 48 (4S): 22-33 (2013)Theorem Proving Using Lazy Proof Explication., , , and . CAV, volume 2725 of Lecture Notes in Computer Science, page 355-367. Springer, (2003)Parity, Circuits, and the Polynomial-Time Hierarchy, , and . FOCS, page 260-270. IEEE Computer Society, (1981)Avoiding exponential explosion: generating compact verification conditions., and . POPL, page 193-205. ACM, (2001)ACM SIGPLAN Notices 36(3), March 2001.Using Transformations and Verification in Ciruit Design., , , and . Designing Correct Circuits, volume A-5 of IFIP Transactions, page 1-25. North-Holland, (1992)Finding Extrema with Unary Predicates., , , , and . Algorithmica, 9 (6): 591-600 (1993)Checking Java Programs via Guarded Commands., , and . ECOOP Workshops, volume 1743 of Lecture Notes in Computer Science, page 110-111. Springer, (1999)Transforming Static Data Structures to Dynamic Structures (Abridged Version), and . FOCS, page 148-168. IEEE Computer Society, (1979)Induction in Compositional Model Checking., , and . CAV, volume 1855 of Lecture Notes in Computer Science, page 312-327. Springer, (2000)Extended Static Checking for Java., , , , , and . PLDI, page 234-245. ACM, (2002)