Author of the publication

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

A Taxonomy of Problems with Fast Parallel Algorithms. Inf. Control., 64 (1-3): 2-21 (January 1985)A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory., , and . Inf. Comput., 137 (2): 159-170 (1997)Theories for Subexponential-size Bounded-depth Frege Proofs., and . CSL, volume 23 of LIPIcs, page 296-315. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem., , and . CSL, volume 12 of LIPIcs, page 381-395. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)An Assertion Language for Data Structures., and . POPL, page 160-166. ACM Press, (1975)A New Characterization of Type-2 Feasibility., and . SIAM J. Comput., 25 (1): 117-132 (1996)The optimal placement of replicas in a network using a read any - write all policy., , and . CASCON, page 189-201. IBM, (1992)Storage Requirements for Deterministic Polynomial Time Recognizable Languages, and . STOC, page 33-39. ACM, (1974)On the Number of Additions to Compute Specific Polynomials (Preliminary Version), and . STOC, page 342-347. ACM, (1974)Time-Bounded Random Access Machines, and . STOC, page 73-80. ACM, (1972)