( en | de | ru )

 

Disambiguation of "Bournez, Olivier"

Author of the publication

copydeleteadd this publication to your clipboard
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs.

, , , and . CMSB, volume 10545 of Lecture Notes in Computer Science, page 108-127. Springer, (2017)

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.

Olivier Brede

Olivier Coutand

Christoph Olivier

Paul Olivier

Hans Olivier

 

Other publications of authors with the same name

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)Theoretical Computer Science: Computability, Decidability and Logic., , , , , , and . A Guided Tour of Artificial Intelligence Research (3) (III), Springer, (2020)Reachability Problems for One-Dimensional Piecewise Affine Maps., , and . Int. J. Found. Comput. Sci., 29 (4): 529-549 (2018)Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time., , , and . J. Log. Comput., 15 (1): 41-58 (2005)Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs., , , and . CMSB, volume 10545 of Lecture Notes in Computer Science, page 108-127. Springer, (2017)Preface., and . Nat. Comput., 11 (1): 1 (2012)The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation., , , and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 631-643. Springer, (2006)