D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 49 Citations 13,826 136 World Ranking 2980 National Ranking 59

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • The Internet
  • Statistics

His scientific interests lie mostly in Computer network, Distributed computing, Network topology, Random graph and Fair queuing. His work in the fields of Computer network, such as Bandwidth, overlaps with other areas such as Coupon. The Distributed computing study combines topics in areas such as Overhead, Reliability, Gossip protocol, Selection and Mobile computing.

Laurent Massoulié usually deals with Reliability and limits it to topics linked to Communication in small groups and Node and Peer-to-peer. His biological study spans a wide range of topics, including Connectivity, Graph theory, Complete graph and Network packet. His Random graph study combines topics from a wide range of disciplines, such as Adjacency matrix, Eigenvalues and eigenvectors and Spectral radius.

His most cited work include:

  • The effect of network topology on the spread of epidemics (643 citations)
  • Epidemic information dissemination in distributed systems (461 citations)
  • Peer-to-peer membership management for gossip-based protocols (458 citations)

What are the main themes of his work throughout his whole career to date?

Laurent Massoulié mostly deals with Computer network, Distributed computing, Random graph, Combinatorics and Theoretical computer science. His Computer network study integrates concerns from other disciplines, such as Scalability and The Internet. His study in the field of Peer-to-peer is also linked to topics like Loss network.

His Random graph research is multidisciplinary, incorporating perspectives in Line graph, Spectral radius and Degree. Laurent Massoulié has researched Combinatorics in several fields, including Discrete mathematics, Eigenvalues and eigenvectors and Stochastic block model. His work carried out in the field of Network congestion brings together such families of science as Network traffic control and Multipath routing.

He most often published in these fields:

  • Computer network (26.03%)
  • Distributed computing (19.42%)
  • Random graph (17.36%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (16.53%)
  • Convex function (7.44%)
  • Random graph (17.36%)

In recent papers he was focusing on the following fields of study:

Laurent Massoulié mainly investigates Combinatorics, Convex function, Random graph, Rate of convergence and Algorithm. The Combinatorics study combines topics in areas such as Eigenvalues and eigenvectors and Stochastic block model. His work in Random graph addresses subjects such as Degree, which are connected to disciplines such as Tree, Block, Automorphism and Probabilistic method.

His Algorithm study incorporates themes from Graph dynamics, Theoretical computer science and Isoperimetric inequality. He integrates Models of communication and Distributed computing in his research. His Distributed computing research is multidisciplinary, relying on both Service provider, Online algorithm and Cache.

Between 2015 and 2021, his most popular works were:

  • Optimal algorithms for smooth and strongly convex distributed optimization in networks (146 citations)
  • A utility optimization approach to network cache design (98 citations)
  • Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (80 citations)

In his most recent research, the most cited papers focused on:

  • Computer network
  • The Internet
  • Statistics

Convex function, Rate of convergence, Algorithm, Graph and Condition number are his primary areas of study. The various areas that he examines in his Rate of convergence study include Smoothing and Lipschitz continuity. In his study, Random graph and Combinatorics is inextricably linked to Matrix, which falls within the broad field of Algorithm.

Laurent Massoulié interconnects Function, Convergence, Computation and Eigengap in the investigation of issues within Condition number. His Sampling research incorporates themes from Distribution, Network topology, Asynchronous algorithms, Key and Scaling. His study in Upper and lower bounds is interdisciplinary in nature, drawing from both Smoothness and Mathematical optimization.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Bandwidth sharing: objectives and algorithms

Laurent Massoulié;James Roberts.
international conference on computer communications (1999)

932 Citations

The effect of network topology on the spread of epidemics

A. Ganesh;L. Massoulie;D. Towsley.
international conference on computer communications (2005)

799 Citations

Epidemic information dissemination in distributed systems

P.T. Eugster;R. Guerraoui;A.-M. Kermarrec;L. Massoulie.
IEEE Computer (2004)

790 Citations

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

A.J. Ganesh;A.-M. Kermarrec;L. Massoulie.
IEEE Transactions on Computers (2003)

728 Citations

Probabilistic reliable dissemination in large-scale systems

A.-M. Kermarrec;L. Massoulie;A.J. Ganesh.
IEEE Transactions on Parallel and Distributed Systems (2003)

565 Citations

Impact of fairness on Internet performance

Thomas Bonald;Laurent Massoulié.
measurement and modeling of computer systems (2001)

556 Citations

Greening the internet with nano data centers

Vytautas Valancius;Nikolaos Laoutaris;Laurent Massoulié;Christophe Diot.
conference on emerging network experiment and technology (2009)

437 Citations

Bandwidth sharing and admission control for elastic traffic

L. Massoulié;J. W. Roberts.
Telecommunication Systems (2000)

381 Citations

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

S. Ioannidis;A. Chaintreau;L. Massoulie.
international conference on computer communications (2009)

355 Citations

STABILITY OF NONLINEAR HAWKES PROCESSES

Pierre Brémaud;Laurent Massoulié.
Annals of Probability (1996)

331 Citations

Best Scientists Citing Laurent Massoulié

Don Towsley

Don Towsley

University of Massachusetts Amherst

Publications: 66

Anne-Marie Kermarrec

Anne-Marie Kermarrec

École Polytechnique Fédérale de Lausanne

Publications: 56

R. Srikant

R. Srikant

University of Illinois at Urbana-Champaign

Publications: 51

Thomas Bonald

Thomas Bonald

Télécom ParisTech

Publications: 46

Sanjay Shakkottai

Sanjay Shakkottai

The University of Texas at Austin

Publications: 46

Sem Borst

Sem Borst

Eindhoven University of Technology

Publications: 43

Alexandre Proutiere

Alexandre Proutiere

Royal Institute of Technology

Publications: 40

Mung Chiang

Mung Chiang

Purdue University West Lafayette

Publications: 38

Emilio Leonardi

Emilio Leonardi

Polytechnic University of Turin

Publications: 35

Devavrat Shah

Devavrat Shah

MIT

Publications: 32

François Baccelli

François Baccelli

The University of Texas at Austin

Publications: 31

Steven H. Low

Steven H. Low

California Institute of Technology

Publications: 31

Rachid Guerraoui

Rachid Guerraoui

École Polytechnique Fédérale de Lausanne

Publications: 30

Shouhuai Xu

Shouhuai Xu

University of Colorado Colorado Springs

Publications: 30

Piet Van Mieghem

Piet Van Mieghem

Delft University of Technology

Publications: 29

Dah Ming Chiu

Dah Ming Chiu

Chinese University of Hong Kong

Publications: 28

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us
Something went wrong. Please try again later.