Michelle Effros
Computer Networks and Communications · 2003–2008
A researcher in the Science corpus: 8 papers; trusts 8 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 51 citations into it; #1,712 of 9,886 by trust here, #855 by citations
- Electrical and Electronic Engineering — 30 citations into it; #1,917 of 16,539 by trust here, #3,918 by citations
- Computational Theory and Mathematics — 18 citations into it
- Artificial Intelligence — 6 citations into it
Whom Michelle Effros trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Michelle Effros overall
- A. Dimakis
- Sachin Rajsekhar Katti
- Muriel Médard
- T. Ho
- Mea Wang
- Dong Nguyen
- Sidharth Jaggi
- Desmond S. Lun
- Ralf Koetter
- Supratim Deb
Papers from Michelle Effros's perspective
Ordered by how strongly the researchers Michelle Effros trusts endorse each paper. Same corpus, a different order for every researcher.
- Network information flow (IEEE Transactions on Information Theory)
- The benefits of coding over routing in a randomized setting (IEEE International Symposium on Information Theory. Proceedings)
- Polynomial time algorithms for network information flow (ACM Symposium on Parallelism in Algorithms and Architectures)
- Full length article: On coding for reliable communication over packet networks
- Capacity of wireless erasure networks (IEEE Transactions on Information Theory)
- Practical Byzantine fault tolerance
- A First Course in Information Theory
- Secure routing for mobile ad hoc networks (IEEE Communications Surveys and Tutorials)
- Coding for Errors and Erasures in Random Network Coding (IEEE Transactions on Information Theory)
- On Randomized Network Coding
Their papers
- A Random Linear Network Coding Approach to Multicast (2006) — 2,685 citations
- Capacity of wireless erasure networks (2006) — 402 citations
- The benefits of coding over routing in a randomized setting (2003) — 1,187 citations
- Full length article: On coding for reliable communication over packet networks (2008) — 646 citations
- Resilient Network Coding in the Presence of Byzantine Adversaries (2008) — 570 citations
- Polynomial time algorithms for multicast network code construction (2005) — 993 citations
- Byzantine modification detection in multicast networks using randomized network coding (2004) — 301 citations
- On Randomized Network Coding (2003) — 607 citations