Author of the publication

Computational complexity via programming languages: constant factors do matter.

, and . Acta Inf., 37 (2): 83-120 (2000)

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

Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation., and . Ershov Memorial Conference, volume 7162 of Lecture Notes in Computer Science, page 153-169. Springer, (2011)Context-Free Languages and Rudimentary Attributes.. Math. Syst. Theory, 3 (2): 102-109 (1969)Corrigendum: Mathematical Systems Theory 11: 379-380 (1978).Partial evaluation and automatic program generation., , and . Prentice Hall international series in computer science Prentice Hall, (1993)Complexity of Some Problems in Petri Nets., , and . Theor. Comput. Sci., 4 (3): 277-299 (1977)Priority Paging Algorithms and the Extension Problem, and . SWAT, page 177-181. IEEE Computer Society, (1971)A Self-Applicable Partial Evaluator for the Lambda Calculus., , , , and . ICCL, page 49-58. IEEE Computer Society, (1990)Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra, and . FOCS, page 185-190. IEEE Computer Society, (1980)Obfuscation by partial evaluation of distorted interpreters., , and . PEPM, page 63-72. ACM, (2012)Complete Problems for Deterministic Polynomial Time, and . STOC, page 40-46. ACM, (1974)Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time., , and . CiE, volume 5028 of Lecture Notes in Computer Science, page 67-76. Springer, (2008)