Philippe Schnoebelen
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Software top 5%
- Computer Networks and Communications
- Hardware and Architecture top 10%
- Co-authors
- Stéphane DemriMichel BidoitBéatrice BérardPierre McKenzieAlain FinkelFrançois LaroussinieAntoine PetitLaure Petrucci
- Topics
- Formal Methods in Verification (17 papers)Logic, programming, and type systems (13 papers)semigroups and automata theory (4 papers)
- Journals
- SHILAP Revista de lepidopterologíaTheoretical Computer ScienceInformation and Computation
In The Last Decade
Philippe Schnoebelen
19 papers receiving 360 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 267
- Artificial Intelligence 233
- Software 108
- Computer Networks and Communications 50
- Hardware and Architecture 45
Countries citing papers authored by Philippe Schnoebelen
This map shows the geographic impact of Philippe Schnoebelen'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 Philippe Schnoebelen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Schnoebelen more than expected).
Fields of papers citing papers by Philippe Schnoebelen
This network shows the impact of papers produced by Philippe Schnoebelen. 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 Philippe Schnoebelen. The network helps show where Philippe Schnoebelen may publish in the future.
Co-authorship network of co-authors of Philippe Schnoebelen
This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Schnoebelen. A scholar is included among the top collaborators of Philippe Schnoebelen 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 Philippe Schnoebelen. Philippe Schnoebelen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | Generalized Post Embedding Problems | 1 |
| 3 | 8 | |
| 4 | 0 | |
| 5 | Solving Stochastic B\"uchi Games on Infinite Decisive Arenas | 1 |
| 6 | 7 | |
| 7 | Algorithmic Aspects of WQO Theory | 7 |
| 8 | 6 | |
| 9 | 2 | |
| 10 | 2 | |
| 11 | 2 | |
| 12 | 7 | |
| 13 | 1 | |
| 14 | 2 | |
| 15 | 5 | |
| 16 | The Complexity of Temporal Logic Model Checking. | 107 |
| 17 | 65 | |
| 18 | 1 | |
| 19 | 156 | |
| 20 | Specification in CTL+Past, verification in CTL | 1 |
About Philippe Schnoebelen
Philippe Schnoebelen is a scholar working on Software, Computational Theory and Mathematics and Artificial Intelligence, having authored 20 papers that have together received 385 indexed citations. Recurring topics across this work include Formal Methods in Verification (17 papers), Logic, programming, and type systems (13 papers) and semigroups and automata theory (4 papers). The work is most often cited by research in Software (108 citations), Computational Theory and Mathematics (267 citations) and Artificial Intelligence (233 citations). Philippe Schnoebelen has collaborated with scholars based in France, Israel and Germany. Frequent co-authors include Stéphane Demri, Michel Bidoit, Béatrice Bérard, Pierre McKenzie, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Sylvain Schmitz and Nathalie Bertrand. Their work appears in journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Information and Computation.
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.