The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Olivier Bournez" ( http://dblp.L3S.de/Authors/Olivier_Bournez )

  Author page on DBLP  Author page in RDF  Community of Olivier Bournez in ASPL-2

Publication years (Num. hits)
1996-2002 (15) 2003-2006 (18) 2007-2011 (20) 2012-2015 (16) 2016-2017 (17) 2018-2019 (10)
Publication types (Num. hits)
article(52) book(1) inproceedings(42) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 97 publication records. Showing 96 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Olivier Bournez, Sabrina Ouazzani Continuous Ordinary Differential Equations and Infinite Time Turing Machines. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Olivier Bournez, Arnaud Durand 0001 Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly On the complexity of bounded time and precision reachability for piecewise affine systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Johanne Cohen, Mikaël Rabie Homonym Population Protocols. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Amaury Pouly A Survey on Analog Models of Computation. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Olivier Bournez, Arnaud Durand 0001, Sabrina Ouazzani Recursion schemes, discrete differential equations and characterization of polynomial time computation. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Olivier Bournez, Sabrina Ouazzani Cheap Non-standard Analysis and Computability. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov Reachability Problems for One-Dimensional Piecewise Affine Maps. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olivier Bournez Ordinary Differential Equations & Computability. Search on Bibsonomy SYNASC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Sabrina Ouazzani Cheap Non-Standard Analysis and Computability: Some Applications. Search on Bibsonomy SYNASC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Amaury Pouly A Universal Ordinary Differential Equation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly On the functions generated by the general purpose analog computer. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Amaury Pouly A Universal Ordinary Differential Equation. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. Search on Bibsonomy CMSB The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Computing with Polynomial Ordinary Differential Equations. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Walid Gomaa, Emmanuel Hainry A Framework for Algebraic Characterizations in Recursive Analysis. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly On the Functions Generated by the General Purpose Analog Computer. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Johanne Cohen, Mikaël Rabie Homonym Population Protocols. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Nachum Dershowitz, Pierre Néron Axiomatizing Analog Algorithms. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Computing with polynomial ordinary differential equations. Search on Bibsonomy J. Complexity The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo Editorial. Search on Bibsonomy Computability The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly 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. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Nachum Dershowitz, Pierre Néron Axiomatizing Analog Algorithms. Search on Bibsonomy CiE The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. Search on Bibsonomy MACIS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Johanne Cohen, Mikaël Rabie Homonym Population Protocols. Search on Bibsonomy NETYS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. Search on Bibsonomy RP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie Population Protocols that Correspond to Symmetric Games. Search on Bibsonomy IJUC The full citation details ... 2013 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Emmanuel Hainry Computation with perturbed dynamical systems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. Search on Bibsonomy TAMC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jonas Lefèvre, Mikaël Rabie Trustful Population Protocols. Search on Bibsonomy DISC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jonas Lefèvre Population Protocols on Graphs: A Hierarchy. Search on Bibsonomy UCNC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly, Ning Zhong 0002 Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. Search on Bibsonomy CiE The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly On the complexity of solving initial value problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Amaury Pouly, Olivier Bournez, Daniel S. Graça Turing machines can be efficiently simulated by the General Purpose Analog Computer. Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Olivier Bournez, Gilles Dowek Preface. Search on Bibsonomy Natural Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich Towards an Axiomatization of Simple Analog Algorithms. Search on Bibsonomy TAMC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Pierre Fraigniaud, Xavier Koegler Computing with Large Populations Using Interactions. Search on Bibsonomy MFCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Johanne Cohen Learning Equilibria in Games by Stochastic Distributed Algorithms. Search on Bibsonomy ISCIS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly On the complexity of solving initial value problems. Search on Bibsonomy ISSAC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Walid Gomaa, Emmanuel Hainry Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Search on Bibsonomy IJUC The full citation details ... 2011 DBLP  BibTeX  RDF
1Guillaume Aupy, Olivier Bournez On the number of binary-minded individuals required to compute sqrt(1/2). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie Asymetric Pavlovian Populations Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Olivier Bournez, Igor Potapov Preface. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Amaury Pouly Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie Computing with Pavlovian Populations. Search on Bibsonomy OPODIS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Daniel S. Graça, Emmanuel Hainry Robust Computations with Dynamical Systems. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton Distributed Learning of Equilibria in a Routing Game. Search on Bibsonomy Parallel Processing Letters The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler On the convergence of population protocols when population goes to infinity. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler Population Protocols that Correspond to Symmetric Games Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Olivier Bournez, Johanne Cohen Learning Equilibria in Games by Stochastic Distributed Algorithms Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler On the Convergence of Population Protocols When Population Goes to Infinity Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Olivier Bournez, Manuel Lameiras Campagnolo A Survey on Continuous Time Computations Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner Verification of Timed Automata Using Rewrite Rules and Strategies Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen A dynamic approach for load balancing. Search on Bibsonomy VALUETOOLS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Igor Potapov (eds.) Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings Search on Bibsonomy RP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler Playing With Population Protocols Search on Bibsonomy CSP The full citation details ... 2008 DBLP  BibTeX  RDF
1Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen Distributed Learning of Wardrop Equilibria. Search on Bibsonomy UC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry Polynomial differential equations compute all real computable functions on computable compact intervals. Search on Bibsonomy J. Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Emmanuel Hainry On the Computational Capabilities of Several Models. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Emmanuel Hainry Recursive Analysis Characterized as a Class of Real Recursive Functions. Search on Bibsonomy Fundam. Inform. The full citation details ... 2006 DBLP  BibTeX  RDF
1Olivier Bournez, Liliana Ibanescu, Hélène Kirchner From Chemical Rules to Term Rewriting. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez How much can analog and hybrid systems be proved (super-)Turing. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Implicit complexity over an arbitrary structure: Quantifier alternations. Search on Bibsonomy Inf. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms). Search on Bibsonomy 2006   RDF
1Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Florent Garnier Proving Positive Almost Sure Termination Under Strategies. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Emmanuel Hainry Elementarily computable functions over the real numbers and R-sub-recursive functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. Search on Bibsonomy J. Log. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Florent Garnier Proving Positive Almost-Sure Termination. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Emmanuel Hainry An Analog Characterization of Elementarily Computable Functions over the Real Numbers. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Emmanuel Hainry Real Recursive Functions and Real Extensions of Recursive Functions. Search on Bibsonomy MCU The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. Search on Bibsonomy IFIP TCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. Search on Bibsonomy FoSSaCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Mathieu Hoyrup Rewriting Logic and Probabilities. Search on Bibsonomy RTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. Search on Bibsonomy RTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Michael S. Branicky The Mortality Problem for Matrices of Low Dimensions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Olivier Bournez A Generalization of Equational Proof Theory? Search on Bibsonomy PAPM-PROBMIV The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Claude Kirchner Probabilistic Rewrite Strategies. Applications to ELAN. Search on Bibsonomy RTA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis Deciding stability and mortality of piecewise affine dynamical systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner Verification of Timed Automata Using Rewrite Rules and Strategies Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Olivier Bournez, Oded Maler On the Representation of Timed Polyhedra. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Eugene Asarin, Thao Dang, Oded Maler, Olivier Bournez Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. Search on Bibsonomy HSCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Olivier Bournez Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Olivier Bournez Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Oded Maler, Amir Pnueli Orthogonal Polyhedra: Representation and Computation. Search on Bibsonomy HSCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Patrick Gros, Olivier Bournez, Edmond Boyer Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. Search on Bibsonomy Computer Vision and Image Understanding The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Olivier Bournez Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Michel Cosnard On the Computational Power of Dynamical Systems and Hybrid Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #96 of 96 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license