| 2026 | STOC | What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing. | Llia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | ICALP | Deterministic Even-Cycle Detection in Broadcast CONGEST. | Pierre Fraigniaud, Mal Luce, Frdric Magniez, Ioan Todinca |
| 2025 | PODC | Solvability Characterization for General Three-Process Tasks. | Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2025 | PODC | Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. | Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikal Rabie |
| 2025 | PODC | Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | STACS | Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. | Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz |
| 2025 | SIROCCO | On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. | Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2024 | PODC | The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. | Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2024 | PODC | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. | Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2024 | PODC | Even-Cycle Detection in the Randomized and Quantum CONGEST Model. | Pierre Fraigniaud, Mal Luce, Frdric Magniez, Ioan Todinca |
| 2024 | SIROCCO | Non-negotiating Distributed Computing. | Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2024 | TAMC | Source-Oblivious Broadcast. | Pierre Fraigniaud, Hovhannes A. Harutyunyan |
| 2023 | OPODIS | Distributed Partial Coloring via Gradual Rounding. | Avinandan Das, Pierre Fraigniaud, Adi Rosn |
| 2023 | SIROCCO | On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. | Pierre Fraigniaud, Mal Luce, Ioan Todinca |
| 2023 | SIROCCO | Energy-Efficient Distributed Algorithms for Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2023 | WG | Parameterized Complexity of Broadcasting in Graphs. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2022 | OPODIS | Computing Power of Hybrid Models in Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martn Ros-Wilson, Ioan Todinca |
| 2022 | PODC | 2022 Principles of Distributed Computing Doctoral Dissertation Award. | Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld |
| 2022 | PODC | Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. | Pierre Fraigniaud, Patrick Lambein-Monette, Mikal Rabie |
| 2022 | PODC | A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. | Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2022 | SIROCCO | A Meta-Theorem for Distributed Certification. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2021 | AAAI | Present-Biased Optimization. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2021 | PODC | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2021 | PODC | The Topology of Randomized Symmetry-Breaking Distributed Computing. | Pierre Fraigniaud, Ran Gelles, Zvi Lotker |
| 2021 | SSS | How Do Mobile Agents Benefit from Randomness? | Pierre Fraigniaud |
| 2020 | ICALP | The Topology of Local Computing in Networks. | Pierre Fraigniaud, Ami Paz |
| 2020 | INFOCOM | Simple and Fast Distributed Computation of Betweenness Centrality. | Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz |
| 2020 | PODC | Compact Distributed Certification of Planar Graphs. | Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, ric Rmila, Ioan Todinca |
| 2020 | SIROCCO | Distributed Testing of Distance-k Colorings. | Pierre Fraigniaud, Magns M. Halldrsson, Alexandre Nolin |
| 2019 | SIROCCO | A Topological Perspective on Distributed Network Algorithms. | Armando Castaeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers |
| 2019 | SIROCCO | On Distributed Merlin-Arthur Decision Protocols. | Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca |
| 2019 | SSS | Synchronous t-Resilient Consensus in Arbitrary Graphs. | Armando Castaeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers |
| 2019 | SSS | Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. | Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikal Rabie |
| 2018 | OPODIS | Equilibria of Games in Networks for Local Tasks. | Simon Collet, Pierre Fraigniaud, Paolo Penna |
| 2018 | WWW | Preferential Attachment as a Unique Equilibrium. | Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg |
| 2017 | STACS | What Can Be Verified Locally?. | Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti |
| 2017 | SPAA | Distributed Detection of Cycles. | Pierre Fraigniaud, Dennis Olivetti |
| 2016 | CONCUR | Decentralized Asynchronous Crash-Resilient Runtime Verification. | Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers |
| 2016 | FOCS | Local Conflict Coloring. | Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski |
| 2016 | ICALP | A Hierarchy of Local Decision. | Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen |
| 2016 | ISoLA | Challenges in Fault-Tolerant Distributed Runtime Verification. | Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2016 | LATIN | Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2016 | PODC | Brief Announcement: Asynchronous Coordination with Constraints and Preferences. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2016 | PODC | Noisy Rumor Spreading and Plurality Consensus. | Pierre Fraigniaud, Emanuele Natale |
| 2016 | STOC | Parallel exhaustive search without coordination. | Pierre Fraigniaud, Amos Korman, Yoav Rodeh |
| 2016 | SIROCCO | Sparsifying Congested Cliques and Core-Periphery Networks. | Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti |
| 2016 | SIROCCO | Asynchronous Coordination Under Preferences and Constraints. | Armando Castaeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy |
| 2016 | SSS | Perfect Failure Detection with Very Few Bits. | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord |
| 2015 | ICDCS | Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. | Llia Blin, Pierre Fraigniaud |
| 2015 | PODC | Randomized Proof-Labeling Schemes. | Mor Baruch, Pierre Fraigniaud, Boaz Patt-Shamir |
| 2015 | SPAA | Randomized Local Network Computing. | Laurent Feuilloley, Pierre Fraigniaud |
| 2015 | SIROCCO | Node Labels in Local Decision. | Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela |
| 2014 | OPODIS | The Opinion Number of Set-Agreement. | Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers |
| 2014 | RV | On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2014 | SSS | On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. | Llia Blin, Pierre Fraigniaud, Boaz Patt-Shamir |
| 2014 | WG | Distributedly Testing Cycle-Freeness. | Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu |
| 2013 | ESA | Rumor Spreading in Random Evolving Graphs. | Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri |
| 2013 | PODC | What can be decided locally without identifiers? | Pierre Fraigniaud, Mika Gs, Amos Korman, Jukka Suomela |
| 2013 | SSS | Local Decision and Verification with Bounded-Size Outputs. | Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc |
| 2012 | LATIN | Decidability Classes for Mobile Agents Computing. | Pierre Fraigniaud, Andrzej Pelc |
| 2012 | MFCS | Computing with Large Populations Using Interactions. | Olivier Bournez, Pierre Fraigniaud, Xavier Koegler |
| 2012 | OPODIS | On the Impact of Identifiers on Local Decision. | Pierre Fraigniaud, Magns M. Halldrsson, Amos Korman |
| 2012 | PODC | Brief announcement: what can be computed without communication? | Heger Arfaoui, Pierre Fraigniaud |
| 2012 | SIROCCO | What Can Be Computed without Communications? | Heger Arfaoui, Pierre Fraigniaud |
| 2012 | SIROCCO | Notions of Connectivity in Overlay Networks. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg |
| 2012 | TAMC | The Worst Case Behavior of Randomized Gossip. | Herv Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rmi de Joannis de Verclos |
| 2011 | FOCS | Local Distributed Decision. | Pierre Fraigniaud, Amos Korman, David Peleg |
| 2010 | ICALP | Informative Labeling Schemes. | Pierre Fraigniaud |
| 2010 | ICDT | Provenance for database transformations. | Pierre Fraigniaud |
| 2010 | PODC | Distributed computational complexities: are you volvo-addicted or nascar-obsessed? | Pierre Fraigniaud |
| 2010 | SODA | Compact Ancestry Labeling Schemes for XML Trees. | Pierre Fraigniaud, Amos Korman |
| 2010 | STOC | On the searchability of small-world networks with arbitrary underlying structure. | Pierre Fraigniaud, George Giakkoupis |
| 2010 | STOC | An optimal ancestry scheme and small universal posets. | Pierre Fraigniaud, Amos Korman |
| 2010 | SPAA | On the bit communication complexity of randomized rumor spreading. | Pierre Fraigniaud, George Giakkoupis |
| 2010 | SPAA | Delays induce an exponential memory gap for rendezvous in trees. | Pierre Fraigniaud, Andrzej Pelc |
| 2009 | ICALP | Online Computation with Advice. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2009 | PODC | Parsimonious flooding in dynamic graphs. | Herv Baumann, Pierluigi Crescenzi, Pierre Fraigniaud |
| 2009 | PODC | The effect of power-law degrees on the navigability of small worlds: [extended abstract]. | Pierre Fraigniaud, George Giakkoupis |
| 2009 | SPAA | On randomized representations of graphs using short labels. | Pierre Fraigniaud, Amos Korman |
| 2009 | SIROCCO | Sub-linear Universal Spatial Gossip Protocols. | Herv Baumann, Pierre Fraigniaud |
| 2009 | WAOA | On the Additive Constant of the | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2008 | ICALP | Networks Become Navigable as Nodes Move and Forget. | Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar |
| 2008 | INFOCOM | The Inframetric Model for the Internet. | Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot |
| 2008 | PODC | Forget him and keep on moving. | Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar |
| 2008 | SPAA | Polylogarithmic network navigability using compact metrics with small stretch. | Pierre Fraigniaud, Cyril Gavoille |
| 2008 | SIROCCO | Recovering the Long-Range Links in Augmented Graphs. | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
| 2007 | ESA | Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. | Pierre Fraigniaud |
| 2007 | ICALP | Distributed Computing with Advice: Information Sensitivity of Graph Coloring. | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
| 2007 | SPAA | Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. | Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker |
| 2007 | SPAA | Local MST computation with short advice. | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
| 2006 | ESA | A Doubling Dimension Threshold | Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker |
| 2006 | EuroPar | Topic 12: Theory and Algorithms for Parallel Computation. | Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis |
| 2006 | HiPC | Navigability of Small World Networks. | Pierre Fraigniaud |
| 2006 | LATIN | Connected Treewidth and Connected Graph Searching. | Pierre Fraigniaud, Nicolas Nisse |
| 2006 | MFCS | Tree Exploration with an Oracle. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2006 | PODC | Oracle size: a new measure of difficulty for communication tasks. | Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc |
| 2006 | SIROCCO | Distributed Chasing of Network Intruders. | Llia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial |
| 2006 | WG | Monotony Properties of Connected Visible Graph Searching. | Pierre Fraigniaud, Nicolas Nisse |
| 2005 | ESA | Greedy Routing in Tree-Decomposed Graphs. | Pierre Fraigniaud |
| 2005 | EuroPar | Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. | Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy |
| 2005 | ICALP | Label-Guided Graph Exploration by a Finite Automaton. | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
| 2005 | MFCS | Nondeterministic Graph Searching: From Pathwidth to Treewidth. | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
| 2005 | SIROCCO | Space Lower Bounds for Graph Exploration via Reduced Automata. | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sbastien Tixeuil |
| 2004 | LATIN | Collective Tree Exploration. | Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc |
| 2004 | MFCS | Graph Exploration by a Finite Automaton. | Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg |
| 2004 | Networking | Reducing Packet-Loss by Taking Long-Range Dependences into Account. | J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud |
| 2004 | PODC | Eclecticism shrinks even small worlds. | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
| 2004 | STACS | Digraphs Exploration with Little Memory. | Pierre Fraigniaud, David Ilcinkas |
| 2003 | ESA | Deterministic Rendezvous in Graphs. | Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc |
| 2003 | EuroPar | Topic Introduction. | Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann |
| 2003 | ICCCN | MλT: a multicast protocol with QoS support. | J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud |
| 2003 | PODC | Brief announcement: an overview of the content-addressable network D2B. | Pierre Fraigniaud, Philippe Gauron |
| 2003 | SODA | Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. | Lali Barrire, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny |
| 2003 | SPAA | Can we elect if we cannot compare? | Lali Barrire, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2003 | SIROCCO | Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. | Lali Barrire, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2003 | WG | Searching Is Not Jumping. | Lali Barrire, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos |
| 2002 | SODA | Tree exploration with little memory. | Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc |
| 2002 | STACS | A Space Lower Bound for Routing in Trees. | Pierre Fraigniaud, Cyril Gavoille |
| 2002 | SPAA | Capture of an intruder by mobile agents. | Lali Barrire, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2001 | ESA | Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. | Pierre Fraigniaud |
| 2001 | ICALP | Routing in Trees. | Pierre Fraigniaud, Cyril Gavoille |
| 2000 | ESA | On Recognizing Cayley Graphs. | Lali Barrire, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson |
| 2000 | PODC | Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). | Pierre Fraigniaud, Cyril Gavoille, Bernard Mans |
| 2000 | PODC | Assigning labels in unknown anonymous networks (extended abstract). | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes |
| 1999 | SODA | Scheduling Calls for Multicasting in Tree-Networks. | Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana |
| 1999 | WG | Recognizing Bipartite Incident-Graphs of Circulant Digraphs. | Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille |
| 1998 | SIROCCO | A Theoretical Model for Routing Complexity. | Pierre Fraigniaud, Cyril Gavoille |
| 1997 | ICCCN | An extended comparison of slotted and unslotted deflection routing. | Thierry Chich, Pierre Fraigniaud |
| 1997 | SPAA | Approximation Algorithms for Structured Communication Problems. | Dominique Barth, Pierre Fraigniaud |
| 1997 | SIROCCO | Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. | Pierre Fraigniaud, Sandrine Vial |
| 1996 | SPAA | Local Memory Requirement of Universal Routing Schemes. | Pierre Fraigniaud, Cyril Gavoille |
| 1995 | PODC | Memory Requirement for Universal Routing Schemes. | Pierre Fraigniaud, Cyril Gavoille |
| 1994 | ICPP | Multicasting in Meshes. | Eric Fleury, Pierre Fraigniaud |
| 1994 | PODC | A Characterization of Networks Supporting Linear Interval Routing. | Pierre Fraigniaud, Cyril Gavoille |
| 1991 | ICPP | Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks. | Pierre Fraigniaud, Ching-Tien Ho |