D-Index & Metrics Best Publications

D-Index & Metrics 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.

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 36 Citations 5,405 195 World Ranking 7262 National Ranking 3414

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • Combinatorics
  • Algorithm

Michael Langberg spends much of his time researching Linear network coding, Discrete mathematics, Combinatorics, Theoretical computer science and Linear code. Michael Langberg interconnects Computational complexity theory, Decoding methods, Distributed computing and Shannon–Fano coding in the investigation of issues within Linear network coding. His study looks at the relationship between Distributed computing and topics such as Wireless network, which overlap with Adversary and Throughput.

His Discrete mathematics research is multidisciplinary, incorporating perspectives in Upper and lower bounds and Combinatorial optimization. In his research on the topic of Theoretical computer science, Telecommunications network, Node and Wireless is strongly related with Multicast. In his study, Robustness is inextricably linked to Coding theory, which falls within the broad field of Network packet.

His most cited work include:

  • Resilient network coding in the presence of Byzantine adversaries (353 citations)
  • Resilient Network Coding in the Presence of Byzantine Adversaries (234 citations)
  • A unified framework for approximating and clustering data (227 citations)

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

His scientific interests lie mostly in Discrete mathematics, Combinatorics, Linear network coding, Communication channel and Theoretical computer science. The Discrete mathematics study combines topics in areas such as Binary erasure channel, Upper and lower bounds, Binary symmetric channel and Linear code. His Linear network coding study integrates concerns from other disciplines, such as Unicast, Coding and Topology.

His Communication channel research is multidisciplinary, incorporating elements of Encoder and Decoding methods, Code word. His study focuses on the intersection of Theoretical computer science and fields such as Shannon–Fano coding with connections in the field of Tunstall coding. His study on Computer network also encompasses disciplines like

  • Adversary that intertwine with fields like Eavesdropping,
  • Distributed computing, which have a strong connection to Wireless network.

He most often published in these fields:

  • Discrete mathematics (34.42%)
  • Combinatorics (29.77%)
  • Linear network coding (29.30%)

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

  • Communication channel (21.40%)
  • Discrete mathematics (34.42%)
  • Linear network coding (29.30%)

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

The scientist’s investigation covers issues in Communication channel, Discrete mathematics, Linear network coding, Node and Computer network. His work carried out in the field of Communication channel brings together such families of science as Encoder and Decoding methods. His Discrete mathematics study combines topics from a wide range of disciplines, such as Gilbert–Varshamov bound, Code word, Information theory, Upper and lower bounds and Coding.

His Coding study incorporates themes from Multicast network, Adversary and Eavesdropping. The concepts of his Linear network coding study are interwoven with issues in Theoretical computer science, Shannon–Fano coding, Enhanced Data Rates for GSM Evolution, Network topology and Tunstall coding. His work in the fields of Unicast and Broadcasting overlaps with other areas such as Transmitter and Time rate.

Between 2016 and 2021, his most popular works were:

  • Sufficiently Myopic Adversaries Are Blind (11 citations)
  • The Interplay of Causality and Myopia in Adversarial Channel Models (6 citations)
  • L1-norm principal-component analysis in L2-norm-reduced-rank data subspaces (5 citations)

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

  • Computer network
  • Statistics
  • Algorithm

Michael Langberg spends much of his time researching Communication channel, Topology, Encoder, Linear network coding and Code. His studies in Communication channel integrate themes in fields like Discrete mathematics and Decoding methods. Michael Langberg has included themes like Binary erasure channel and Information theory in his Discrete mathematics study.

He works mostly in the field of Decoding methods, limiting it down to topics relating to Computer network and, in certain cases, Transmission. While working on this project, Michael Langberg studies both Linear network coding and Rate vector. His studies examine the connections between Code word and genetics, as well as such issues in Upper and lower bounds, with regards to Combinatorics, Limit superior and limit inferior, Quadratic growth and Sequence.

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

Resilient network coding in the presence of Byzantine adversaries

S. Jaggi;M. Langberg;S. Katti;T. Ho.
ieee international conference computer and communications (2007)

654 Citations

Resilient Network Coding in the Presence of Byzantine Adversaries

S. Jaggi;M. Langberg;S. Katti;T. Ho.
IEEE Transactions on Information Theory (2008)

363 Citations

A unified framework for approximating and clustering data

Dan Feldman;Michael Langberg.
symposium on the theory of computing (2011)

350 Citations

The encoding complexity of network coding

M. Langberg;A. Sprintson;J. Bruck.
international symposium on information theory (2005)

206 Citations

The encoding complexity of network coding

Michael Langberg;Alexander Sprintson;Jehoshua Bruck.
IEEE Transactions on Information Theory (2006)

182 Citations

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

Uriel Feige;Michael Langberg.
Journal of Algorithms (2001)

171 Citations

Universal ε-approximators for integrals

Michael Langberg;Leonard J. Schulman.
symposium on discrete algorithms (2010)

141 Citations

On the Hardness of Approximating the Network Coding Capacity

Michael Langberg;Alex Sprintson.
IEEE Transactions on Information Theory (2011)

130 Citations

Realtime classification for encrypted traffic

Roni Bar Yanai;Michael Langberg;David Peleg;Liam Roditty.
symposium on experimental and efficient algorithms (2010)

128 Citations

An Equivalence Between Network Coding and Index Coding

Michelle Effros;Salim El Rouayheb;Michael Langberg.
IEEE Transactions on Information Theory (2015)

127 Citations

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

Contact us

Best Scientists Citing Michael Langberg

Muriel Medard

Muriel Medard

MIT

Publications: 57

Alex Sprintson

Alex Sprintson

Texas A&M University

Publications: 33

Christina Fragouli

Christina Fragouli

University of California, Los Angeles

Publications: 33

Tracey Ho

Tracey Ho

California Institute of Technology

Publications: 31

Eitan Yaakobi

Eitan Yaakobi

Technion – Israel Institute of Technology

Publications: 24

Frank R. Kschischang

Frank R. Kschischang

University of Toronto

Publications: 24

Salim El Rouayheb

Salim El Rouayheb

Rutgers, The State University of New Jersey

Publications: 23

Giuseppe Caire

Giuseppe Caire

Technical University of Berlin

Publications: 21

Young-Han Kim

Young-Han Kim

University of California, San Diego

Publications: 20

Michael Gastpar

Michael Gastpar

École Polytechnique Fédérale de Lausanne

Publications: 20

Venkatesan Guruswami

Venkatesan Guruswami

University of California, Berkeley

Publications: 20

Mohammad Ali Maddah-Ali

Mohammad Ali Maddah-Ali

University of Minnesota

Publications: 19

Jehoshua Bruck

Jehoshua Bruck

California Institute of Technology

Publications: 19

Raymond W. Yeung

Raymond W. Yeung

Chinese University of Hong Kong

Publications: 18

Michelle Effros

Michelle Effros

California Institute of Technology

Publications: 18

Alexandros G. Dimakis

Alexandros G. Dimakis

The University of Texas at Austin

Publications: 17

Trending Scientists

Ben Upcroft

Ben Upcroft

Queensland University of Technology

Toniann Pitassi

Toniann Pitassi

University of Toronto

Heow Pueh Lee

Heow Pueh Lee

National University of Singapore

Bruce W. Melville

Bruce W. Melville

University of Auckland

Ling Zang

Ling Zang

University of Utah

R. M. Gous

R. M. Gous

University of KwaZulu-Natal

Hideki Tanzawa

Hideki Tanzawa

Chiba University

Peipei Ping

Peipei Ping

University of California, Los Angeles

Kerwyn Casey Huang

Kerwyn Casey Huang

Stanford University

Andreas Stracke

Andreas Stracke

University of Münster

Bruno Glaser

Bruno Glaser

Martin Luther University Halle-Wittenberg

Horace Barlow

Horace Barlow

University of Cambridge

Andrew J. Vickers

Andrew J. Vickers

Memorial Sloan Kettering Cancer Center

Gerome Breen

Gerome Breen

King's College London

John W. Creswell

John W. Creswell

University of Michigan–Ann Arbor

Something went wrong. Please try again later.