Bournez, Olivier

1. On the Convergence of Population Protocols When Population Goes to Infinity
   2009/07/17 by Bournez, Olivier, Chassaing, Philippe, Cohen, Johanne +2 · 1 citation
   #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
2. Recursion schemes, discrete differential equations and characterization of polynomial time computation
   2018/10/04 by Olivier Bournez, Arnaud Durand, Bournez, Olivier +2 · 2 citations
   Computer Science · #Computability, Logic, AI Algorithms #Cellular Automata and Applications #semigroups and automata theory
3. A Survey on Analog Models of Computation
   2018/05/14 by Bournez, Olivier, Pouly, Amaury · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
4. A characterization of functions over the integers computable in polynomial time using discrete differential equations
   2022/09/25 by Olivier Bournez, Arnaud Durand, Bournez, Olivier +1 · 2 citations
   Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #semigroups and automata theory
5. The complexity of computing in continuous time: space complexity is precision
   2024/03/04 by Manon Blanc, Blanc, Manon, Olivier Bournez +1 · 1 citation
   Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences