Her scientific interests lie mostly in Linear network coding, Multicast, Theoretical computer science, Computer network and Distributed computing. Her study in Linear network coding is interdisciplinary in nature, drawing from both Policy-based routing, Code rate, Hazy Sighted Link State Routing Protocol, Triangular routing and Routing protocol. Her Multicast research includes themes of Node, Flow network, Coding and Topology.
The concepts of her Theoretical computer science study are interwoven with issues in Huffman coding and Algorithm, Decoding methods, Block code, Variable-length code. Her Computer network research is multidisciplinary, incorporating elements of Wireless and Overlay network. Her Distributed computing research is multidisciplinary, relying on both Routing domain, Wireless ad hoc network, Network topology, Wireless network and Destination-Sequenced Distance Vector routing.
Michelle Effros mainly focuses on Linear network coding, Algorithm, Theoretical computer science, Decoding methods and Computer network. Her research in Linear network coding intersects with topics in Unicast, Distributed computing, Multicast, Coding and Topology. In the subject of general Algorithm, her work in Data compression, Vector quantization and Lossless compression is often linked to Transform coding, thereby combining diverse domains of study.
Her research on Theoretical computer science also deals with topics like
Her primary areas of investigation include Encoder, Communication channel, Computer network, Node and Decoding methods. Her work in Computer network addresses subjects such as Distributed computing, which are connected to disciplines such as Scale. Her Node research is multidisciplinary, incorporating perspectives in Wireless, Adder and Linear network coding.
The study incorporates disciplines such as Network model, Encoding and Multicast in addition to Wireless. Her research integrates issues of Equivalence, Theoretical computer science, Unicast, Function and Channel capacity in her study of Linear network coding. Her Random access research incorporates elements of Algorithm and Point-to-point.
The scientist’s investigation covers issues in Encoder, Communication channel, Computer network, Linear network coding and Random access. Michelle Effros has included themes like Transmitter and Topology in her Encoder study. The Communication channel study combines topics in areas such as Node, Enhanced Data Rates for GSM Evolution and Code.
Michelle Effros interconnects Transmission time, Real-time computing and Distributed computing in the investigation of issues within Computer network. Her Linear network coding study combines topics in areas such as Wireless, Equivalence, Combinatorics and Variable-length code, Shannon–Fano coding. Much of her study explores Random access relationship to Algorithm.
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.
A Random Linear Network Coding Approach to Multicast
T. Ho;M. Medard;R. Koetter;D.R. Karger.
IEEE Transactions on Information Theory (2006)
The benefits of coding over routing in a randomized setting
T. Ho;R. Koetter;M. Medard;D.R. Karger.
international symposium on information theory (2003)
Polynomial time algorithms for multicast network code construction
S. Jaggi;P. Sanders;P.A. Chou;M. Effros.
IEEE Transactions on Information Theory (2005)
On Coding for Reliable Communication over Packet Networks
Desmond S. Lun;Muriel Medard;Ralf Koetter;Michelle Effros.
arXiv: Information Theory (2005)
On Randomized Network Coding
Tracey Ho;Muriel Médard;Jun Shi;Michelle Effros.
Full length article: On coding for reliable communication over packet networks
Desmond S. Lun;Muriel MéDard;Ralf Koetter;Michelle Effros.
Physical Communication (2008)
Capacity of wireless erasure networks
A.F. Dana;R. Gowaikar;R. Palanki;B. Hassibi.
IEEE Transactions on Information Theory (2006)
Resilient Network Coding in the Presence of Byzantine Adversaries
S. Jaggi;M. Langberg;S. Katti;T. Ho.
IEEE Transactions on Information Theory (2008)
Byzantine modification detection in multicast networks using randomized network coding
T. Ho;B. Leong;R. Koetter;M. Medard.
international symposium on information theory (2004)
Network Coding for Wireless Applications: A Brief Tutorial
Supratim Deb;Michelle Effros;Tracey Ho;David R. Karger.
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-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.
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: