The following pages link to Olivier Bournez (Q306693):
Displaying 50 items.
- (Q197782) (redirect page) (← links)
- Computing with polynomial ordinary differential equations (Q306694) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\) (Q533865) (← links)
- Homonym population protocols (Q722223) (← links)
- On the convergence of population protocols when population goes to infinity (Q1036527) (← links)
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
- Some bounds on the computational power of piecewise constant derivative systems (Q1277365) (← links)
- On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
- On the functions generated by the general purpose analog computer (Q1680506) (← links)
- The mortality problem for matrices of low dimensions (Q1849606) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- Programming with ordinary differential equations: some first steps towards a programming language (Q2104250) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- On the complexity of bounded time and precision reachability for piecewise affine systems (Q2636516) (← links)
- (Q2754197) (← links)
- Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains (Q2807868) (← links)
- (Q2863876) (← links)
- Towards an Axiomatization of Simple Analog Algorithms (Q2898065) (← links)
- Computing with Large Populations Using Interactions (Q2912723) (← links)
- Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains (Q3088037) (← links)
- Reachability Problems for One-Dimensional Piecewise Affine Maps (Q3177337) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- (Q3416089) (← links)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Q3447692) (← links)
- Proving Positive Almost Sure Termination Under Strategies (Q3527308) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Robust Computations with Dynamical Systems (Q3586084) (← links)
- On the Computational Capabilities of Several Models (Q3608466) (← links)
- (Q4249563) (← links)
- (Q4417859) (← links)
- (Q4447221) (← links)
- (Q4447223) (← links)
- (Q4501556) (← links)
- Some bounds on the computational power of piecewise constant derivative systems (extended abstract) (Q4571947) (← links)
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version) (Q4598250) (← links)
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Q4640346) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
- (Q4673422) (← links)
- (Q4808751) (← links)
- (Q4813206) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- (Q4953376) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- A Universal Ordinary Differential Equation (Q5109517) (← links)
- A Universal Ordinary Differential Equation (Q5111448) (← links)
