Olivier Bournez

CoRR, 2023

Measuring robustness of dynamical systems. Relating time and space to length and precision.

[BibT_eX]

[DOI]

CoRR, 2023

A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Polynomial time computable functions over the reals characterized using discrete ordinary differential equations.

[BibT_eX]

[DOI]

CoRR, 2022

A characterization of functions over the integers computable in polynomial time using discrete differential equations.

[BibT_eX]

[DOI]

Arnaud Durand

CoRR, 2022

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

2020

A Universal Ordinary Differential Equation.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Theoretical Computer Science: Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence, 2020

Theoretical Computer Science: Computability, Decidability and Logic.

[BibT_eX]

[DOI]

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence, 2020

2019

Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations.

[BibT_eX]

[DOI]

Arnaud Durand

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

On the complexity of bounded time and precision reachability for piecewise affine systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Homonym Population Protocols.

[BibT_eX]

[DOI]

Johanne Cohen

Mikaël Rabie

Theory Comput. Syst., 2018

Reachability Problems for One-Dimensional Piecewise Affine Maps.

[BibT_eX]

[DOI]

Oleksiy Kurganskyy

Igor Potapov

Int. J. Found. Comput. Sci., 2018

Recursion schemes, discrete differential equations and characterization of polynomial time computation.

[BibT_eX]

[DOI]

Arnaud Durand

Sabrina Ouazzani

CoRR, 2018

A Survey on Analog Models of Computation.

[BibT_eX]

[DOI]

CoRR, 2018

Cheap Non-standard Analysis and Computability.

[BibT_eX]

[DOI]

Sabrina Ouazzani

CoRR, 2018

Cheap Non-Standard Analysis and Computability: Some Applications.

[BibT_eX]

[DOI]

Sabrina Ouazzani

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Ordinary Differential Equations & Computability.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

2017

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.

[BibT_eX]

[DOI]

J. ACM, 2017

On the functions generated by the general purpose analog computer.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs.

[BibT_eX]

[DOI]

Proceedings of the Computational Methods in Systems Biology, 2017

2016

Computing with polynomial ordinary differential equations.

[BibT_eX]

[DOI]

J. Complex., 2016

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).

[BibT_eX]

[DOI]

CoRR, 2016

A Framework for Algebraic Characterizations in Recursive Analysis.

[BibT_eX]

[DOI]

Walid Gomaa

CoRR, 2016

Editorial.

[BibT_eX]

[DOI]

Comput., 2016

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Axiomatizing Analog Algorithms.

[BibT_eX]

[DOI]

Nachum Dershowitz

Pierre Néron

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

Computation with perturbed dynamical systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Population Protocols that Correspond to Symmetric Games.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

Trustful Population Protocols.

[BibT_eX]

[DOI]

Jonas Lefèvre

Mikaël Rabie

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Population Protocols on Graphs: A Hierarchy.

[BibT_eX]

[DOI]

Jonas Lefèvre

Proceedings of the Unconventional Computation and Natural Computation, 2013

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Preface.

[BibT_eX]

[DOI]

Gilles Dowek

Nat. Comput., 2012

Towards an Axiomatization of Simple Analog Algorithms.

[BibT_eX]

[DOI]

Nachum Dershowitz

Evgenia Falkovich

Proceedings of the Theory and Applications of Models of Computation, 2012

Computing with Large Populations Using Interactions.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Xavier Koegler

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

On the complexity of solving initial value problems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Learning Equilibria in Games by Stochastic Distributed Algorithms.

[BibT_eX]

[DOI]

Johanne Cohen

Proceedings of the Computer and Information Sciences III, 2012

2011

On the number of binary-minded individuals required to compute sqrt(1/2).

[BibT_eX]

[DOI]

Guillaume Aupy

Theor. Comput. Sci., 2011

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions.

[BibT_eX]

[DOI]

Walid Gomaa

Int. J. Unconv. Comput., 2011

Preface.

[BibT_eX]

[DOI]

Igor Potapov

Int. J. Found. Comput. Sci., 2011

Asymetric Pavlovian Populations

[BibT_eX]

[DOI]

CoRR, 2011

Computing with Pavlovian Populations.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Robust Computations with Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Distributed Learning of Equilibria in a Routing Game.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

Population Protocols that Correspond to Symmetric Games

[BibT_eX]

[DOI]

CoRR, 2009

A Survey on Continuous Time Computations

[BibT_eX]

[DOI]

Manuel Lameiras Campagnolo

CoRR, 2009

On the convergence of population protocols when population goes to infinity.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

A dynamic approach for load balancing.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2008

Playing With Population Protocols

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Distributed Learning of Wardrop Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computing, 7th International Conference, 2008

2007

Polynomial differential equations compute all real computable functions on computable compact intervals.

[BibT_eX]

[DOI]

Manuel Lameiras Campagnolo

J. Complex., 2007

On the Computational Capabilities of Several Models.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006

Implicit complexity over an arbitrary structure: Quantifier alternations.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Recursive Analysis Characterized as a Class of Real Recursive Functions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

How much can analog and hybrid systems be proved (super-)Turing.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.

[BibT_eX]

[DOI]

Manuel Lameiras Campagnolo

Proceedings of the Theory and Applications of Models of Computation, 2006

Proving Positive Almost Sure Termination Under Strategies.

[BibT_eX]

[DOI]

Florent Garnier

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms).

[BibT_eX]

[DOI]

, 2006

2005

Elementarily computable functions over the real numbers and R-sub-recursive functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

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

[BibT_eX]

[DOI]

J. Log. Comput., 2005

From Chemical Rules to Term Rewriting.

[BibT_eX]

[DOI]

Liliana Ibanescu

Hélène Kirchner

Proceedings of the 6th International Workshop on Rule-Based Programming, 2005

Proving Positive Almost-Sure Termination.

[BibT_eX]

[DOI]

Florent Garnier

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004

Real Recursive Functions and Real Extensions of Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

An Analog Characterization of Elementarily Computable Functions over the Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

Rewriting Logic and Probabilities.

[BibT_eX]

[DOI]

Mathieu Hoyrup

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Automated Generation of Kinetic Chemical Mechanisms Using Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2003, 2003

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

The Mortality Problem for Matrices of Low Dimensions.

[BibT_eX]

[DOI]

Michael S. Branicky

Theory Comput. Syst., 2002

Probabilistic Rewrite Strategies. Applications to ELAN.

[BibT_eX]

[DOI]

Claude Kirchner

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

A Generalization of Equational Proof Theory?

[BibT_eX]

[DOI]

Proceedings of the Process Algebra and Probabilistic Methods, 2002

2001

Deciding stability and mortality of piecewise affine dynamical systems.

[BibT_eX]

[DOI]

Vincent D. Blondel

Christos H. Papadimitriou

Pascal Koiran

John N. Tsitsiklis

Theor. Comput. Sci., 2001

The Stability of Saturated Linear Dynamical Systems Is Undecidable.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Verification of Timed Automata Using Rewrite Rules and Strategies

[BibT_eX]

[DOI]

CoRR, 2001

2000

Effective synthesis of switching controllers for linear systems.

[BibT_eX]

[DOI]

Proc. IEEE, 2000

On the Representation of Timed Polyhedra.

[BibT_eX]

[DOI]

Oded Maler

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, Third International Workshop, 2000

1999

Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

Orthogonal Polyhedra: Representation and Computation.

[BibT_eX]

[DOI]

Oded Maler

Amir Pnueli

Proceedings of the Hybrid Systems: Computation and Control, Second International Workshop, 1999

1998

Using Local Planar Geometric Invariants to Match and Model Images of Line Segments.

[BibT_eX]

[DOI]

Patrick Gros

Edmond Boyer

Comput. Vis. Image Underst., 1998

1997

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Computational Power of Dynamical Systems and Hybrid Systems.

[BibT_eX]

[DOI]