default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Fraigniaud
- > Home > Persons > Pierre Fraigniaud
Publications
- 2021
[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- 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) - 2017
- [j79]Pierre Fraigniaud, Andrzej Pelc:
Decidability classes for mobile agents computing. J. Parallel Distributed Comput. 109: 117-128 (2017) - 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) - [c98]Heger Arfaoui, Pierre Fraigniaud, Andrzej Pelc:
Local Decision and Verification with Bounded-Size Outputs. SSS 2013: 133-147 - 2012
- [c97]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. LATIN 2012: 362-374 - 2011
- [i8]Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. CoRR abs/1102.0467 (2011) - 2010
- [j57]Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010) - [c79]Pierre Fraigniaud, Andrzej Pelc:
Delays induce an exponential memory gap for rendezvous in trees. SPAA 2010: 224-232 - [i5]Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. CoRR abs/1011.2719 (2010) - 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) - 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) - [c65]Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Trees with Little Memory. DISC 2008: 242-256 - 2007
- [c62]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - 2006
- [j41]Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) - [j38]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Collective tree exploration. Networks 48(3): 166-177 (2006) - [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 - 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) - 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 - 2003
- [c38]Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Graphs. ESA 2003: 184-195 - 2002
- [c29]Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc:
Tree exploration with little memory. SODA 2002: 588-597 - 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) - 2000
- [c19]Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes:
Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111 - 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)
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 2026-02-26 23:16 CET 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:
