Author of the publication

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.

, , , and . VPT/HCVS@ETAPS, volume 320 of EPTCS, page 65-79. (2020)

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 Swiss Pocket Knife for Computability.. Festschrift for Dave Schmidt, volume 129 of EPTCS, page 1-17. (2013)Even Simple Programs Are Hard To Analyze., and . J. ACM, 24 (2): 338-350 (1977)Complete Problems for Deterministic Polynomial Time, and . STOC, page 40-46. ACM, (1974)Obfuscation by partial evaluation of distorted interpreters., , and . PEPM, page 63-72. ACM, (2012)Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time., , and . CiE, volume 5028 of Lecture Notes in Computer Science, page 67-76. Springer, (2008)Flow Analysis of Lambda Expressions (Preliminary Version).. ICALP, volume 115 of Lecture Notes in Computer Science, page 114-128. Springer, (1981)A Positive Supercompiler., , and . J. Funct. Program., 6 (6): 811-838 (1996)Partial evaluation and automatic program generation., , and . Prentice Hall international series in computer science Prentice Hall, (1993)Parsers for indexed grammars., and . Int. J. Parallel Program., 7 (4): 345-359 (1978)Context-Free Languages and Rudimentary Attributes.. Math. Syst. Theory, 3 (2): 102-109 (1969)Corrigendum: Mathematical Systems Theory 11: 379-380 (1978).