default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Fraigniaud
Person information
- affiliation: CNRS and University Paris Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j105]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. Algorithmica 86(2): 585-612 (2024)- [j104]Pierre Fraigniaud, Ran Gelles
, Zvi Lotker:
The topology of randomized symmetry-breaking distributed computing. J. Appl. Comput. Topol. 8(4): 909-940 (2024) - [j103]Pierre Fraigniaud, Ami Paz:
The topology of local computing in networks. J. Appl. Comput. Topol. 8(4): 1069-1098 (2024) - [j102]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the power of threshold-based algorithms for detecting cycles in the CONGEST model. Theor. Comput. Sci. 996: 114500 (2024) - [j101]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. 997: 114508 (2024) - [j100]Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. 1016: 114759 (2024) - [c170]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC 2024: 205-208 - [c169]Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. PODC 2024: 209-219 - [c168]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. PODC 2024: 310-320 - [c167]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Non-negotiating Distributed Computing. SIROCCO 2024: 208-225 - [c166]Pierre Fraigniaud, Hovhannes A. Harutyunyan:
Source-Oblivious Broadcast. TAMC 2024: 137-148 - [c165]Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie:
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. DISC 2024: 5:1-5:20 - [c164]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. DISC 2024: 25:1-25:20 - [c163]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
Brief Announcement: Solvability of Three-Process General Tasks. DISC 2024: 42:1-42:7 - [c162]Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz:
Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. DISC 2024: 47:1-47:5 - [i56]Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. CoRR abs/2402.12018 (2024) - [i55]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR abs/2405.03321 (2024) - [i54]Fabien Dufoulon, Pierre Fraigniaud, Mikaël Rabie, Hening Zheng:
Distributed Coloring in the SLEEPING Model. CoRR abs/2405.10058 (2024) - [i53]Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mikaël Rabie:
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. CoRR abs/2408.10971 (2024) - 2023
- [j99]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - [j98]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-resilient consensus in arbitrary graphs. Inf. Comput. 292: 105035 (2023) - [c161]Avinandan Das, Pierre Fraigniaud, Adi Rosén:
Distributed Partial Coloring via Gradual Rounding. OPODIS 2023: 30:1-30:22 - [c160]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. SIROCCO 2023: 459-481 - [c159]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO 2023: 482-501 - [c158]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: 4:1-4:23 - [c157]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - [c156]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. WG 2023: 334-347 - [i52]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR abs/2301.11988 (2023) - [i51]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. CoRR abs/2304.02360 (2023) - [i50]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. CoRR abs/2306.01536 (2023) - [i49]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. CoRR abs/2307.14292 (2023) - [i48]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 abs/2308.04213 (2023) - [i47]Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR abs/2309.13977 (2023) - 2022
- [j97]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-resilient Runtime Verification. J. ACM 69(5): 34:1-34:31 (2022) - [j96]Laurent Feuilloley, Pierre Fraigniaud:
Error-sensitive proof-labeling schemes. J. Parallel Distributed Comput. 166: 149-165 (2022) - [j95]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-biased optimization. Math. Soc. Sci. 119: 56-67 (2022) - [c155]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: 20:1-20:18 - [c154]Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld:
2022 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2022: 2 - [c153]Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. PODC 2022: 460-470 - [c152]Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie:
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. PODC 2022: 493-495 - [c151]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. SIROCCO 2022: 116-134 - [c150]Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie:
Fault Tolerant Coloring of the Asynchronous Cycle. DISC 2022: 23:1-23:22 - [c149]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: 43:1-43:3 - [e8]Pierre Fraigniaud, Yushi Uno:
11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy. LIPIcs 226, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-232-7 [contents] - [i46]Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. CoRR abs/2206.05356 (2022) - [i45]Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie:
Fault Tolerant Coloring of the Asynchronous Cycle. CoRR abs/2207.11198 (2022) - [i44]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Computing Power of Hybrid Models in Synchronous Networks. CoRR abs/2208.02640 (2022) - 2021
- [j94]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j93]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in distributed proofs. Distributed Comput. 34(2): 113-132 (2021) - [j92]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849: 121-137 (2021) - [j91]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A hierarchy of local decision. Theor. Comput. Sci. 856: 51-67 (2021) - [j90]Laurent Feuilloley, Pierre Fraigniaud:
Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Trans. Parallel Comput. 8(4): 18:1-18:25 (2021) - [c148]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. AAAI 2021: 5415-5422 - [c147]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. ITCS 2021: 28:1-28:20 - [c146]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - [c145]Pierre Fraigniaud, Ran Gelles, Zvi Lotker:
The Topology of Randomized Symmetry-Breaking Distributed Computing. PODC 2021: 415-425 - [c144]Pierre Fraigniaud:
How Do Mobile Agents Benefit from Randomness? SSS 2021: 90-107 - [c143]Paul Bastide, Pierre Fraigniaud:
Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. DISC 2021: 47:1-47:4 - [i43]Pierre Fraigniaud, Ran Gelles, Zvi Lotker:
The Topology of Randomized Symmetry-Breaking Distributed Computing. CoRR abs/2105.11713 (2021) - [i42]Paul Bastide, Pierre Fraigniaud:
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. CoRR abs/2108.01989 (2021) - [i41]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. CoRR abs/2112.03195 (2021) - 2020
- [j89]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc:
Deciding and verifying network properties locally with few output bits. Distributed Comput. 33(2): 169-187 (2020) - [j88]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect failure detection with very few bits. Inf. Comput. 275: 104604 (2020) - [j87]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): 141-179 (2020) - [c142]Pierre Fraigniaud, Ami Paz:
The Topology of Local Computing in Networks. ICALP 2020: 128:1-128:18 - [c141]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM 2020: 337-346 - [c140]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [c139]Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Testing of Distance-k Colorings. SIROCCO 2020: 275-290 - [c138]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3 - [i40]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR abs/2001.08108 (2020) - [i39]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. CoRR abs/2002.10018 (2020) - [i38]Pierre Fraigniaud, Ami Paz:
The Topology of Local Computing in Networks. CoRR abs/2003.03255 (2020) - [i37]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i36]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca:
Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020) - [i35]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. CoRR abs/2012.14736 (2020)
2010 – 2019
- 2019
- [j86]Alkida Balliu, Pierre Fraigniaud:
Certification of Compact Low-Stretch Routing Schemes. Comput. J. 62(5): 730-746 (2019) - [j85]Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry:
Randomized proof-labeling schemes. Distributed Comput. 32(3): 217-234 (2019) - [j84]Pierre Fraigniaud, Emanuele Natale:
Noisy rumor spreading and plurality consensus. Distributed Comput. 32(4): 257-276 (2019) - [j83]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019) - [j82]Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. ACM Trans. Parallel Comput. 6(3): 12:1-12:20 (2019) - [c137]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18 - [c136]Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245 - [c135]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019: 53-68 - [c134]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie:
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. SSS 2019: 105-110 - [c133]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. DISC 2019: 13:1-13:17 - [i34]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie:
Distributed Computing in the Asynchronous LOCAL model. CoRR abs/1904.07664 (2019) - [i33]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565 (2019) - [i32]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019) - 2018
- [j81]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What can be verified locally? J. Comput. Syst. Sci. 97: 106-120 (2018) - [j80]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node labels in local decision. Theor. Comput. Sci. 751: 61-73 (2018) - [c132]Simon Collet, Pierre Fraigniaud, Paolo Penna:
Equilibria of Games in Networks for Local Tasks. OPODIS 2018: 6:1-6:16 - [c131]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. DISC 2018: 24:1-24:18 - [c130]Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg:
Preferential Attachment as a Unique Equilibrium. WWW 2018: 559-568 - [i31]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. CoRR abs/1803.03031 (2018) - [i30]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): 60-79 (2018) - 2017
- [j79]Pierre Fraigniaud, Andrzej Pelc:
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109: 117-128 (2017) - [c129]Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. SPAA 2017: 153-162 - [c128]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What Can Be Verified Locally?. STACS 2017: 8:1-8:13 - [c127]Alkida Balliu, Pierre Fraigniaud:
Certification of Compact Low-Stretch Routing Schemes. DISC 2017: 6:1-6:16 - [c126]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: 15:1-15:30 - [c125]Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. DISC 2017: 16:1-16:15 - [i29]Alkida Balliu, Pierre Fraigniaud:
Certification of Compact Low-Stretch Routing Schemes. CoRR abs/1704.06070 (2017) - [i28]Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. CoRR abs/1705.04144 (2017) - [i27]Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. CoRR abs/1706.03992 (2017) - [i26]Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca:
Distributed Subgraph Detection. CoRR abs/1706.03996 (2017) - 2016
- [j78]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): 1205-1223 (2016) - [j77]Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199: 101-109 (2016) - [j76]Laurent Feuilloley, Pierre Fraigniaud:
Survey of Distributed Decision. Bull. EATCS 119 (2016) - [j75]Pierre Fraigniaud, Amos Korman:
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM 63(1): 6:1-6:31 (2016) - [j74]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - [j73]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 655: 1 (2016) - [c124]Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna:
Core-periphery clustering and collaboration networks. ASONAM 2016: 525-528 - [c123]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR 2016: 16:1-16:15 - [c122]Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski:
Local Conflict Coloring. FOCS 2016: 625-634 - [c121]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A Hierarchy of Local Decision. ICALP 2016: 118:1-118:15 - [c120]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Challenges in Fault-Tolerant Distributed Runtime Verification. ISoLA (2) 2016: 363-370 - [c119]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN 2016: 497-508 - [c118]Pierre Fraigniaud, Emanuele Natale:
Noisy Rumor Spreading and Plurality Consensus. PODC 2016: 127-136 - [c117]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. PODC 2016: 299-301 - [c116]Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Asynchronous Coordination Under Preferences and Constraints. SIROCCO 2016: 111-126 - [c115]Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti:
Sparsifying Congested Cliques and Core-Periphery Networks. SIROCCO 2016: 307-322 - [c114]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect Failure Detection with Very Few Bits. SSS 2016: 154-169 - [c113]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel exhaustive search without coordination. STOC 2016: 312-323 - [c112]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. DISC 2016: 342-356 - [r1]Pierre Fraigniaud:
Locality in Distributed Graph Algorithms. Encyclopedia of Algorithms 2016: 1143-1148 - [i25]Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg, Yuval Emek:
Notions of Connectivity in Overlay Networks. CoRR abs/1601.01104 (2016) - [i24]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen:
A hierarchy of local decision. CoRR abs/1602.08925 (2016) - [i23]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. CoRR abs/1605.03719 (2016) - [i22]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
Local Distributed Verification. CoRR abs/1605.03892 (2016) - [i21]Laurent Feuilloley, Pierre Fraigniaud:
Survey of Distributed Decision. CoRR abs/1606.04434 (2016) - [i20]Simon Collet, Pierre Fraigniaud, Paolo Penna:
Local Distributed Algorithms for Selfish Agents. CoRR abs/1607.03677 (2016) - [i19]Pierre Fraigniaud, Amos Korman:
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. CoRR abs/1611.02589 (2016) - 2015
- [c111]Lélia Blin, Pierre Fraigniaud:
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. ICDCS 2015: 589-598 - [c110]Mor Baruch, Pierre Fraigniaud, Boaz Patt-Shamir:
Randomized Proof-Labeling Schemes. PODC 2015: 315-324 - [c109]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node Labels in Local Decision. SIROCCO 2015: 31-45 - [c108]Laurent Feuilloley, Pierre Fraigniaud:
Randomized Local Network Computing. SPAA 2015: 340-349 - [i18]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node Labels in Local Decision. CoRR abs/1507.00909 (2015) - [i17]Pierre Fraigniaud, Emanuele Natale:
Noisy Information Spreading and Plurality Consensus. CoRR abs/1507.05796 (2015) - [i16]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Exhaustive Search without Coordination. CoRR abs/1511.00486 (2015) - [i15]Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski:
Local Conflict Coloring. CoRR abs/1511.01287 (2015) - [i14]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. CoRR abs/1512.06989 (2015) - 2014
- [j72]Pierre Fraigniaud, George Giakkoupis:
Greedy routing in small-world networks with power-law degrees. Distributed Comput. 27(4): 231-253 (2014) - [j71]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - [j70]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Flooding in dynamic graphs with arbitrary degree sequence. J. Parallel Distributed Comput. 74(5): 2433-2437 (2014) - [j69]Heger Arfaoui, Pierre Fraigniaud:
What can be computed without communications? SIGACT News 45(3): 82-104 (2014) - [j68]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. 560: 108-120 (2014) - [c107]Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
The Opinion Number of Set-Agreement. OPODIS 2014: 155-170 - [c106]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. RV 2014: 92-107 - [c105]Lélia Blin, Pierre Fraigniaud, Boaz Patt-Shamir:
On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms. SSS 2014: 18-32 - [c104]Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Automatically Adjusting Concurrency to the Level of Synchrony. DISC 2014: 1-15 - [c103]Lélia Blin, Pierre Fraigniaud:
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. DISC 2014: 565-566 - [c102]Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu:
Distributedly Testing Cycle-Freeness. WG 2014: 15-28 - [e7]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Lecture Notes in Computer Science 8572, Springer 2014, ISBN 978-3-662-43947-0 [contents] - [e6]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8573, Springer 2014, ISBN 978-3-662-43950-0 [contents] - [i13]Lélia Blin, Pierre Fraigniaud:
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. CoRR abs/1402.2496 (2014) - 2013
- [j67]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Locality and checkability in wait-free computing. Distributed Comput. 26(4): 223-242 (2013) - [j66]Pierre Fraigniaud:
Special issue with selected papers from PODC 2011. Distributed Comput. 26(5-6): 271 (2013) - [j65]Pierre Fraigniaud, Amos Korman, David Peleg:
Towards a complexity theory for local distributed computing. J. ACM 60(5): 35:1-35:26 (2013) - [j64]Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. ACM Trans. Algorithms 9(2): 17:1-17:24 (2013) - [c101]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. APPROX-RANDOM 2013: 158-172 - [c100]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c99]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? PODC 2013: 157-165 - [c98]Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc:
Local Decision and Verification with Bounded-Size Outputs. SSS 2013: 133-147 - [i12]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? CoRR abs/1302.2570 (2013) - [i11]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i10]Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud:
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports 3(1): 94-110 (2013) - 2012
- [j63]Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. Inf. Comput. 219: 1-16 (2012) - [j62]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012) - [c97]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. LATIN 2012: 362-374 - [c96]Olivier Bournez, Pierre Fraigniaud, Xavier Koegler:
Computing with Large Populations Using Interactions. MFCS 2012: 234-246 - [c95]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. OPODIS 2012: 224-238 - [c94]Heger Arfaoui, Pierre Fraigniaud:
Brief announcement: what can be computed without communication? PODC 2012: 87-88 - [c93]Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg:
Notions of Connectivity in Overlay Networks. SIROCCO 2012: 25-35 - [c92]Heger Arfaoui, Pierre Fraigniaud:
What Can Be Computed without Communications? SIROCCO 2012: 135-146 - [c91]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The Worst Case Behavior of Randomized Gossip. TAMC 2012: 330-345 - [c90]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. DISC 2012: 371-385 - [c89]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. DISC 2012: 417-418 - [i9]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. CoRR abs/1207.0252 (2012) - 2011
- [j61]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. Distributed Comput. 24(1): 31-44 (2011) - [j60]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011) - [j59]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011) - [c88]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. FOCS 2011: 708-717 - [c87]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Locality and Checkability in Wait-Free Computing. DISC 2011: 333-347 - [e5]Cyril Gavoille, Pierre Fraigniaud:
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011. ACM 2011, ISBN 978-1-4503-0719-2 [contents] - [i8]Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. CoRR abs/1102.0467 (2011) - [i7]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011) - 2010
- [j58]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. 110(24): 1120-1123 (2010) - [j57]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010) - [j56]Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar:
Local MST Computation with Short Advice. Theory Comput. Syst. 47(4): 920-933 (2010) - [j55]Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
A Lower Bound for Network Navigability. SIAM J. Discret. Math. 24(1): 72-81 (2010) - [j54]Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
Recovering the long-range links in augmented graphs. Theor. Comput. Sci. 411(14-15): 1613-1625 (2010) - [c86]Pierre Fraigniaud:
Informative Labeling Schemes. ICALP (2) 2010: 1 - [c85]Pierre Fraigniaud, Hoang-Anh Phan:
"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks. ICC 2010: 1-5 - [c84]Pierre Fraigniaud:
Provenance for database transformations. ICDT 2010: 3 - [c83]Pierre Fraigniaud, Hoang-Anh Phan:
Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks. IPDPS Workshops 2010: 1-8 - [c82]Pierre Fraigniaud:
Distributed computational complexities: are you volvo-addicted or nascar-obsessed? PODC 2010: 171-172 - [c81]Pierre Fraigniaud, Amos Korman:
Compact Ancestry Labeling Schemes for XML Trees. SODA 2010: 458-466 - [c80]Pierre Fraigniaud, George Giakkoupis:
On the bit communication complexity of randomized rumor spreading. SPAA 2010: 134-143 - [c79]Pierre Fraigniaud, Andrzej Pelc:
Delays induce an exponential memory gap for rendezvous in trees. SPAA 2010: 224-232 - [c78]Pierre Fraigniaud, George Giakkoupis:
On the searchability of small-world networks with arbitrary underlying structure. STOC 2010: 389-398 - [c77]Pierre Fraigniaud, Amos Korman:
An optimal ancestry scheme and small universal posets. STOC 2010: 611-620 - [i6]Pierre Fraigniaud, Amos Korman, David Peleg:
Local Distributed Decision. CoRR abs/1011.2152 (2010) - [i5]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. CoRR abs/1011.2719 (2010)
2000 – 2009
- 2009
- [j53]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009) - [j52]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009) - [j51]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21(6): 395-403 (2009) - [j50]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) - [c76]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
Online Computation with Advice. ICALP (1) 2009: 427-438 - [c75]Pierre Fraigniaud, George Giakkoupis:
The effect of power-law degrees on the navigability of small worlds: [extended abstract]. PODC 2009: 240-249 - [c74]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. PODC 2009: 260-269 - [c73]Hervé Baumann, Pierre Fraigniaud:
Sub-linear Universal Spatial Gossip Protocols. SIROCCO 2009: 44-56 - [c72]Pierre Fraigniaud, Amos Korman:
On randomized representations of graphs using short labels. SPAA 2009: 131-137 - [c71]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134 - [i4]Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-server Work Function Algorithm. CoRR abs/0902.1378 (2009) - [i3]Pierre Fraigniaud, Amos Korman:
Compact Ancestry Labeling Schemes for Trees of Small Depth. CoRR abs/0902.3081 (2009) - [i2]Pierre Fraigniaud, Amos Korman:
An Optimal Labeling Scheme for Ancestry Queries. CoRR abs/0909.2733 (2009) - 2008
- [j49]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Impact of memory size on graph exploration capability. Discret. Appl. Math. 156(12): 2310-2319 (2008) - [j48]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008) - [j47]Pierre Fraigniaud, Nicolas Nisse:
Monotony properties of connected visible graph searching. Inf. Comput. 206(12): 1383-1393 (2008) - [j46]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4): 42:1-42:18 (2008) - [j45]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed chasing of network intruders. Theor. Comput. Sci. 399(1-2): 12-37 (2008) - [j44]Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos:
Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008) - [c70]Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar:
Networks Become Navigable as Nodes Move and Forget. ICALP (1) 2008: 133-144 - [c69]Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot:
The Inframetric Model for the Internet. INFOCOM 2008: 1085-1093 - [c68]Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar:
Forget him and keep on moving. PODC 2008: 415 - [c67]Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
Recovering the Long-Range Links in Augmented Graphs. SIROCCO 2008: 104-118 - [c66]Pierre Fraigniaud, Cyril Gavoille:
Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69 - [c65]Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Trees with Little Memory. DISC 2008: 242-256 - [c64]Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar:
Opportunistic spatial gossip over mobile social networks. WOSN 2008: 73-78 - [i1]Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar:
Networks become navigable as nodes move and forget. CoRR abs/0803.0248 (2008) - 2007
- [j43]Pierre Fraigniaud:
Special Issue DISC 2005. Distributed Comput. 20(3): 163 (2007) - [j42]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory Comput. Syst. 40(2): 143-162 (2007) - [c63]Pierre Fraigniaud:
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. ESA 2007: 2-11 - [c62]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - [c61]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7 - [c60]Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar:
Local MST computation with short advice. SPAA 2007: 154-160 - 2006
- [j41]Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) - [j40]Pierre Fraigniaud, Cyril Gavoille:
Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks 50(10): 1630-1638 (2006) - [j39]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. Distributed Comput. 18(4): 279-291 (2006) - [j38]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective tree exploration. Networks 48(3): 166-177 (2006) - [j37]Pierre Fraigniaud, Philippe Gauron:
D2B: A de Bruijn based content-addressable network. Theor. Comput. Sci. 355(1): 65-79 (2006) - [c59]Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil:
The Reduced Automata Technique for Graph Exploration Space Lower Bounds. Essays in Memory of Shimon Even 2006: 1-26 - [c58]Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. ESA 2006: 376-386 - [c57]Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis:
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2006: 799 - [c56]Pierre Fraigniaud:
Navigability of Small World Networks. HiPC 2006: 1 - [c55]Pierre Fraigniaud, Nicolas Nisse:
Connected Treewidth and Connected Graph Searching. LATIN 2006: 479-490 - [c54]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree Exploration with an Oracle. MFCS 2006: 24-37 - [c53]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187 - [c52]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84 - [c51]Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
Brief Announcement: On Augmented Graph Navigability. DISC 2006: 551-553 - [c50]Pierre Fraigniaud, Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching. WG 2006: 229-240 - 2005
- [j36]Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
An algorithmic model for heterogeneous hyper-clusters: rationale and experience. Int. J. Found. Comput. Sci. 16(2): 195-215 (2005) - [j35]Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distributed Comput. 65(5): 628-642 (2005) - [j34]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph exploration by a finite automaton. Theor. Comput. Sci. 345(2-3): 331-344 (2005) - [c49]Pierre Fraigniaud:
Greedy Routing in Tree-Decomposed Graphs. ESA 2005: 791-802 - [c48]Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy:
Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. Euro-Par 2005: 1163-1172 - [c47]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346 - [c46]Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Labeling Schemes for Tree Representation. IWDC 2005: 13-24 - [c45]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375 - [c44]Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil:
Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005: 140-154 - [e4]Pierre Fraigniaud:
Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings. Lecture Notes in Computer Science 3724, Springer 2005, ISBN 3-540-29163-6 [contents] - 2004
- [j33]Pierre Fraigniaud:
A note on line broadcast in digraphs under the edge-disjoint paths mode. Discret. Appl. Math. 144(3): 320-323 (2004) - [j32]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. J. Algorithms 51(1): 38-63 (2004) - [c43]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective Tree Exploration. LATIN 2004: 141-151 - [c42]Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg:
Graph Exploration by a Finite Automaton. MFCS 2004: 451-462 - [c41]J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud:
Reducing Packet-Loss by Taking Long-Range Dependences into Account. NETWORKING 2004: 1096-1107 - [c40]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. PODC 2004: 169-178 - [c39]Pierre Fraigniaud, David Ilcinkas:
Digraphs Exploration with Little Memory. STACS 2004: 246-257 - 2003
- [j31]Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny:
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wirel. Commun. Mob. Comput. 3(2): 141-153 (2003) - [c38]Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Graphs. ESA 2003: 184-195 - [c37]Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann:
Topic Introduction. Euro-Par 2003: 884 - [c36]J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud:
MλT: a multicast protocol with QoS support. ICCCN 2003: 264-269 - [c35]Pierre Fraigniaud, Philippe Gauron:
Brief announcement: an overview of the content-addressable network D2B. PODC 2003: 151 - [c34]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. SIROCCO 2003: 17-32 - [c33]Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny:
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790 - [c32]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Can we elect if we cannot compare? SPAA 2003: 324-332 - [c31]Pierre Fraigniaud, Cyril Gavoille:
Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223 - [c30]Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos:
Searching Is Not Jumping. WG 2003: 34-45 - 2002
- [j30]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Knödel graphs. Discret. Math. 250(1-3): 41-62 (2002) - [j29]Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. Theory Comput. Syst. 35(6): 641-665 (2002) - [j28]Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard:
Oriented hypercubes. Networks 39(2): 98-106 (2002) - [c29]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. SODA 2002: 588-597 - [c28]Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Capture of an intruder by mobile agents. SPAA 2002: 200-209 - [c27]Pierre Fraigniaud, Cyril Gavoille:
A Space Lower Bound for Routing in Trees. STACS 2002: 65-75 - 2001
- [j27]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader. Distributed Comput. 14(3): 163-183 (2001) - [j26]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity. Distributed Comput. 14(4): 217-229 (2001) - [j25]Pierre Fraigniaud, Joseph G. Peters:
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. Networks 38(3): 150-162 (2001) - [j24]Thierry Chich, Pierre Fraigniaud, Johanne Cohen:
Unslotted deflection routing: a practical and efficient protocol for multihop optical networks. IEEE/ACM Trans. Netw. 9(1): 47-59 (2001) - [c26]Lali Barrière, Pierre Fraigniaud, Lata Narayanan:
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. DIAL-M 2001: 19-27 - [c25]Pierre Fraigniaud:
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. ESA 2001: 440-451 - [c24]Pierre Fraigniaud, Cyril Gavoille:
Routing in Trees. ICALP 2001: 757-772 - [c23]Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42 - [c22]Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc:
Efficient Routing in Networks with Long Range Contacts. DISC 2001: 270-284 - [e3]Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud:
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. Proceedings in Informatics 8, Carleton Scientific 2001, ISBN 1-894145-10-0 [contents] - 2000
- [j23]Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias:
Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000) - [c21]Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson:
On Recognizing Cayley Graphs. ESA 2000: 76-87 - [c20]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC 2000: 11-20 - [c19]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111
1990 – 1999
- 1999
- [j22]Pierre Fraigniaud, Sandrine Vial:
Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes. Parallel Process. Lett. 9(1): 9-20 (1999) - [c18]Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
Scheduling Calls for Multicasting in Tree-Networks. SODA 1999: 881-882 - [c17]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227 - 1998
- [j21]Pierre Fraigniaud, Cyril Gavoille:
Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998) - [j20]Pierre Fraigniaud:
Hierarchical Broadcast Networks. Inf. Process. Lett. 68(6): 303-305 (1998) - [j19]Eric Fleury, Pierre Fraigniaud:
Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. J. Parallel Distributed Comput. 53(1): 26-62 (1998) - [j18]Pierre Fraigniaud:
On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. Theor. Comput. Sci. 194(1-2): 225-237 (1998) - [j17]Eric Fleury, Pierre Fraigniaud:
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks. IEEE Trans. Parallel Distributed Syst. 9(7): 626-638 (1998) - [j16]Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. IEEE Trans. Parallel Distributed Syst. 9(8): 788-802 (1998) - [c16]Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
Minimal contention-free matrices with application to multicasting. Robust Communication Networks: Interconnection and Survivability 1998: 17-33 - [c15]Pierre Fraigniaud, Cyril Gavoille:
A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113 - 1997
- [j15]Pierre Fraigniaud, Cyril Gavoille:
Universal Routing Schemes. Distributed Comput. 10(2): 65-78 (1997) - [j14]Pierre Fraigniaud, Sandrine Vial:
Approximation Algorithms for Broadcasting and Gossiping. J. Parallel Distributed Comput. 43(1): 47-55 (1997) - [c14]Thierry Chich, Pierre Fraigniaud:
An extended comparison of slotted and unslotted deflection routing. ICCCN 1997: 92-97 - [c13]Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738 - [c12]Pierre Fraigniaud, Sandrine Vial:
Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. SIROCCO 1997: 240-252 - [c11]Dominique Barth, Pierre Fraigniaud:
Approximation Algorithms for Structured Communication Problems. SPAA 1997: 180-188 - 1996
- [j13]Pierre Fraigniaud, Christian Laforest:
Minimum gossip bus networks. Networks 27(4): 239-251 (1996) - [c10]Pierre Fraigniaud, Cyril Gavoille:
Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188 - [e2]Luc Bougé, Pierre Fraigniaud, Anne Mignotte, Yves Robert:
Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I. Lecture Notes in Computer Science 1123, Springer 1996, ISBN 3-540-61626-8 [contents] - [e1]Luc Bougé, Pierre Fraigniaud, Anne Mignotte, Yves Robert:
Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II. Lecture Notes in Computer Science 1124, Springer 1996, ISBN 3-540-61627-6 [contents] - 1995
- [j12]Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters:
Antepenultimate broadcasting. Networks 26(3): 125-137 (1995) - [c9]Pierre Fraigniaud, Joseph G. Peters:
Structured communication in torus networks. HICSS (2) 1995: 584-593 - [c8]Pierre Fraigniaud, Cyril Gavoille:
Memory Requirement for Universal Routing Schemes. PODC 1995: 223-230 - 1994
- [j11]Pierre Fraigniaud, Emmanuel Lazard:
Methods and problems of communication in usual networks. Discret. Appl. Math. 53(1-3): 79-133 (1994) - [j10]Jean-Claude Bermond, Pierre Fraigniaud:
Broadcasting and Gossiping in de Bruijn Networks. SIAM J. Comput. 23(1): 212-225 (1994) - [j9]Michel Cosnard, Pierre Fraigniaud:
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. IEEE Trans. Parallel Distributed Syst. 5(6): 639-648 (1994) - [c7]Pierre Fraigniaud, Cyril Gavoille:
Optimal Interval Routing. CONPAR 1994: 785-796 - [c6]Eric Fleury, Pierre Fraigniaud:
Multicasting in Meshes. ICPP (3) 1994: 151-158 - [c5]Pierre Fraigniaud, Cyril Gavoille:
A Characterization of Networks Supporting Linear Interval Routing. PODC 1994: 216-224 - 1993
- [j8]Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc:
Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. 48(6): 297-303 (1993) - [j7]Henri-Pierre Charles, Pierre Fraigniaud:
Scheduling a Scattering-Gathering Sequence on Hypercubes. Parallel Process. Lett. 3: 29-42 (1993) - [j6]Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau:
Open Problems. Parallel Process. Lett. 3: 507-524 (1993) - [c4]Pierre Fraigniaud, Christian Laforest:
Disjoint Spanning Trees of Small Depth. PARCO 1993: 105-112 - 1992
- [j5]Pierre Fraigniaud:
Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities. J. Parallel Distributed Comput. 16(1): 15-26 (1992) - [j4]Pierre Fraigniaud:
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers. IEEE Trans. Computers 41(11): 1410-1419 (1992) - 1991
- [j3]Pierre Fraigniaud, Claudine Peyrat:
Broadcasting in a Hypercube when Some Calls Fail. Inf. Process. Lett. 39(3): 115-119 (1991) - [c3]Pierre Fraigniaud:
Fault-Tolerant Gossiping on Hypercube Multicomputers. EDMCC 1991: 463-472 - [c2]Pierre Fraigniaud, Ching-Tien Ho:
Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks. ICPP (1) 1991: 225-229 - 1990
- [b1]Pierre Fraigniaud:
Communications intensives dans les architectures a memoire distribuee et algorithmes paralleles pour la recherche de racines de polynomes. Ecole Normale Superieure de Lyon, 1990, pp. I-VIII - [j2]Pierre Fraigniaud, Serge Miguet, Yves Robert:
Scattering on a ring of processors. Parallel Comput. 13(3): 377-383 (1990) - [j1]Michel Cosnard, Pierre Fraigniaud:
Finding the roots of a polynomial on an MIMD multicomputer. Parallel Comput. 15(1-3): 75-85 (1990) - [c1]Michel Cosnard, Pierre Fraigniaud:
A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. CONPAR 1990: 875-886
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
