Pierre Fraigniaud

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 121

Top Venues

Ecole Normale Superieure de Lyon (PHD)

Education History

Ecole Normale Superieure de Lyon

PHD

Publications

Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. Algorithmica 86 (2) (2024)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. CoRR (2023)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Local certification of graphs with bounded genus. Discret. Appl. Math. 325 (2023)
Pierre Fraigniaud, Maël Luce, Ioan Todinca
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. SIROCCO (2023)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. DISC (2023)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
-resilient consensus in arbitrary graphs. Inf. Comput. 292 (2023)
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR (2023)
Pierre Fraigniaud, Maël Luce, Ioan Todinca
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. CoRR (2023)
Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. CoRR (2023)
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC (2023)
Avinandan Das, Pierre Fraigniaud, Adi Rosén
Distributed Partial Coloring via Gradual Rounding. OPODIS (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. WG (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO (2023)
Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
Fault Tolerant Coloring of the Asynchronous Cycle. DISC (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Computing Power of Hybrid Models in Synchronous Networks. CoRR (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. DISC (2022)
Laurent Feuilloley, Pierre Fraigniaud
Error-sensitive proof-labeling schemes. J. Parallel Distributed Comput. 166 (2022)
Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC (2022)
Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
Fault Tolerant Coloring of the Asynchronous Cycle. CoRR (2022)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Computing Power of Hybrid Models in Synchronous Networks. OPODIS (2022)
Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. PODC (2022)
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. CoRR (2022)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Present-biased optimization. Math. Soc. Sci. 119 (2022)
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
Decentralized Asynchronous Crash-resilient Runtime Verification. J. ACM 69 (5) (2022)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. SIROCCO (2022)
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. PODC (2022)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in distributed proofs. Distributed Comput. 34 (2) (2021)
Pierre Fraigniaud
How Do Mobile Agents Benefit from Randomness? SSS (2021)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849 (2021)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. CoRR (2021)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
A hierarchy of local decision. Theor. Comput. Sci. 856 (2021)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. ITCS (2021)
Paul Bastide, Pierre Fraigniaud
Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. DISC (2021)
Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2021)
Pierre Fraigniaud, Ran Gelles, Zvi Lotker
The Topology of Randomized Symmetry-Breaking Distributed Computing. PODC (2021)
Laurent Feuilloley, Pierre Fraigniaud
Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Trans. Parallel Comput. 8 (4) (2021)
Pierre Fraigniaud, Ran Gelles, Zvi Lotker
The Topology of Randomized Symmetry-Breaking Distributed Computing. CoRR (2021)
Paul Bastide, Pierre Fraigniaud
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. CoRR (2021)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Present-Biased Optimization. AAAI (2021)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. Algorithmica 83 (7) (2021)
Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33 (2) (2020)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR (2020)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Present-Biased Optimization. CoRR (2020)
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
Compact Distributed Certification of Planar Graphs. CoRR (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. PODC (2020)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Distributed Quantum Proofs for Replicated Data. CoRR (2020)
Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin
Distributed Testing of Distance-k Colorings. SIROCCO (2020)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
Local Certification of Graphs with Bounded Genus. CoRR (2020)
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC (2020)
Pierre Fraigniaud, Ami Paz
The Topology of Local Computing in Networks. ICALP (2020)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. J. Appl. Comput. Topol. 4 (1) (2020)
Pierre Fraigniaud, Ami Paz
The Topology of Local Computing in Networks. CoRR (2020)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord
Perfect failure detection with very few bits. Inf. Comput. 275 (2020)
Pierre Fraigniaud, Amos Korman, Yoav Rodeh
Parallel Bayesian Search with No Coordination. J. ACM 66 (3) (2019)
Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie
Distributed Computing in the Asynchronous LOCAL model. CoRR (2019)
Pierre Fraigniaud, Dennis Olivetti
Distributed Detection of Cycles. ACM Trans. Parallel Comput. 6 (3) (2019)
Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
On Distributed Merlin-Arthur Decision Protocols. SIROCCO (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-offs in Distributed Interactive Proofs. CoRR (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. SIROCCO (2019)
Pierre Fraigniaud, Emanuele Natale
Noisy rumor spreading and plurality consensus. Distributed Comput. 32 (4) (2019)
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Trade-Offs in Distributed Interactive Proofs. DISC (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. CoRR (2019)
Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry
Randomized proof-labeling schemes. Distributed Comput. 32 (3) (2019)
Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. SSS (2019)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. Comput. J. 62 (5) (2019)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What can be verified locally? J. Comput. Syst. Sci. 97 (2018)
Simon Collet, Pierre Fraigniaud, Paolo Penna
Equilibria of Games in Networks for Local Tasks. OPODIS (2018)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in Distributed Proofs. DISC (2018)
Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
Node labels in local decision. Theor. Comput. Sci. 751 (2018)
Javier Esparza, Pierre Fraigniaud, Anca Muscholl, Sergio Rajsbaum
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211). Dagstuhl Reports 8 (5) (2018)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
Redundancy in Distributed Proofs. CoRR (2018)
Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg
Preferential Attachment as a Unique Equilibrium. WWW (2018)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. CoRR (2017)
Laurent Feuilloley, Pierre Fraigniaud
Error-Sensitive Proof-Labeling Schemes. CoRR (2017)
Pierre Fraigniaud, Andrzej Pelc
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109 (2017)
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
Three Notes on Distributed Property Testing. DISC (2017)
Pierre Fraigniaud, Dennis Olivetti
Distributed Detection of Cycles. CoRR (2017)
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca
Distributed Subgraph Detection. CoRR (2017)
Laurent Feuilloley, Pierre Fraigniaud
Error-Sensitive Proof-Labeling Schemes. DISC (2017)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What Can Be Verified Locally?. STACS (2017)
Alkida Balliu, Pierre Fraigniaud
Certification of Compact Low-Stretch Routing Schemes. DISC (2017)
Pierre Fraigniaud, Dennis Olivetti
Distributed Detection of Cycles. SPAA (2017)
Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC (2016)
Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
Asynchronous Coordination Under Preferences and Constraints. SIROCCO (2016)
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR (2016)
Pierre Fraigniaud, Amos Korman
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM 63 (1) (2016)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
A Hierarchy of Local Decision. ICALP (2016)
Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek
Notions of Connectivity in Overlay Networks. CoRR (2016)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN (2016)
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. DISC (2016)
Laurent Feuilloley, Pierre Fraigniaud
Survey of Distributed Decision. CoRR (2016)
Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
A hierarchy of local decision. CoRR (2016)
Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti
Sparsifying Congested Cliques and Core-Periphery Networks. SIROCCO (2016)
Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica 74 (4) (2016)
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48 (2) (2016)
Pierre Fraigniaud, Amos Korman, Yoav Rodeh
Parallel exhaustive search without coordination. STOC (2016)

Pierre Fraigniaud.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Fraigniaud