Emmanuel Hainry
14
Documents
Affiliations actuelles
- 529408
- 413289
- 206040
Identifiants chercheurs
- emmanuel-hainry
- 0000-0002-9750-0460
- IdRef : 114622396
Publications
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 14
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 4
- 1
- 1
- 1
- 1
- 1
|
Computation with perturbed dynamical systemsJournal of Computer and System Sciences, 2013, 79 (5), pp.714-724. ⟨10.1016/j.jcss.2013.01.025⟩
Article dans une revue
hal-00643634v2
|
|
Algebraic Characterizations of Complexity-Theoretic Classes of Real FunctionsInternational Journal of Unconventional Computing, 2011, 7 (5), pp.331-351
Article dans une revue
hal-00644361v1
|
|
Polynomial differential equations compute all real computable functions on computable compact intervalsJournal of Complexity, 2007, 23 (3), pp.317--335
Article dans une revue
inria-00102947v2
|
Recursive Analysis Characterized as a Class of Real Recursive FunctionsFundamenta Informaticae, 2006, 74 (4), pp.409-433
Article dans une revue
inria-00000515v1
|
|
Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive FunctionsTheoretical Computer Science, 2005, 348 (2-3), pp.130--147. ⟨10.1016/j.tcs.2005.09.010⟩
Article dans une revue
inria-00000518v1
|
|
Robust computations with dynamical systems35th international symposium on Mathematical Foundations of Computer Science - MFCS 2010, Aug 2010, Brno, Czech Republic. pp.198-208, ⟨10.1007/978-3-642-15155-2_19⟩
Communication dans un congrès
inria-00522029v1
|
|
Implicit complexity in recursive analysisTenth International Workshop on Logic and Computational Complexity - LCC'09, Aug 2009, Los Angeles, United States
Communication dans un congrès
inria-00429964v1
|
On the Computational Capabilities of Several Models5th International Conference on Machines, Computations and Universality - MCU 2007, Sep 2007, Orléans, France. pp.12-23
Communication dans un congrès
inria-00182738v1
|
|
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine
Communication dans un congrès
inria-00102946v1
|
|
An analog Characterization of Elementarily Computable Functions Over the Real Numbers2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p
Communication dans un congrès
inria-00099897v1
|
|
Real Recursive Functions and Real Extensions of Recursive FunctionsMachines and Universal Computations - MCU'2004, 2004, Saint-Petersburg, Russia, 12 p
Communication dans un congrès
inria-00100053v1
|
|
An analog Characterization of Elementarily Computable Functions Over the Real Numbers31st International Colloqiuim on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, pp.269-280
Communication dans un congrès
inria-00100054v1
|
|
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions[Research Report] 2009
Rapport
inria-00421561v1
|
|
Elementarily Computable Functions Over the Real Numbers and $\mathbb{R}$-Sub-Recursive Functions[Intern report] A04-R-301 || bournez04f, 2004, 22 p
Rapport
inria-00107812v1
|