Joël Ouaknine
- Computational Theory and Mathematics top 0.5%
- Artificial Intelligence top 5%
- Software top 2%
- Hardware and Architecture top 5%
- Computer Networks and Communications top 10%
- Co-authors
- James WorrellEdmund M. ClarkeInês LynceSagar ChakiMichael MisloveOfer StrichmanDaniel KroeningOlaf Stursberg
- Topics
- Formal Methods in Verification (59 papers)Logic, programming, and type systems (34 papers)semigroups and automata theory (23 papers)
- Partner nations
- United KingdomGermanyUnited States
In The Last Decade
Joël Ouaknine
75 papers receiving 724 citations
Peers
Comparison fields: 5 of 48
- Computational Theory and Mathematics 622
- Artificial Intelligence 401
- Software 271
- Hardware and Architecture 107
- Computer Networks and Communications 81
Countries citing papers authored by Joël Ouaknine
This map shows the geographic impact of Joël Ouaknine'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 Joël Ouaknine with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joël Ouaknine more than expected).
Fields of papers citing papers by Joël Ouaknine
This network shows the impact of papers produced by Joël Ouaknine. 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 Joël Ouaknine. The network helps show where Joël Ouaknine may publish in the future.
Co-authorship network of co-authors of Joël Ouaknine
This figure shows the co-authorship network connecting the top 25 collaborators of Joël Ouaknine. A scholar is included among the top collaborators of Joël Ouaknine 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 Joël Ouaknine. Joël Ouaknine is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 7 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 1 | |
| 8 | 1 | |
| 9 | 3 | |
| 10 | 17 | |
| 11 | The CR-UAV Problem is PSPACE-Complete. | 2 |
| 12 | Effective Positivity Problems for Simple Linear Recurrence Sequences. | 1 |
| 13 | A STATIC ANALYSIS FRAMEWORK FOR LIVELOCK FREEDOM IN CSP ∗ | 4 |
| 14 | 7 | |
| 15 | Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems | 7 |
| 16 | 41 | |
| 17 | 3 | |
| 18 | Sudoku as a SAT Problem. | 53 |
| 19 | Timed CSP = closed timed ε-automata | 13 |
| 20 | Model-Checking Temporal Behaviour in CSP. | 2 |
About Joël Ouaknine
Joël Ouaknine is a scholar working on Software, Computational Theory and Mathematics and Theoretical Computer Science, having authored 84 papers that have together received 787 indexed citations. Recurring topics across this work include Formal Methods in Verification (59 papers), Logic, programming, and type systems (34 papers) and semigroups and automata theory (23 papers). The work is most often cited by research in Software (271 citations), Computational Theory and Mathematics (622 citations) and Hardware and Architecture (107 citations). Joël Ouaknine has collaborated with scholars based in United Kingdom, Germany and United States. Frequent co-authors include James Worrell, Edmund M. Clarke, Inês Lynce, Sagar Chaki, Michael Mislove, Ofer Strichman, Daniel Kroening, Olaf Stursberg, Zhi Han and Ansgar Fehnker. Their work appears in journals such as Mathematics of Computation, Journal of the ACM and Theoretical Computer Science.
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.