Pierre Fraigniaud

362 papers A* 48A 43B 58C 8Misc 2Journal 173Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Distributed Model Checking on Graphs of Bounded Treedepth. Algorithmica Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2026	J	`jnl`	The computational power of distributed shared-memory models with bounded-size registers. Distributed Comput. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2025	—	`conf`	A Simple Lower Bound for Set Agreement in Dynamic Networks. SOSA Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz
2025	J	`jnl`	A Simple Lower Bound for Set Agreement in Dynamic Networks. CoRR Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz
2025	J	`jnl`	A speedup theorem for asynchronous computation with applications to consensus and approximate agreement. Distributed Comput. Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2025	A	`conf`	Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. STACS Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz
2025	A*	`conf`	Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. PODC Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2025	A	`conf`	Coordination Through Stochastic Channels. DISC Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
2025	A*	`conf`	Deterministic Even-Cycle Detection in Broadcast CONGEST. ICALP Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
2025	J	`jnl`	Distributed computing in the asynchronous LOCAL model. Theor. Comput. Sci. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie
2025	J	`jnl`	Lower Bounds for CoRR Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz, Ulrich Schmid, Hugo Rincon Galeana
2025	A	`conf`	Lower Bounds for k-Set Agreement in Fault-Prone Networks. DISC Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz, Ulrich Schmid, Hugo Rincon Galeana
2025	B	`conf`	On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. SIROCCO Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2025	J	`jnl`	Semi-Streaming Algorithms for Graph Property Certification. CoRR Avinandan Das, Pierre Fraigniaud, Ami Paz, Adi Rosén
2025	A*	`conf`	Solvability Characterization for General Three-Process Tasks. PODC Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2025	A*	`conf`	Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. PODC Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikaël Rabie
2025	J	`jnl`	Source-Oblivious Broadcast. CoRR Pierre Fraigniaud, Hovhannes A. Harutyunyan
2024	J	`jnl`	A Meta-Theorem for Distributed Certification. Algorithmica Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	J	`jnl`	Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. CoRR Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz
2024	A	`conf`	Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. DISC Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie
2024	J	`jnl`	Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. CoRR Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie
2024	A	`conf`	Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. DISC Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz
2024	A*	`conf`	Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	A	`conf`	Brief Announcement: Solvability of Three-Process General Tasks. DISC Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2024	J	`jnl`	Deterministic Even-Cycle Detection in Broadcast CONGEST. CoRR Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
2024	J	`jnl`	Distributed Coloring in the SLEEPING Model. CoRR Fabien Dufoulon, Pierre Fraigniaud, Mikaël Rabie, Hening Zheng
2024	J	`jnl`	Distributed Model Checking in Graphs Classes of Bounded Expansion. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	A	`conf`	Distributed Model Checking on Graphs of Bounded Treedepth. DISC Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	J	`jnl`	Distributed Model Checking on Graphs of Bounded Treedepth. CoRR Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	A*	`conf`	Even-Cycle Detection in the Randomized and Quantum CONGEST Model. PODC Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
2024	J	`jnl`	Even-Cycle Detection in the Randomized and Quantum CONGEST Model. CoRR Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca
2024	B	`conf`	Non-negotiating Distributed Computing. SIROCCO Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2024	J	`jnl`	On the power of threshold-based algorithms for detecting cycles in the CONGEST model. Theor. Comput. Sci. Pierre Fraigniaud, Maël Luce, Ioan Todinca
2024	J	`jnl`	Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2024	J	`jnl`	Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2024	J	`jnl`	Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost. CoRR Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikaël Rabie
2024	C	`conf`	Source-Oblivious Broadcast. TAMC Pierre Fraigniaud, Hovhannes A. Harutyunyan
2024	A*	`conf`	The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. PODC Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2024	J	`jnl`	The topology of local computing in networks. J. Appl. Comput. Topol. Pierre Fraigniaud, Ami Paz
2024	J	`jnl`	The topology of randomized symmetry-breaking distributed computing. J. Appl. Comput. Topol. Pierre Fraigniaud, Ran Gelles, Zvi Lotker
2023	A	`conf`	Distributed Certification for Classes of Dense Graphs. DISC Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	J	`jnl`	Distributed Certification for Classes of Dense Graphs. CoRR Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	B	`conf`	Distributed Partial Coloring via Gradual Rounding. OPODIS Avinandan Das, Pierre Fraigniaud, Adi Rosén
2023	B	`conf`	Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	J	`jnl`	Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	J	`jnl`	Local certification of graphs with bounded genus. Discret. Appl. Math. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2023	B	`conf`	On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. SIROCCO Pierre Fraigniaud, Maël Luce, Ioan Todinca
2023	J	`jnl`	On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. CoRR Pierre Fraigniaud, Maël Luce, Ioan Todinca
2023	A	`conf`	One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2023	J	`jnl`	One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2023	B	`conf`	Parameterized Complexity of Broadcasting in Graphs. WG Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2023	J	`jnl`	Parameterized Complexity of Broadcasting in Graphs. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2023	J	`jnl`	Synchronous Inf. Comput. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2023	J	`jnl`	The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2022	Misc	`ed.`	11th International Conference on Fun with Algorithms, FUN 2022, Island of Favignana, Sicily, Italy, May 30 - June 3, 2022 FUN Pierre Fraigniaud, Yushi Uno
2022	A*	`conf`	2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
2022	B	`conf`	A Meta-Theorem for Distributed Certification. SIROCCO Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2022	A*	`conf`	A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. PODC Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2022	J	`jnl`	A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. CoRR Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
2022	A	`conf`	Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. DISC Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022	A*	`conf`	Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. PODC Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
2022	B	`conf`	Computing Power of Hybrid Models in Synchronous Networks. OPODIS Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022	J	`jnl`	Computing Power of Hybrid Models in Synchronous Networks. CoRR Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022	J	`jnl`	Decentralized Asynchronous Crash-resilient Runtime Verification. J. ACM Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
2022	J	`jnl`	Error-sensitive proof-labeling schemes. J. Parallel Distributed Comput. Laurent Feuilloley, Pierre Fraigniaud
2022	A	`conf`	Fault Tolerant Coloring of the Asynchronous Cycle. DISC Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
2022	J	`jnl`	Fault Tolerant Coloring of the Asynchronous Cycle. CoRR Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
2022	J	`jnl`	Present-biased optimization. Math. Soc. Sci. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2021	A*	`conf`	2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021	J	`jnl`	A Meta-Theorem for Distributed Certification. CoRR Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2021	J	`jnl`	A hierarchy of local decision. Theor. Comput. Sci. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2021	J	`jnl`	A topological perspective on distributed network algorithms. Theor. Comput. Sci. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2021	A	`conf`	Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. DISC Paul Bastide, Pierre Fraigniaud
2021	J	`jnl`	Compact Distributed Certification of Planar Graphs. Algorithmica Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2021	A	`conf`	Distributed Quantum Proofs for Replicated Data. ITCS Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
2021	C	`conf`	How Do Mobile Agents Benefit from Randomness? SSS Pierre Fraigniaud
2021	J	`jnl`	On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. CoRR Paul Bastide, Pierre Fraigniaud
2021	A*	`conf`	Present-Biased Optimization. AAAI Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2021	J	`jnl`	Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Trans. Parallel Comput. Laurent Feuilloley, Pierre Fraigniaud
2021	J	`jnl`	Redundancy in distributed proofs. Distributed Comput. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2021	A*	`conf`	The Topology of Randomized Symmetry-Breaking Distributed Computing. PODC Pierre Fraigniaud, Ran Gelles, Zvi Lotker
2021	J	`jnl`	The Topology of Randomized Symmetry-Breaking Distributed Computing. CoRR Pierre Fraigniaud, Ran Gelles, Zvi Lotker
2020	J	`jnl`	A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. J. Appl. Comput. Topol. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2020	A	`conf`	Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
2020	A*	`conf`	Compact Distributed Certification of Planar Graphs. PODC Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2020	J	`jnl`	Compact Distributed Certification of Planar Graphs. CoRR Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
2020	J	`jnl`	Deciding and verifying network properties locally with few output bits. Distributed Comput. Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc
2020	J	`jnl`	Distributed Quantum Proofs for Replicated Data. CoRR Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
2020	B	`conf`	Distributed Testing of Distance-k Colorings. SIROCCO Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin
2020	J	`jnl`	Local Certification of Graphs with Bounded Genus. CoRR Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
2020	J	`jnl`	Perfect failure detection with very few bits. Inf. Comput. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord
2020	J	`jnl`	Present-Biased Optimization. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2020	A*	`conf`	Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2020	J	`jnl`	Simple and Fast Distributed Computation of Betweenness Centrality. CoRR Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2020	A*	`conf`	The Topology of Local Computing in Networks. ICALP Pierre Fraigniaud, Ami Paz
2020	J	`jnl`	The Topology of Local Computing in Networks. CoRR Pierre Fraigniaud, Ami Paz
2019	B	`conf`	A Topological Perspective on Distributed Network Algorithms. SIROCCO Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	J	`jnl`	A Topological Perspective on Distributed Network Algorithms. CoRR Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	C	`conf`	Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. SSS Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie
2019	J	`jnl`	Certification of Compact Low-Stretch Routing Schemes. Comput. J. Alkida Balliu, Pierre Fraigniaud
2019	J	`jnl`	Distributed Computing in the Asynchronous LOCAL model. CoRR Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie
2019	J	`jnl`	Distributed Detection of Cycles. ACM Trans. Parallel Comput. Pierre Fraigniaud, Dennis Olivetti
2019	J	`jnl`	Noisy rumor spreading and plurality consensus. Distributed Comput. Pierre Fraigniaud, Emanuele Natale
2019	B	`conf`	On Distributed Merlin-Arthur Decision Protocols. SIROCCO Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2019	J	`jnl`	Parallel Bayesian Search with No Coordination. J. ACM Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2019	J	`jnl`	Randomized proof-labeling schemes. Distributed Comput. Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry
2019	C	`conf`	Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2019	A	`conf`	Trade-Offs in Distributed Interactive Proofs. DISC Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2019	J	`jnl`	Trade-offs in Distributed Interactive Proofs. CoRR Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
2018	B	`conf`	Equilibria of Games in Networks for Local Tasks. OPODIS Simon Collet, Pierre Fraigniaud, Paolo Penna
2018	J	`jnl`	Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211). Dagstuhl Reports Javier Esparza, Pierre Fraigniaud, Anca Muscholl, Sergio Rajsbaum
2018	J	`jnl`	Node labels in local decision. Theor. Comput. Sci. Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
2018	A*	`conf`	Preferential Attachment as a Unique Equilibrium. WWW Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg
2018	A	`conf`	Redundancy in Distributed Proofs. DISC Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2018	J	`jnl`	Redundancy in Distributed Proofs. CoRR Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
2018	J	`jnl`	What can be verified locally? J. Comput. Syst. Sci. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2017	A	`conf`	Certification of Compact Low-Stretch Routing Schemes. DISC Alkida Balliu, Pierre Fraigniaud
2017	J	`jnl`	Certification of Compact Low-Stretch Routing Schemes. CoRR Alkida Balliu, Pierre Fraigniaud
2017	J	`jnl`	Decidability classes for mobile agents computing. J. Parallel Distributed Comput. Pierre Fraigniaud, Andrzej Pelc
2017	B	`conf`	Distributed Detection of Cycles. SPAA Pierre Fraigniaud, Dennis Olivetti
2017	J	`jnl`	Distributed Detection of Cycles. CoRR Pierre Fraigniaud, Dennis Olivetti
2017	J	`jnl`	Distributed Subgraph Detection. CoRR Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca
2017	A	`conf`	Error-Sensitive Proof-Labeling Schemes. DISC Laurent Feuilloley, Pierre Fraigniaud
2017	J	`jnl`	Error-Sensitive Proof-Labeling Schemes. CoRR Laurent Feuilloley, Pierre Fraigniaud
2017	A	`conf`	Three Notes on Distributed Property Testing. DISC Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2017	A	`conf`	What Can Be Verified Locally?. STACS Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2016	A*	`conf`	A Hierarchy of Local Decision. ICALP Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2016	J	`jnl`	A hierarchy of local decision. CoRR Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen
2016	J	`jnl`	An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. CoRR Pierre Fraigniaud, Amos Korman
2016	J	`jnl`	An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM Pierre Fraigniaud, Amos Korman
2016	B	`conf`	Asynchronous Coordination Under Preferences and Constraints. SIROCCO Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2016	A*	`conf`	Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2016	—	`conf`	Challenges in Fault-Tolerant Distributed Runtime Verification. ISoLA (2) Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2016	B	`conf`	Core-periphery clustering and collaboration networks. ASONAM Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna
2016	B	`conf`	Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
2016	A	`conf`	Distributed Testing of Excluded Subgraphs. DISC Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016	J	`jnl`	Distributed Testing of Excluded Subgraphs. CoRR Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016	J	`jnl`	Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2016	A*	`conf`	Local Conflict Coloring. FOCS Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski
2016	J	`jnl`	Local Distributed Algorithms for Selfish Agents. CoRR Simon Collet, Pierre Fraigniaud, Paolo Penna
2016	J	`jnl`	Local Distributed Verification. CoRR Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2016	—	`ch.`	Locality in Distributed Graph Algorithms. Encyclopedia of Algorithms Pierre Fraigniaud
2016	B	`conf`	Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2016	A*	`conf`	Noisy Rumor Spreading and Plurality Consensus. PODC Pierre Fraigniaud, Emanuele Natale
2016	J	`jnl`	Notions of Connectivity in Overlay Networks. CoRR Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek
2016	J	`jnl`	On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
2016	A*	`conf`	Parallel exhaustive search without coordination. STOC Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2016	C	`conf`	Perfect Failure Detection with Very Few Bits. SSS Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord
2016	J	`jnl`	Rumor spreading in random evolving graphs. Random Struct. Algorithms Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
2016	J	`jnl`	Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
2016	B	`conf`	Sparsifying Congested Cliques and Core-Periphery Networks. SIROCCO Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti
2016	J	`jnl`	Survey of Distributed Decision. CoRR Laurent Feuilloley, Pierre Fraigniaud
2016	J	`jnl`	Survey of Distributed Decision. Bull. EATCS Laurent Feuilloley, Pierre Fraigniaud
2015	J	`jnl`	Local Conflict Coloring. CoRR Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski
2015	B	`conf`	Node Labels in Local Decision. SIROCCO Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
2015	J	`jnl`	Node Labels in Local Decision. CoRR Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
2015	J	`jnl`	Noisy Information Spreading and Plurality Consensus. CoRR Pierre Fraigniaud, Emanuele Natale
2015	J	`jnl`	On the Impact of Identifiers on Local Decision. CoRR Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2015	J	`jnl`	Parallel Exhaustive Search without Coordination. CoRR Pierre Fraigniaud, Amos Korman, Yoav Rodeh
2015	B	`conf`	Randomized Local Network Computing. SPAA Laurent Feuilloley, Pierre Fraigniaud
2015	A*	`conf`	Randomized Proof-Labeling Schemes. PODC Mor Baruch, Pierre Fraigniaud, Boaz Patt-Shamir
2015	A	`conf`	Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. ICDCS Lélia Blin, Pierre Fraigniaud
2014	—	`ed.`	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I ICALP (1) Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
2014	—	`ed.`	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II ICALP (2) Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
2014	A	`conf`	Automatically Adjusting Concurrency to the Level of Synchrony. DISC Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2014	B	`conf`	Distributedly Testing Cycle-Freeness. WG Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
2014	J	`jnl`	Flooding in dynamic graphs with arbitrary degree sequence. J. Parallel Distributed Comput. Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2014	J	`jnl`	Greedy routing in small-world networks with power-law degrees. Distributed Comput. Pierre Fraigniaud, George Giakkoupis
2014	C	`conf`	On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. SSS Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir
2014	B	`conf`	On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. RV Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2014	J	`jnl`	Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. CoRR Lélia Blin, Pierre Fraigniaud
2014	J	`jnl`	Randomized distributed decision. Distributed Comput. Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2014	A	`conf`	Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. DISC Lélia Blin, Pierre Fraigniaud
2014	B	`conf`	The Opinion Number of Set-Agreement. OPODIS Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
2014	J	`jnl`	The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos
2014	J	`jnl`	What can be computed without communications? SIGACT News Heger Arfaoui, Pierre Fraigniaud
2013	J	`jnl`	Delays Induce an Exponential Memory Gap for Rendezvous in Trees. ACM Trans. Algorithms Pierre Fraigniaud, Andrzej Pelc
2013	J	`jnl`	Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud
2013	C	`conf`	Local Decision and Verification with Bounded-Size Outputs. SSS Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc
2013	J	`jnl`	Locality and checkability in wait-free computing. Distributed Comput. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2013	J	`jnl`	Rumor Spreading in Random Evolving Graphs CoRR Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013	A	`conf`	Rumor Spreading in Random Evolving Graphs. ESA Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013	—	`conf`	Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. APPROX-RANDOM Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
2013	J	`jnl`	Special issue with selected papers from PODC 2011. Distributed Comput. Pierre Fraigniaud
2013	J	`jnl`	Towards a complexity theory for local distributed computing. J. ACM Pierre Fraigniaud, Amos Korman, David Peleg
2013	A*	`conf`	What can be decided locally without identifiers? PODC Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2013	J	`jnl`	What can be decided locally without identifiers? CoRR Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
2012	A	`conf`	Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. DISC Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2012	A*	`conf`	Brief announcement: what can be computed without communication? PODC Heger Arfaoui, Pierre Fraigniaud
2012	B	`conf`	Computing with Large Populations Using Interactions. MFCS Olivier Bournez, Pierre Fraigniaud, Xavier Koegler
2012	J	`jnl`	Connected graph searching. Inf. Comput. Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos
2012	B	`conf`	Decidability Classes for Mobile Agents Computing. LATIN Pierre Fraigniaud, Andrzej Pelc
2012	J	`jnl`	Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2012	B	`conf`	Notions of Connectivity in Overlay Networks. SIROCCO Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg
2012	B	`conf`	On the Impact of Identifiers on Local Decision. OPODIS Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2012	J	`jnl`	Randomized Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	A	`conf`	Randomized Distributed Decision. DISC Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg
2012	C	`conf`	The Worst Case Behavior of Randomized Gossip. TAMC Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos
2012	B	`conf`	What Can Be Computed without Communications? SIROCCO Heger Arfaoui, Pierre Fraigniaud
2011	J	`jnl`	Delays Induce an Exponential Memory Gap for Rendezvous in Trees CoRR Pierre Fraigniaud, Andrzej Pelc
2011	A*	`conf`	Local Distributed Decision. FOCS Pierre Fraigniaud, Amos Korman, David Peleg
2011	A	`conf`	Locality and Checkability in Wait-Free Computing. DISC Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2011	J	`jnl`	Online computation with advice. Theor. Comput. Sci. Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2011	J	`jnl`	Parsimonious flooding in dynamic graphs. Distributed Comput. Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2011	A*	`ed.`	Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011 PODC Cyril Gavoille, Pierre Fraigniaud
2011	J	`jnl`	Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2011	J	`jnl`	Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2010	—	`conf`	"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks. ICC Pierre Fraigniaud, Hoang-Anh Phan
2010	J	`jnl`	A Lower Bound for Network Navigability. SIAM J. Discret. Math. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2010	A*	`conf`	An optimal ancestry scheme and small universal posets. STOC Pierre Fraigniaud, Amos Korman
2010	J	`jnl`	Communication algorithms with advice. J. Comput. Syst. Sci. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2010	A*	`conf`	Compact Ancestry Labeling Schemes for XML Trees. SODA Pierre Fraigniaud, Amos Korman
2010	J	`jnl`	Decidability Classes for Mobile Agents Computing CoRR Pierre Fraigniaud, Andrzej Pelc
2010	—	`conf`	Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks. IPDPS Workshops Pierre Fraigniaud, Hoang-Anh Phan
2010	B	`conf`	Delays induce an exponential memory gap for rendezvous in trees. SPAA Pierre Fraigniaud, Andrzej Pelc
2010	A*	`conf`	Distributed computational complexities: are you volvo-addicted or nascar-obsessed? PODC Pierre Fraigniaud
2010	—	`conf`	Informative Labeling Schemes. ICALP (2) Pierre Fraigniaud
2010	J	`jnl`	Local Distributed Decision CoRR Pierre Fraigniaud, Amos Korman, David Peleg
2010	J	`jnl`	Local MST Computation with Short Advice. Theory Comput. Syst. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2010	J	`jnl`	On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2010	B	`conf`	On the bit communication complexity of randomized rumor spreading. SPAA Pierre Fraigniaud, George Giakkoupis
2010	A*	`conf`	On the searchability of small-world networks with arbitrary underlying structure. STOC Pierre Fraigniaud, George Giakkoupis
2010	A	`conf`	Provenance for database transformations. ICDT Pierre Fraigniaud
2010	J	`jnl`	Recovering the long-range links in augmented graphs. Theor. Comput. Sci. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2009	J	`jnl`	An Optimal Labeling Scheme for Ancestry Queries CoRR Pierre Fraigniaud, Amos Korman
2009	J	`jnl`	Compact Ancestry Labeling Schemes for Trees of Small Depth CoRR Pierre Fraigniaud, Amos Korman
2009	J	`jnl`	Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2009	J	`jnl`	Labeling Schemes for Tree Representation. Algorithmica Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2009	J	`jnl`	Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
2009	B	`conf`	On randomized representations of graphs using short labels. SPAA Pierre Fraigniaud, Amos Korman
2009	B	`conf`	On the Additive Constant of the WAOA Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2009	J	`jnl`	On the Additive Constant of the k-server Work Function Algorithm CoRR Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2009	—	`conf`	Online Computation with Advice. ICALP (1) Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
2009	A*	`conf`	Parsimonious flooding in dynamic graphs. PODC Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud
2009	B	`conf`	Sub-linear Universal Spatial Gossip Protocols. SIROCCO Hervé Baumann, Pierre Fraigniaud
2009	A*	`conf`	The effect of power-law degrees on the navigability of small worlds: [extended abstract]. PODC Pierre Fraigniaud, George Giakkoupis
2009	J	`jnl`	Universal augmentation schemes for network navigability. Theor. Comput. Sci. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2008	A	`conf`	Deterministic Rendezvous in Trees with Little Memory. DISC Pierre Fraigniaud, Andrzej Pelc
2008	J	`jnl`	Distributed chasing of network intruders. Theor. Comput. Sci. Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
2008	J	`jnl`	Forewords: Special issue on graph searching. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos
2008	A*	`conf`	Forget him and keep on moving. PODC Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008	J	`jnl`	Impact of memory size on graph exploration capability. Discret. Appl. Math. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008	J	`jnl`	Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2008	J	`jnl`	Monotony properties of connected visible graph searching. Inf. Comput. Pierre Fraigniaud, Nicolas Nisse
2008	—	`conf`	Networks Become Navigable as Nodes Move and Forget. ICALP (1) Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008	J	`jnl`	Networks become navigable as nodes move and forget CoRR Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008	—	`conf`	Opportunistic spatial gossip over mobile social networks. WOSN Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008	B	`conf`	Polylogarithmic network navigability using compact metrics with small stretch. SPAA Pierre Fraigniaud, Cyril Gavoille
2008	B	`conf`	Recovering the Long-Range Links in Augmented Graphs. SIROCCO Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2008	A*	`conf`	The Inframetric Model for the Internet. INFOCOM Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot
2008	J	`jnl`	Tree exploration with advice. Inf. Comput. Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2007	A*	`conf`	Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2007	B	`conf`	Local MST computation with short advice. SPAA Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2007	J	`jnl`	Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory Comput. Syst. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
2007	A	`conf`	Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. ESA Pierre Fraigniaud
2007	J	`jnl`	Special Issue DISC 2005. Distributed Comput. Pierre Fraigniaud
2007	B	`conf`	Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2006	A	`conf`	A Doubling Dimension Threshold ESA Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2006	A	`conf`	Brief Announcement: On Augmented Graph Navigability. DISC Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2006	J	`jnl`	Collective tree exploration. Networks Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2006	B	`conf`	Connected Treewidth and Connected Graph Searching. LATIN Pierre Fraigniaud, Nicolas Nisse
2006	J	`jnl`	D2B: A de Bruijn based content-addressable network. Theor. Comput. Sci. Pierre Fraigniaud, Philippe Gauron
2006	J	`jnl`	Deterministic Rendezvous in Graphs. Algorithmica Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
2006	B	`conf`	Distributed Chasing of Network Intruders. SIROCCO Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
2006	J	`jnl`	Eclecticism shrinks even small worlds. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2006	J	`jnl`	Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks Pierre Fraigniaud, Cyril Gavoille
2006	B	`conf`	Monotony Properties of Connected Visible Graph Searching. WG Pierre Fraigniaud, Nicolas Nisse
2006	Misc	`conf`	Navigability of Small World Networks. HiPC Pierre Fraigniaud
2006	A*	`conf`	Oracle size: a new measure of difficulty for communication tasks. PODC Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006	—	`conf`	The Reduced Automata Technique for Graph Exploration Space Lower Bounds. Essays in Memory of Shimon Even Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
2006	—	`conf`	Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
2006	B	`conf`	Tree Exploration with an Oracle. MFCS Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2005	J	`jnl`	An algorithmic model for heterogeneous hyper-clusters: rationale and experience. Int. J. Found. Comput. Sci. Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2005	—	`conf`	Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. Euro-Par Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy
2005	A	`ed.`	Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings DISC Pierre Fraigniaud
2005	J	`jnl`	Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distributed Comput. Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2005	J	`jnl`	Graph exploration by a finite automaton. Theor. Comput. Sci. Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005	A	`conf`	Greedy Routing in Tree-Decomposed Graphs. ESA Pierre Fraigniaud
2005	A*	`conf`	Label-Guided Graph Exploration by a Finite Automaton. ICALP Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	—	`conf`	Labeling Schemes for Tree Representation. IWDC Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
2005	B	`conf`	Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
2005	B	`conf`	Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
2004	J	`jnl`	A note on line broadcast in digraphs under the edge-disjoint paths mode. Discret. Appl. Math. Pierre Fraigniaud
2004	B	`conf`	Collective Tree Exploration. LATIN Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
2004	A	`conf`	Digraphs Exploration with Little Memory. STACS Pierre Fraigniaud, David Ilcinkas
2004	A*	`conf`	Eclecticism shrinks even small worlds. PODC Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2004	B	`conf`	Graph Exploration by a Finite Automaton. MFCS Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004	B	`conf`	Reducing Packet-Loss by Taking Long-Range Dependences into Account. NETWORKING J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
2004	J	`jnl`	Tree exploration with little memory. J. Algorithms Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2003	A*	`conf`	Brief announcement: an overview of the content-addressable network D2B. PODC Pierre Fraigniaud, Philippe Gauron
2003	B	`conf`	Can we elect if we cannot compare? SPAA Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
2003	A	`conf`	Deterministic Rendezvous in Graphs. ESA Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
2003	A*	`conf`	Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
2003	B	`conf`	Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. SIROCCO Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
2003	A	`conf`	Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC Pierre Fraigniaud, Cyril Gavoille
2003	B	`conf`	MλT: a multicast protocol with QoS support. ICCCN J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
2003	J	`jnl`	Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wirel. Commun. Mob. Comput. Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny
2003	B	`conf`	Searching Is Not Jumping. WG Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
2003	—	`conf`	Topic Introduction. Euro-Par Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann
2002	A	`conf`	A Space Lower Bound for Routing in Trees. STACS Pierre Fraigniaud, Cyril Gavoille
2002	B	`conf`	Capture of an intruder by mobile agents. SPAA Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
2002	J	`jnl`	Oriented hypercubes. Networks Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard
2002	J	`jnl`	Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. Theory Comput. Syst. Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana
2002	J	`jnl`	Recognizing Knödel graphs. Discret. Math. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
2002	A*	`conf`	Tree exploration with little memory. SODA Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2001	A	`conf`	Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. ESA Pierre Fraigniaud
2001	J	`jnl`	Assigning labels in an unknown anonymous network with a leader. Distributed Comput. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2001	A	`conf`	Efficient Routing in Networks with Long Range Contacts. DISC Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc
2001	A	`conf`	HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
2001	J	`jnl`	Interval routing schemes allow broadcasting with linear message-complexity. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
2001	J	`jnl`	Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. Networks Pierre Fraigniaud, Joseph G. Peters
2001	—	`conf`	Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. DIAL-M Lali Barrière, Pierre Fraigniaud, Lata Narayanan
2001	A*	`conf`	Routing in Trees. ICALP Pierre Fraigniaud, Cyril Gavoille
2001	B	`ed.`	SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001 SIROCCO Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud
2001	J	`jnl`	Unslotted deflection routing: a practical and efficient protocol for multihop optical networks. IEEE/ACM Trans. Netw. Thierry Chich, Pierre Fraigniaud, Johanne Cohen
2000	A*	`conf`	Assigning labels in unknown anonymous networks (extended abstract). PODC Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
2000	J	`jnl`	Guest Editors' Foreword. Theory Comput. Syst. Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias
2000	A*	`conf`	Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
2000	A	`conf`	On Recognizing Cayley Graphs. ESA Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
1999	J	`jnl`	Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes. Parallel Process. Lett. Pierre Fraigniaud, Sandrine Vial
1999	B	`conf`	Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
1999	A*	`conf`	Scheduling Calls for Multicasting in Tree-Networks. SODA Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana
1998	J	`jnl`	A General Theory for Deadlock Avoidance in Wormhole-Routed Networks. IEEE Trans. Parallel Distributed Syst. Eric Fleury, Pierre Fraigniaud
1998	B	`conf`	A Theoretical Model for Routing Complexity. SIROCCO Pierre Fraigniaud, Cyril Gavoille
1998	J	`jnl`	Hierarchical Broadcast Networks. Inf. Process. Lett. Pierre Fraigniaud
1998	J	`jnl`	Interval Routing Schemes. Algorithmica Pierre Fraigniaud, Cyril Gavoille
1998	—	`conf`	Minimal contention-free matrices with application to multicasting. Robust Communication Networks: Interconnection and Survivability Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana
1998	J	`jnl`	On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. Theor. Comput. Sci. Pierre Fraigniaud
1998	J	`jnl`	Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. IEEE Trans. Parallel Distributed Syst. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
1998	J	`jnl`	Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. J. Parallel Distributed Comput. Eric Fleury, Pierre Fraigniaud
1997	B	`conf`	An extended comparison of slotted and unslotted deflection routing. ICCCN Thierry Chich, Pierre Fraigniaud
1997	J	`jnl`	Approximation Algorithms for Broadcasting and Gossiping. J. Parallel Distributed Comput. Pierre Fraigniaud, Sandrine Vial
1997	B	`conf`	Approximation Algorithms for Structured Communication Problems. SPAA Dominique Barth, Pierre Fraigniaud
1997	—	`conf`	Broadcasting and Multicasting in Cut-through Routed Networks. IPPS Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
1997	B	`conf`	Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. SIROCCO Pierre Fraigniaud, Sandrine Vial
1997	J	`jnl`	Universal Routing Schemes. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille
1996	—	`ed.`	Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I Euro-Par, Vol. I Luc Bougé, Pierre Fraigniaud, Anne Mignotte, Yves Robert
1996	—	`ed.`	Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II Euro-Par, Vol. II Luc Bougé, Pierre Fraigniaud, Anne Mignotte, Yves Robert
1996	B	`conf`	Local Memory Requirement of Universal Routing Schemes. SPAA Pierre Fraigniaud, Cyril Gavoille
1996	J	`jnl`	Minimum gossip bus networks. Networks Pierre Fraigniaud, Christian Laforest
1995	J	`jnl`	Antepenultimate broadcasting. Networks Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters
1995	A*	`conf`	Memory Requirement for Universal Routing Schemes. PODC Pierre Fraigniaud, Cyril Gavoille
1995	—	`conf`	Structured communication in torus networks. HICSS (2) Pierre Fraigniaud, Joseph G. Peters
1994	A*	`conf`	A Characterization of Networks Supporting Linear Interval Routing. PODC Pierre Fraigniaud, Cyril Gavoille
1994	J	`jnl`	Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. IEEE Trans. Parallel Distributed Syst. Michel Cosnard, Pierre Fraigniaud
1994	J	`jnl`	Broadcasting and Gossiping in de Bruijn Networks. SIAM J. Comput. Jean-Claude Bermond, Pierre Fraigniaud
1994	J	`jnl`	Methods and problems of communication in usual networks. Discret. Appl. Math. Pierre Fraigniaud, Emmanuel Lazard
1994	—	`conf`	Multicasting in Meshes. ICPP (3) Eric Fleury, Pierre Fraigniaud
1994	—	`conf`	Optimal Interval Routing. CONPAR Pierre Fraigniaud, Cyril Gavoille
1993	—	`conf`	Disjoint Spanning Trees of Small Depth. PARCO Pierre Fraigniaud, Christian Laforest
1993	J	`jnl`	Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
1993	J	`jnl`	Open Problems. Parallel Process. Lett. Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
1993	J	`jnl`	Scheduling a Scattering-Gathering Sequence on Hypercubes. Parallel Process. Lett. Henri-Pierre Charles, Pierre Fraigniaud
1992	J	`jnl`	Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers. IEEE Trans. Computers Pierre Fraigniaud
1992	J	`jnl`	Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities. J. Parallel Distributed Comput. Pierre Fraigniaud
1991	—	`conf`	Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks. ICPP (1) Pierre Fraigniaud, Ching-Tien Ho
1991	J	`jnl`	Broadcasting in a Hypercube when Some Calls Fail. Inf. Process. Lett. Pierre Fraigniaud, Claudine Peyrat
1991	—	`conf`	Fault-Tolerant Gossiping on Hypercube Multicomputers. EDMCC Pierre Fraigniaud
1990	—	`conf`	A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. CONPAR Michel Cosnard, Pierre Fraigniaud
1990	—	`—`	Communications intensives dans les architectures a memoire distribuee et algorithmes paralleles pour la recherche de racines de polynomes. Pierre Fraigniaud
1990	J	`jnl`	Finding the roots of a polynomial on an MIMD multicomputer. Parallel Comput. Michel Cosnard, Pierre Fraigniaud
1990	J	`jnl`	Scattering on a ring of processors. Parallel Comput. Pierre Fraigniaud, Serge Miguet, Yves Robert