Arfaoui, Heger; Fraigniaud, Pierre; Ilcinkas, David; Mathieu, Fabien; Pelc, Andrzej Deciding and verifying network properties locally with few output bits. (English) Zbl 1434.68343 Distrib. Comput. 33, No. 2, 169-187 (2020). MSC: 68R10 68M10 68W15 PDFBibTeX XMLCite \textit{H. Arfaoui} et al., Distrib. Comput. 33, No. 2, 169--187 (2020; Zbl 1434.68343) Full Text: DOI HAL
Fraigniaud, Pierre; Pelc, Andrzej Delays induce an exponential memory gap for rendezvous in trees. (English) Zbl 1301.68203 ACM Trans. Algorithms 9, No. 2, Article No. 17, 24 p. (2013). MSC: 68R10 05C15 68P05 68Q17 68T42 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{A. Pelc}, ACM Trans. Algorithms 9, No. 2, Article No. 17, 24 p. (2013; Zbl 1301.68203) Full Text: DOI arXiv
Fraigniaud, Pierre; Pelc, Andrzej Decidability classes for mobile agents computing. (English) Zbl 1353.68090 Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 362-374 (2012). MSC: 68Q10 68M12 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{A. Pelc}, Lect. Notes Comput. Sci. 7256, 362--374 (2012; Zbl 1353.68090) Full Text: DOI arXiv
Fraigniaud, Pierre; Ilcinkas, David; Pelc, Andrzej Communication algorithms with advice. (English) Zbl 1201.68017 J. Comput. Syst. Sci. 76, No. 3-4, 222-232 (2010). MSC: 68M10 68Q25 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., J. Comput. Syst. Sci. 76, No. 3--4, 222--232 (2010; Zbl 1201.68017) Full Text: DOI
Fraigniaud, Pierre; Gavoille, Cyril; Ilcinkas, David; Pelc, Andrzej Distributed computing with advice: information sensitivity of graph coloring. (English) Zbl 1267.05118 Distrib. Comput. 21, No. 6, 395-403 (2009). MSC: 05C15 68M14 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Distrib. Comput. 21, No. 6, 395--403 (2009; Zbl 1267.05118) Full Text: DOI HAL
Fraigniaud, Pierre; Ilcinkas, David; Pelc, Andrzej Tree exploration with advice. (English) Zbl 1169.68047 Inf. Comput. 206, No. 11, 1276-1287 (2008). MSC: 68T20 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Inf. Comput. 206, No. 11, 1276--1287 (2008; Zbl 1169.68047) Full Text: DOI
Fraigniaud, Pierre; Pelc, Andrzej Deterministic rendezvous in trees with little memory. (English) Zbl 1161.68336 Taubenfeld, Gadi (ed.), Distributed computing. 22nd international symposium, DISC 2008, Arcachon, France, September 22–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87778-3/pbk). Lecture Notes in Computer Science 5218, 242-256 (2008). MSC: 68M14 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{A. Pelc}, Lect. Notes Comput. Sci. 5218, 242--256 (2008; Zbl 1161.68336) Full Text: DOI
Fraigniaud, Pierre; Ilcinkas, David; Pelc, Andrzej Impact of memory size on graph exploration capability. (English) Zbl 1155.68055 Discrete Appl. Math. 156, No. 12, 2310-2319 (2008). MSC: 68R10 68Q45 05C85 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Discrete Appl. Math. 156, No. 12, 2310--2319 (2008; Zbl 1155.68055) Full Text: DOI
Fraigniaud, Pierre; Gavoille, Cyril; Ilcinkas, David; Pelc, Andrzej Distributed computing with advice: Information sensitivity of graph coloring. (English) Zbl 1171.68859 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 231-242 (2007). MSC: 68W15 05C15 68Q10 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Lect. Notes Comput. Sci. 4596, 231--242 (2007; Zbl 1171.68859) Full Text: DOI HAL
Fraigniaud, Pierre; Ilcinkas, David; Pelc, Andrzej Oracle size, a new measure of difficulty for communication tasks. (English) Zbl 1314.68023 Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC ’06, Denver, CO, USA, July 23–26, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-384-0). 179-187 (2006). MSC: 68M10 68M12 68M14 68Q25 90B10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., in: Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC '06, Denver, CO, USA, July 23--26, 2006. New York, NY: Association for Computing Machinery (ACM). 179--187 (2006; Zbl 1314.68023) Full Text: DOI
Fraigniaud, Pierre; Ilcinkas, David; Pelc, Andrzej Tree exploration with an oracle. (English) Zbl 1132.68507 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28–September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 24-37 (2006). MSC: 68R10 68T20 68W40 90C35 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Lect. Notes Comput. Sci. 4162, 24--37 (2006; Zbl 1132.68507) Full Text: DOI HAL
Fraigniaud, Pierre; Ģasieniec, Leszek; Kowalski, Dariusz R.; Pelc, Andrzej Collective tree exploration. (English) Zbl 1107.68065 Networks 48, No. 3, 166-177 (2006). MSC: 68R10 05C05 68Q25 68T40 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Networks 48, No. 3, 166--177 (2006; Zbl 1107.68065) Full Text: DOI
Dessmark, Anders; Fraigniaud, Pierre; Kowalski, Dariusz R.; Pelc, Andrzej Deterministic rendezvous in graphs. (English) Zbl 1100.68077 Algorithmica 46, No. 1, 69-96 (2006). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Algorithmica 46, No. 1, 69--96 (2006; Zbl 1100.68077) Full Text: DOI Link
Fraigniaud, Pierre; Ilcinkas, David; Peer, Guy; Pelc, Andrzej; Peleg, David Graph exploration by a finite automaton. (English) Zbl 1081.68045 Theor. Comput. Sci. 345, No. 2-3, 331-344 (2005). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Theor. Comput. Sci. 345, No. 2--3, 331--344 (2005; Zbl 1081.68045) Full Text: DOI HAL
Fraigniaud, Pierre; Gasieniec, Leszek; Kowalski, Dariusz R.; Pelc, Andrzej Collective tree exploration. (English) Zbl 1196.68171 Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 141-151 (2004). MSC: 68R10 68T20 68T40 68W15 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Lect. Notes Comput. Sci. 2976, 141--151 (2004; Zbl 1196.68171) Full Text: DOI
Fraigniaud, Pierre; Ilcinkas, David; Peer, Guy; Pelc, Andrzej; Peleg, David Graph exploration by a finite automaton. (English) Zbl 1096.68080 Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 451-462 (2004). MSC: 68Q45 05C85 68R10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Lect. Notes Comput. Sci. 3153, 451--462 (2004; Zbl 1096.68080) Full Text: DOI
Diks, Krzysztof; Fraigniaud, Pierre; Kranakis, Evangelos; Pelc, Andrzej Tree exploration with little memory. (English) Zbl 1067.68100 J. Algorithms 51, No. 1, 38-63 (2004). MSC: 68R10 68T40 68W05 PDFBibTeX XMLCite \textit{K. Diks} et al., J. Algorithms 51, No. 1, 38--63 (2004; Zbl 1067.68100) Full Text: DOI
Dessmark, Anders; Fraigniaud, Pierre; Pelc, Andrzej Deterministic rendezvous in graphs. (English) Zbl 1266.68143 Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 184-195 (2003). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{A. Dessmark} et al., Lect. Notes Comput. Sci. 2832, 184--195 (2003; Zbl 1266.68143) Full Text: DOI
Diks, Krzysztof; Fraigniaud, Pierre; Kranakis, Evangelos; Pelc, Andrzej Tree exploration with little memory. (English) Zbl 1093.68615 Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 588-597 (2002). MSC: 68R10 68T05 68T40 PDFBibTeX XMLCite \textit{K. Diks} et al., in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 588--597 (2002; Zbl 1093.68615)
Fraigniaud, Pierre; Pelc, Andrzej; Peleg, David; Pérennes, Stéphane Assigning labels in an unknown anonymous network with a leader. (English) Zbl 1448.68046 Distrib. Comput. 14, No. 3, 163-183 (2001). MSC: 68M10 68M14 68W15 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Distrib. Comput. 14, No. 3, 163--183 (2001; Zbl 1448.68046) Full Text: DOI
Fraigniaud, Pierre; Pelc, Andrzej; Peleg, David; Pérennes, Stéphane Assigning labels in unknown anonymous networks (extended abstract). (English) Zbl 1314.68374 Proceedings of the 19th annual ACM symposium on principles of distributed computing, PODC ’00, Portland, OR, USA, July 16–19, 2000. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-183-6). 101-111 (2000). MSC: 68W15 05C85 68M14 68Q25 68R10 68W27 90B10 90B18 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., in: Proceedings of the 19th annual ACM symposium on principles of distributed computing, PODC '00, Portland, OR, USA, July 16--19, 2000. New York, NY: Association for Computing Machinery (ACM). 101--111 (2000; Zbl 1314.68374) Full Text: DOI
Fraigniaud, Pierre; Kenyon, Claire; Pelc, Andrzej Finding a target subnetwork in sparse networks with random faults. (English) Zbl 0813.68058 Inf. Process. Lett. 48, No. 6, 297-303 (1993). MSC: 68M15 68R10 05C80 68M10 PDFBibTeX XMLCite \textit{P. Fraigniaud} et al., Inf. Process. Lett. 48, No. 6, 297--303 (1993; Zbl 0813.68058) Full Text: DOI