Pierre Fraigniaud

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

31h-index3.2kcitations85works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Search Problems(50), Complexity and Algorithms in Graphs(24), Distributed systems and fault tolerance(21), Advanced Graph Theory Research(18), Interconnection Networks and Systems(15)

Publications85 total

The topology of local computing in networks
Journal of Applied and Computational Topology·2024Open Access
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
arXiv (Cornell University)·2024Open Access
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle
2022
Parallel Bayesian Search with No Coordination
Journal of the ACM·2019· 6 cited
Decidability classes for mobile agents computing
Journal of Parallel and Distributed Computing·2017· 2 cited
Local Distributed Algorithms for Selfish Agents
arXiv (Cornell University)·2016Open Access
Parallel exhaustive search without coordination
2016· 9 citedOpen Access
Parallel Exhaustive Search without Coordination
arXiv (Cornell University)·2015· 1 citedOpen Access
Session details: Session 6: Graph Algorithms
2015
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
Algorithmica·2015· 9 cited
Connected graph searching
Information and Computation·2012· 44 citedOpen Access
Decidability Classes for Mobile Agents Computing
Lecture notes in computer science·2012· 18 cited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2011· 2 cited
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), San Jose, CA, USA
HAL (Le Centre pour la Communication Scientifique Directe)·2011· 1 cited
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
arXiv (Cornell University)·2011· 58 citedOpen Access
Decidability Classes for Mobile Agents Computing
arXiv (Cornell University)·2010· 3 citedOpen Access
On the additive constant of the k-server Work Function Algorithm
Information Processing Letters·2010· 3 cited
Online computation with advice
Theoretical Computer Science·2010· 143 cited
Bit-complexité des protocoles de gossip
HAL (Le Centre pour la Communication Scientifique Directe)·2010Open Access
Compact Ancestry Labeling Schemes for XML Trees
2010· 6 citedOpen Access
page 1 of 5Next →

Frequent Co-authors

Andrzej Pelc(16), David Ilcinkas(10), David Peleg(7), Lali Barrière(7), Cyril Gavoille(6), Nicola Santoro(5), Amos Korman(4), Nicolas Nisse(4), Fedor V. Fomin(4), Anders Dessmark(3), Paola Flocchini(3), Lata Narayanan(3), Philippe Gauron(3), Guy Peer(2), Yuval Emek(2), Adi Rosén(2), Krzysztof Diks(2), Evangelos Kranakis(2), Reuven Cohen(2), Dimitrios M. Thilikos(2)