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 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
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.
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.
Resilient network coding in the presence of Byzantine adversaries
S. Jaggi;M. Langberg;S. Katti;T. Ho.
ieee international conference computer and communications (2007)
Resilient Network Coding in the Presence of Byzantine Adversaries
S. Jaggi;M. Langberg;S. Katti;T. Ho.
IEEE Transactions on Information Theory (2008)
A unified framework for approximating and clustering data
Dan Feldman;Michael Langberg.
symposium on the theory of computing (2011)
The encoding complexity of network coding
M. Langberg;A. Sprintson;J. Bruck.
international symposium on information theory (2005)
The encoding complexity of network coding
Michael Langberg;Alexander Sprintson;Jehoshua Bruck.
IEEE Transactions on Information Theory (2006)
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Uriel Feige;Michael Langberg.
Journal of Algorithms (2001)
Universal ε-approximators for integrals
Michael Langberg;Leonard J. Schulman.
symposium on discrete algorithms (2010)
On the Hardness of Approximating the Network Coding Capacity
Michael Langberg;Alex Sprintson.
IEEE Transactions on Information Theory (2011)
Realtime classification for encrypted traffic
Roni Bar Yanai;Michael Langberg;David Peleg;Liam Roditty.
symposium on experimental and efficient algorithms (2010)
An Equivalence Between Network Coding and Index Coding
Michelle Effros;Salim El Rouayheb;Michael Langberg.
IEEE Transactions on Information Theory (2015)
If you think any of the details on this page are incorrect, let us know.
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:
California Institute of Technology
California Institute of Technology
Texas A&M University
California Institute of Technology
Weizmann Institute of Science
California Institute of Technology
Technion – Israel Institute of Technology
Weizmann Institute of Science
The University of Texas at Austin
MIT
MIT
Queensland University of Technology
University of Toronto
National University of Singapore
University of Auckland
University of Utah
University of KwaZulu-Natal
Chiba University
University of California, Los Angeles
Stanford University
University of Münster
Martin Luther University Halle-Wittenberg
University of Cambridge
Memorial Sloan Kettering Cancer Center
King's College London
University of Michigan–Ann Arbor