Julien Narboux

498 total citations
26 papers, 145 citations indexed

About

Julien Narboux is a scholar working on Artificial Intelligence, Theoretical Computer Science and Geometry and Topology. According to data from OpenAlex, Julien Narboux has authored 26 papers receiving a total of 145 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Artificial Intelligence, 13 papers in Theoretical Computer Science and 12 papers in Geometry and Topology. Recurrent topics in Julien Narboux's work include Logic, programming, and type systems (20 papers), History and Theory of Mathematics (13 papers) and Mathematics and Applications (12 papers). Julien Narboux is often cited by papers focused on Logic, programming, and type systems (20 papers), History and Theory of Mathematics (13 papers) and Mathematics and Applications (12 papers). Julien Narboux collaborates with scholars based in France, Serbia and Germany. Julien Narboux's co-authors include Predrag Janičić, Pascal Schreck, Christian Urban, Michael Beeson, Freek Wiedijk, David Braun and Cristel Pelsser and has published in prestigious journals such as Journal of Automated Reasoning, Computational Geometry and Journal of Symbolic Computation.

In The Last Decade

Julien Narboux

22 papers receiving 141 citations

Peers

Julien Narboux
Wanda Szmielew United States
Petr Vojtěchovský United States
Jaap van Oosten Netherlands
Lenny Fukshansky United States
Sava Krstić United States
Julien Narboux
Citations per year, relative to Julien Narboux Julien Narboux (= 1×) peers Assia Mahboubi

Countries citing papers authored by Julien Narboux

Since Specialization
Citations

This map shows the geographic impact of Julien Narboux'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 Julien Narboux with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Julien Narboux more than expected).

Fields of papers citing papers by Julien Narboux

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Julien Narboux. 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 Julien Narboux. The network helps show where Julien Narboux may publish in the future.

Co-authorship network of co-authors of Julien Narboux

This figure shows the co-authorship network connecting the top 25 collaborators of Julien Narboux. A scholar is included among the top collaborators of Julien Narboux 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 Julien Narboux. Julien Narboux is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Janičić, Predrag, et al.. (2024). Automated Completion of Statements and Proofs in Synthetic Geometry: an Approach based on Constraint Solving. Electronic Proceedings in Theoretical Computer Science. 398. 21–37. 2 indexed citations
2.
Narboux, Julien, et al.. (2024). Proceedings 12th International Workshop on Theorem proving components for Educational software. Electronic Proceedings in Theoretical Computer Science. 400.
3.
Janičić, Predrag & Julien Narboux. (2023). Automated generation of illustrated proofs in geometry and beyond. Annals of Mathematics and Artificial Intelligence. 91(6). 797–820.
4.
Narboux, Julien, et al.. (2021). La cordée de la réussite « décodeuses d'informatique ». SPIRE - Sciences Po Institutional REpository. 87–89. 1 indexed citations
5.
Janičić, Predrag & Julien Narboux. (2021). Automated Generation of Illustrations for Synthetic Geometry Proofs. Electronic Proceedings in Theoretical Computer Science. 352. 91–102. 1 indexed citations
6.
Narboux, Julien, et al.. (2018). Formalization of the arithmetization of Euclidean plane geometry and applications. Journal of Symbolic Computation. 90. 149–168. 12 indexed citations
7.
Narboux, Julien, et al.. (2018). From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry. EPiC series in computing. 39. 14. 3 indexed citations
8.
Narboux, Julien, et al.. (2017). Parallel Postulates and Continuity Axioms: A Mechanized Study in Intuitionistic Logic Using Coq. Journal of Automated Reasoning. 62(1). 1–68. 9 indexed citations
9.
Narboux, Julien, et al.. (2016). From Hilbert to Tarski. SPIRE - Sciences Po Institutional REpository. 19. 5 indexed citations
10.
Narboux, Julien, et al.. (2016). A Synthetic Proof of Pappus’ Theorem in Tarski’s Geometry. Journal of Automated Reasoning. 58(2). 209–230. 10 indexed citations
11.
Narboux, Julien & David Braun. (2016). Towards a Certified Version of the Encyclopedia of Triangle Centers. Mathematics in Computer Science. 10(1). 57–73. 4 indexed citations
12.
Beeson, Michael, et al.. (2015). Herbrand's Theorem and Non-Euclidean Geometry. univOAK (4 institutions : Université de Strasbourg, Université de Haute Alsace, INSA Strasbourg, Bibliothèque Nationale et Universitaire de Strasbourg). 1 indexed citations
13.
Narboux, Julien, et al.. (2015). Parallel postulates and decidability of intersection of lines: a mechanized study within Tarski's system of geometry. 2 indexed citations
14.
Narboux, Julien, et al.. (2012). A case study in formalizing projective geometry in Coq: Desargues theorem. Computational Geometry. 45(8). 406–424. 7 indexed citations
15.
Urban, Christian & Julien Narboux. (2009). Formal SOS-Proofs for the Lambda-Calculus. Electronic Notes in Theoretical Computer Science. 247. 139–155. 1 indexed citations
16.
Narboux, Julien, et al.. (2009). Formalizing Desargues' theorem in Coq using ranks. HAL (Le Centre pour la Communication Scientifique Directe). 1110–1115. 5 indexed citations
17.
Narboux, Julien & Christian Urban. (2008). Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking. Electronic Notes in Theoretical Computer Science. 196. 3–18. 8 indexed citations
18.
Narboux, Julien & Christian Urban. (2007). Nominal Formalisations of Typical SOS Proofs. 1 indexed citations
19.
Narboux, Julien. (2007). A Graphical User Interface for Formal Proofs in Geometry. Journal of Automated Reasoning. 39(2). 161–180. 22 indexed citations
20.
Narboux, Julien. (2007). GeoProof: A user interface for formal proofs in geometry. HAL (Le Centre pour la Communication Scientifique Directe). 2 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