Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bournez, Olivier
255  Ergebnisse:
Personensuche X
?
1

Reachability Problems: 17th International Conference, RP 20.. 

Lecture Notes in Computer Science, 14235
Bournez, Olivier ; Formenti, Enrico ; Potapov, Igor - 1st ed. 2023 . , 2023
Link: https://doi.org/10.1007/..
 
?
2

A continuous characterization of PSPACE using polynomial or..:

Bournez, Olivier ; Gozzi, Riccardo ; Graça, Daniel S..
Journal of Complexity.  77 (2023)  - p. 101755 , 2023
Link: https://doi.org/10.1016/..
 
?
3

A Characterization of Functions over the Integers Computabl..:

Bournez, Olivier ; Durand, Arnaud
computational complexity.  32 (2023)  2 - p. , 2023
Link: https://doi.org/10.1007/..
 
?
4

Programming with Ordinary Differential Equations: Some Firs..:

, In: Revolutions and Revelations in Computability; Lecture Notes in Computer Science,
Bournez, Olivier - p. 39-51 , 2022
Link: https://doi.org/10.1007/..
 
?
5

A Characterization of Polynomial Time Computable Functions ..:

, In: Lecture Notes in Computer Science; Machines, Computations, and Universality,
Blanc, Manon ; Bournez, Olivier - p. 58-74 , 2022
Link: https://doi.org/10.1007/..
 
?
6

A Survey on Analog Models of Computation:

, In: Theory and Applications of Computability; Handbook of Computability and Complexity in Analysis,
Bournez, Olivier ; Pouly, Amaury - p. 173-226 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Theoretical Computer Science: Computability, Decidability a..:

, In: A Guided Tour of Artificial Intelligence Research,
Bournez, Olivier ; Dowek, Gilles ; Gilleron, Rémi... - p. 1-50 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Theoretical Computer Science: Computational Complexity:

, In: A Guided Tour of Artificial Intelligence Research,
Bournez, Olivier ; Dowek, Gilles ; Gilleron, Rémi... - p. 51-89 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Homonym Population Protocols:

Bournez, Olivier ; Cohen, Johanne ; Rabie, Mikaël
Theory of Computing Systems.  62 (2018)  5 - p. 1318-1346 , 2018
Link: https://doi.org/10.1007/..
 
?
10

Ordinary Differential Equations & Computability:

, In: 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),
Bournez, Olivier - p. 3-5 , 2018
Link: https://doi.org/10.1109/..
 
?
11

Cheap Non-Standard Analysis and Computability: Some Applica..:

, In: 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),
Bournez, Olivier ; Ouazzani, Sabrina - p. 149-156 , 2018
Link: https://doi.org/10.1109/..
 
?
12

On the complexity of bounded time and precision reachabilit..:

Bazille, Hugo ; Bournez, Olivier ; Gomaa, Walid.
Theoretical Computer Science.  735 (2018)  - p. 132-146 , 2018
Link: https://doi.org/10.1016/..
 
?
13

On the functions generated by the general purpose analog co..:

Bournez, Olivier ; Graça, Daniel ; Pouly, Amaury
Information and Computation.  257 (2017)  - p. 34-57 , 2017
Link: https://doi.org/10.1016/..
 
?
14

Polynomial Time Corresponds to Solutions of Polynomial Ordi..:

Bournez, Olivier ; Graça, Daniel S. ; Pouly, Amaury
Journal of the ACM (JACM).  64 (2017)  6 - p. 1-76 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Polynomial Time Corresponds to Solutions of Polynomial Ordi..:

Bournez, Olivier ; Graça, Daniel S. ; Pouly, Amaury
Journal of the ACM.  64 (2017)  6 - p. 1-76 , 2017
Link: https://doi.org/10.1145/..
 
1-15