Nicolas Ollinger

647 total citations
10 papers, 67 citations indexed

About

Nicolas Ollinger is a scholar working on Computational Theory and Mathematics, Molecular Biology and Mathematical Physics. According to data from OpenAlex, Nicolas Ollinger has authored 10 papers receiving a total of 67 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 5 papers in Molecular Biology and 2 papers in Mathematical Physics. Recurrent topics in Nicolas Ollinger's work include Cellular Automata and Applications (9 papers), DNA and Biological Computing (5 papers) and semigroups and automata theory (4 papers). Nicolas Ollinger is often cited by papers focused on Cellular Automata and Applications (9 papers), DNA and Biological Computing (5 papers) and semigroups and automata theory (4 papers). Nicolas Ollinger collaborates with scholars based in France, Chile and United Kingdom. Nicolas Ollinger's co-authors include Gaétan Richard, Johan Mazoyer, Guillaume Theyssier, Christian Choffrut, Juhani Karhumäki, Julien Cassaigne, Eric Goles, Diego Maldonado and Anahí Gajardo and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Nicolas Ollinger

9 papers receiving 67 citations

Peers

Nicolas Ollinger
Nicolas Ollinger
Citations per year, relative to Nicolas Ollinger Nicolas Ollinger (= 1×) peers Guillaume Theyssier

Countries citing papers authored by Nicolas Ollinger

Since Specialization
Citations

This map shows the geographic impact of Nicolas Ollinger's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nicolas Ollinger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicolas Ollinger more than expected).

Fields of papers citing papers by Nicolas Ollinger

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nicolas Ollinger. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nicolas Ollinger. The network helps show where Nicolas Ollinger may publish in the future.

Co-authorship network of co-authors of Nicolas Ollinger

This figure shows the co-authorship network connecting the top 25 collaborators of Nicolas Ollinger. A scholar is included among the top collaborators of Nicolas Ollinger based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nicolas Ollinger. Nicolas Ollinger is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

10 of 10 papers shown
1.
Goles, Eric, et al.. (2019). On the Complexity of the Stability Problem of Binary Freezing Totalistic\n Cellular Automata. arXiv (Cornell University). 1 indexed citations
2.
Cassaigne, Julien, et al.. (2016). A small minimal aperiodic reversible Turing machine. Journal of Computer and System Sciences. 84. 288–301. 1 indexed citations
3.
Gajardo, Anahí, et al.. (2015). Some undecidable problems about the trace-subshift associated to a Turing machine. Discrete Mathematics & Theoretical Computer Science. Vol. 17 no.2(Automata, Logic and Semantics). 1 indexed citations
4.
Mazoyer, Johan, et al.. (2011). Bulking I: An abstract theory of bulking. Theoretical Computer Science. 412(30). 3866–3880. 12 indexed citations
5.
Mazoyer, Johan, et al.. (2011). Bulking II: Classifications of cellular automata. Theoretical Computer Science. 412(30). 3881–3905. 18 indexed citations
6.
Ollinger, Nicolas & Gaétan Richard. (2010). Four states are enough!. Theoretical Computer Science. 412(1-2). 22–32. 13 indexed citations
7.
Ollinger, Nicolas & Gaétan Richard. (2009). Automata on the plane vs particles and collisions. Theoretical Computer Science. 410(27-29). 2767–2773.
8.
Ollinger, Nicolas & Gaétan Richard. (2009). A Particular Universal Cellular Automaton. SHILAP Revista de lepidopterología. 1. 205–214. 4 indexed citations
9.
Ollinger, Nicolas. (2009). Intrinsically Universal Cellular Automata. arXiv (Cornell University). 199–204. 3 indexed citations
10.
Choffrut, Christian, Juhani Karhumäki, & Nicolas Ollinger. (2002). The commutation of finite sets: a challenging problem. Theoretical Computer Science. 273(1-2). 69–79. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026