World's Best Scientists 2026 revealed!
Award Badge
Computer Science
France
2025

D-Index & Metrics

Computer Science

D-Index
59
Citations
17130
World Ranking
3373
National Ranking
56

Research.com Recognitions

  • 2025 - Research.com Computer Science in France Leader Award
  • 2023 - Research.com Computer Science in France Leader Award
  • 2022 - Research.com Computer Science in France Leader Award

Overview

Laurent Massoulié is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research spans multiple areas within computer science and mathematics, with a focus on topics such as stochastic gradient optimization techniques, Markov chains and Monte Carlo methods, privacy-preserving technologies in data, sparse and compressive sensing techniques, random matrices and applications, distributed control multi-agent systems, and stochastic processes and statistical mechanics.

Their published work covers a range of fields including computer science and mathematics, contributing notably to subfields like artificial intelligence, statistics and probability, computer networks and communications, computational theory and mathematics, and mathematical physics.

Laurent Massoulié has frequently published in venues such as arXiv (Cornell University), Operations Research, The Annals of Applied Probability, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), and the SIAM Journal on Optimization.

Recent papers include:

  • Partial Recovery in the Graph Alignment Problem, 2022, Operations Research
  • An Optimal Algorithm for Decentralized Finite-Sum Optimization, 2021, SIAM Journal on Optimization
  • Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area, 2020, Comptes Rendus Mathématique
  • Statistically Preconditioned Accelerated Gradient Method for Distributed Optimization, 2020, arXiv (Cornell University)
  • Impossibility of Partial Recovery in the Graph Alignment Problem, 2021, arXiv (Cornell University)

Their frequent co-authors include:

  • Mathieu Even
  • Hadrien Hendrikx
  • Luca Ganassali
  • Francis Bach
  • Kevin Scaman

Best Publications

  • Bandwidth sharing: objectives and algorithms

    Laurent Massoulié;James Roberts

  • The effect of network topology on the spread of epidemics

    A. Ganesh;L. Massoulie;D. Towsley

  • Epidemic information dissemination in distributed systems

    P.T. Eugster;R. Guerraoui;A.-M. Kermarrec;L. Massoulie

  • Peer-to-peer membership management for gossip-based protocols

    A.J. Ganesh;A.-M. Kermarrec;L. Massoulie

  • Probabilistic reliable dissemination in large-scale systems

    A.-M. Kermarrec;L. Massoulie;A.J. Ganesh

  • Impact of fairness on Internet performance

    Thomas Bonald;Laurent Massoulié

  • STABILITY OF NONLINEAR HAWKES PROCESSES

    Pierre Brémaud;Laurent Massoulié

  • Greening the internet with nano data centers

    Vytautas Valancius;Nikolaos Laoutaris;Laurent Massoulié;Christophe Diot

  • Community detection thresholds and the weak Ramanujan property

    Laurent Massoulié

  • Thresholds for virus spread on networks

    Moez Draief;Ayalvadi Ganesh;Laurent Massoulié

  • Optimal and scalable distribution of content updates over a mobile social network

    S. Ioannidis;A. Chaintreau;L. Massoulie

  • Bandwidth sharing and admission control for elastic traffic

    L. Massoulié;J. W. Roberts

  • A Utility Optimization Approach to Network Cache Design

    Mostafa Dehghan;Laurent Massoulie;Don Towsley;Daniel Sadoc Menasche

  • Epidemic live streaming: optimal performance trade-offs

    Thomas Bonald;Laurent Massoulié;Fabien Mathieu;Diego Perino

  • Optimal content placement for peer-to-peer video-on-demand systems

    Bo Tan;Laurent Massoulie

  • Coupon replication systems

    Laurent Massoulié;Milan Vojnovic

  • From Epidemics to Distributed Computing

    P. Th. Eugster;R. Guerraoui;A.-M. Kermarrec;L. Massoulie

  • Gossiping with Multiple Messages

    S. Sanghavi;B. Hajek;L. Massoulie

  • Peer counting and sampling in overlay networks: random walk methods

    Laurent Massoulié;Erwan Le Merrer;Anne-Marie Kermarrec;Ayalvadi Ganesh

  • SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication

    Ayalvadi J. Ganesh;Anne-Marie Kermarrec;Laurent Massoulié

  • Optimal algorithms for smooth and strongly convex distributed optimization in networks

    Kevin Seaman;Francis Bach;Sébastien Bubeck;Yin Tat Lee

Frequent Co-Authors

Peter Key
Peter Key Microsoft (United States)
Marc Lelarge
Marc Lelarge École Normale Supérieure
Ayalvadi Ganesh
Ayalvadi Ganesh University of Bristol
Stratis Ioannidis
Stratis Ioannidis Northeastern University
Anne-Marie Kermarrec
Anne-Marie Kermarrec École Polytechnique Fédérale de Lausanne
Francis Bach
Francis Bach École Normale Supérieure
Don Towsley
Don Towsley University of Massachusetts Amherst
Theodoros Salonidis
Theodoros Salonidis IBM (United States)
Sébastien Bubeck
Sébastien Bubeck Microsoft (United States)
Milan Vojnovic
Milan Vojnovic London School of Economics and Political Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a degree in Computer Science opens doors to many different fields and options for further education. You might be interested in the many related college majors that complement computer science, such as data science, information technology, or software engineering.

If you’re considering graduate studies, some learners prefer to pursue easy masters degrees that balance academic advancement with manageable workloads. This is ideal for those looking to gain new skills without a heavy time commitment.

For those who aspire to reach the highest levels academically but are concerned about cost, exploring the cheapest doctorate degree options can make advanced education more accessible. Fast-tracking your academic journey is also possible by considering the fastest online edd programs available, which can save both time and money.

Whether you’re entering the workforce or continuing your education, the pathway you choose should reflect your career goals, interests, and personal circumstances.

Best Scientists Citing Laurent Massoulié

Trending Scientists

Recently Published Articles