Author of the publication

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.

, , , and . J. Log. Comput., 15 (1): 41-58 (2005)

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

Reachability Problems for One-Dimensional Piecewise Affine Maps., , and . Int. J. Found. Comput. Sci., 29 (4): 529-549 (2018)Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length., , and . CoRR, (2016)On the Functions Generated by the General Purpose Analog Computer., , and . CoRR, (2016)Orthogonal Polyhedra: Representation and Computation., , and . HSCC, volume 1569 of Lecture Notes in Computer Science, page 46-60. Springer, (1999)On the Computational Power of Dynamical Systems and Hybrid Systems., and . Theor. Comput. Sci., 168 (2): 417-459 (1996)Rewriting Logic and Probabilities., and . RTA, volume 2706 of Lecture Notes in Computer Science, page 61-75. Springer, (2003)Automated Generation of Kinetic Chemical Mechanisms Using Rewriting., , , , and . International Conference on Computational Science, volume 2659 of Lecture Notes in Computer Science, page 367-376. Springer, (2003)Trustful Population Protocols., , and . DISC, volume 8205 of Lecture Notes in Computer Science, page 447-461. Springer, (2013)On the Representation of Timed Polyhedra., and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 793-807. Springer, (2000)Homonym Population Protocols., , and . NETYS, volume 9466 of Lecture Notes in Computer Science, page 125-139. Springer, (2015)