Muriel Médard
Computer Networks and Communications · 2000–2018
A researcher in the Science corpus: 15 papers; trusts 27 researchers and is trusted by 67 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 104 citations into it; #293 of 9,996 by trust here, #324 by citations
- Electrical and Electronic Engineering — 44 citations into it; #304 of 16,595 by trust here, #2,875 by citations
- Computational Theory and Mathematics — 17 citations into it; #2,002 of 12,489 by trust here, #2,253 by citations
- Artificial Intelligence — 10 citations into it
Whom Muriel Médard trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ralf Koetter
- T. Ho
- Dimitri P. Bertsekas
- Raymond W. Yeung
- Sanjit Biswas
- Ning Cai
- Sachin Rajsekhar Katti
- Amin Shokrollahi
- Michael Luby
- Peter Sanders
Who trusts Muriel Médard overall
- Emil Björnson
- T. Ho
- Sachin Rajsekhar Katti
- Ezio Biglieri
- A. Dimakis
- Yongzhi Li
- Ralf Koetter
- Andrea J. Goldsmith
- Mea Wang
- J. Nicholas Laneman
Papers from Muriel Médard's perspective
Ordered by how strongly the researchers Muriel Médard 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)
- Full length article: On coding for reliable communication over packet networks
- Polynomial time algorithms for network information flow (ACM Symposium on Parallelism in Algorithms and Architectures)
- Impact of Interference on Multi-Hop Wireless Network Performance (ACM/IEEE International Conference on Mobile Computing and Networking)
- Capacity of wireless erasure networks (IEEE Transactions on Information Theory)
- LT codes (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
- Coding for Errors and Erasures in Random Network Coding (IEEE Transactions on Information Theory)
- Energy-Efficient Broadcast and Multicast Trees in Wireless Networks (Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064))
- An algebraic approach to network coding (Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252))
Their papers
- The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel (2000) — 1,001 citations
- A Random Linear Network Coding Approach to Multicast (2006) — 2,685 citations
- An algebraic approach to network coding (2001) — 2,542 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
- Byzantine modification detection in multicast networks using randomized network coding (2004) — 301 citations
- Algebraic gossip: a network coding approach to optimal multiple rumor mongering (2006) — 320 citations
- A Characterization of Guesswork on Swiftly Tilting Curves (2018) — 30 citations
- Toward Interconnected Virtual Reality: Opportunities, Challenges, and Enablers (2017) — 534 citations
- XORs in the air: practical wireless network coding (2008) — 583 citations
- Symbol-level network coding for wireless mesh networks (2008) — 309 citations
- XORs in the Air: Practical Wireless Network Coding (2006) — 2,819 citations
- Minimum-cost multicast over coded packet networks (2005) — 447 citations
- On Randomized Network Coding (2003) — 607 citations