T. Ho
Computer Networks and Communications · IEEE Transactions on Information Theory · 2003–2008
A researcher in the Science corpus: 7 papers; trusts 11 researchers and is trusted by 13 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 41 citations into it; #2,503 of 9,886 by trust here, #1,297 by citations
- Electrical and Electronic Engineering — 23 citations into it; #3,004 of 16,539 by trust here, #5,046 by citations
- Computational Theory and Mathematics — 12 citations into it
- Reinforcement Learning — 7 citations into it
Whom T. Ho trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ralf Koetter
- Muriel Médard
- Ning Cai
- Richard S. Sutton
- Peter Sanders
- Desmond S. Lun
- Shuo-Yen Robert Li
- David R Karger
- Raymond W. Yeung
- Michelle Effros
Who trusts T. Ho overall
- A. Dimakis
- Muriel Médard
- Mea Wang
- Ralf Koetter
- Supratim Deb
- Dong Nguyen
- Sachin Rajsekhar Katti
- Sidharth Jaggi
- Yunnan Wu
- Christina Fragouli
Papers from T. Ho's perspective
Ordered by how strongly the researchers T. Ho 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
- LT codes (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
- 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))
- Raptor codes (IEEE Transactions on Information Theory)
- Constructing minimum-energy broadcast trees in wireless ad hoc networks (ACM Interational Symposium on Mobile Ad Hoc Networking and Computing)
- Optimal routing, link scheduling and power control in multihop wireless networks (IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428))
- Simultaneous routing and resource allocation via dual decomposition (IEEE Transactions on Communications)
Their papers
- A Random Linear Network Coding Approach to Multicast (2006) — 2,685 citations
- The benefits of coding over routing in a randomized setting (2003) — 1,187 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
- Minimum-cost multicast over coded packet networks (2005) — 447 citations
- All learning is Local: Multi-agent Learning in Global Reward Games (2003) — 189 citations
- On Randomized Network Coding (2003) — 607 citations