Pierre Fraigniaud

Centre National de la Recherche Scientifique, Laboratoire de Recherche en Informatique

Papers

Total Citations

H-Index

About

Pierre Fraigniaud is a leading figure in distributed computing and theoretical computer science, with a primary focus on graph exploration, network algorithms, and the complexity of decentralized systems. His work addresses fundamental questions about how autonomous agents can efficiently navigate and map unknown environments, a problem with deep implications for robotics, communication networks, and distributed systems. Fraigniaud’s major contributions include pioneering space lower bounds for graph exploration using reduced automata, a 2005 paper that has garnered 17 citations and established critical limits on the memory required for agents to traverse arbitrary graphs. He also advanced the understanding of collaborative exploration in his 2004 work on collective tree exploration, which has received 7 citations and explores how multiple agents can coordinate to cover a tree structure more efficiently than a single explorer. Beyond these papers, Fraigniaud is renowned for his leadership in the distributed computing community, having served as editor-in-chief of top journals and organizing influential conferences. His research continues to shape the theoretical foundations of network algorithms, making him an essential reference for students and researchers tackling problems in mobile agent computing and distributed graph algorithms.