Paul-André Melliès
About
In The Last Decade
Paul-André Melliès
32 papers receiving 394 citations
Peers
Comparison fields: 5 of 30
- Artificial Intelligence 377
- Computational Theory and Mathematics 269
- Computer Networks and Communications 43
- Mathematical Physics 40
- Geometry and Topology 28
Countries citing papers authored by Paul-André Melliès
This map shows the geographic impact of Paul-André Melliès'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 Paul-André Melliès with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul-André Melliès more than expected).
Fields of papers citing papers by Paul-André Melliès
This network shows the impact of papers produced by Paul-André Melliès. 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 Paul-André Melliès. The network helps show where Paul-André Melliès may publish in the future.
Co-authorship network of co-authors of Paul-André Melliès
This figure shows the co-authorship network connecting the top 25 collaborators of Paul-André Melliès. A scholar is included among the top collaborators of Paul-André Melliès 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 Paul-André Melliès. Paul-André Melliès is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | Concurrent Separation Logic Meets Template Games | arXiv (Cornell University) | Paul-André Melliès et al. | 1 |
| 2 | Higher-order parity automata | Paul-André Melliès | 1 | |
| 3 | Higher-order parity automata | Paul-André Melliès | 0 | |
| 4 | Dialogue Categories and Chiralities | Publications of the Research Institute for Mathematical Sciences | Paul-André Melliès | 4 |
| 5 | A micrological study of negation | Annals of Pure and Applied Logic | Paul-André Melliès | 1 |
| 6 | Tensorial logic with colours and higher-order model checking. | arXiv (Cornell University) | Paul-André Melliès et al. | 1 |
| 7 | The parametric continuation monad | Mathematical Structures in Computer Science | Paul-André Melliès | 6 |
| 8 | A Fibrational Account of Local States | HAL (Le Centre pour la Communication Scientifique Directe) | Paul-André Melliès et al. | 1 |
| 9 | Game Semantics in String Diagrams | Paul-André Melliès | 17 | |
| 10 | Monads with arities and their associated theories | Journal of Pure and Applied Algebra | Clemens Berger, Paul-André Melliès et al. | 34 |
| 11 | Interactive models of computation and program behavior | Pierre-Louis Curien, Hugo Herbelin et al. | 6 | |
| 12 | Resource modalities in tensor logic | Annals of Pure and Applied Logic | Paul-André Melliès, Nicolas Tabareau | 11 |
| 13 | Asynchronous games 2: The true concurrency of innocence | Theoretical Computer Science | Paul-André Melliès | 37 |
| 14 | Computer Science Logic | Lecture notes in computer science | Paul-André Melliès | 4 |
| 15 | Sequential algorithms and strongly stable functions | Theoretical Computer Science | Paul-André Melliès | 12 |
| 16 | Semantic types | ACM SIGPLAN Notices | Jérôme Vouillon, Paul-André Melliès | 1 |
| 17 | Comparing hierarchies of types in models of linear logic | Information and Computation | Paul-André Melliès | 7 |
| 18 | Concurrent games and full completeness | Samson Abramsky, Paul-André Melliès | 72 | |
| 19 | A stability theorem in rewriting theory | Paul-André Melliès | 5 | |
| 20 | A Generic Normalisation Proof for Pure Type Systems | HAL (Le Centre pour la Communication Scientifique Directe) | Paul-André Melliès, Benjamin Werner | 0 |
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.