 | 2011 |
|---|
| 12 |       | Olivier Bournez,
Walid Gomaa,
Emmanuel Hainry:
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions.
IJUC 7(5): 331-351 (2011) |
| 2010 |
|---|
| 11 | | Hugo Férée,
Emmanuel Hainry,
Mathieu Hoyrup,
Romain Péchoux:
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.
ISAAC (1) 2010: 291-303 |
| 10 | | Olivier Bournez,
Daniel S. Graça,
Emmanuel Hainry:
Robust Computations with Dynamical Systems.
MFCS 2010: 198-208 |
| 2008 |
|---|
| 9 | | Emmanuel Hainry:
Reachability in Linear Dynamical Systems.
CiE 2008: 241-250 |
| 8 | | Emmanuel Hainry:
Computing Omega-Limit Sets in Linear Dynamical Systems.
UC 2008: 83-95 |
| 2007 |
|---|
| 7 | | Olivier Bournez,
Emmanuel Hainry:
On the Computational Capabilities of Several Models.
MCU 2007: 12-23 |
| 6 | | Olivier Bournez,
Manuel Lameiras Campagnolo,
Daniel S. Graça,
Emmanuel Hainry:
Polynomial differential equations compute all real computable functions on computable compact intervals.
J. Complexity 23(3): 317-335 (2007) |
| 2006 |
|---|
| 5 | | Olivier 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.
TAMC 2006: 631-643 |
| 4 | | Olivier Bournez,
Emmanuel Hainry:
Recursive Analysis Characterized as a Class of Real Recursive Functions.
Fundam. Inform. 74(4): 409-433 (2006) |
| 2005 |
|---|
| 3 | | Olivier Bournez,
Emmanuel Hainry:
Elementarily computable functions over the real numbers and R-sub-recursive functions.
Theor. Comput. Sci. 348(2-3): 130-147 (2005) |
| 2004 |
|---|
| 2 | | Olivier Bournez,
Emmanuel Hainry:
An Analog Characterization of Elementarily Computable Functions over the Real Numbers.
ICALP 2004: 269-280 |
| 1 | | Olivier Bournez,
Emmanuel Hainry:
Real Recursive Functions and Real Extensions of Recursive Functions.
MCU 2004: 116-127 |
Data released under the ODC-BY 1.0 license — See also our legal information page