Documents Related by Co-Citation

1112 Network Information Flow – Rudolf Ahlswede, Ning Cai, Shuo-yen Robert Li, Raymond W. Yeung - 2000
590 Linear network coding – Mea Wang, Baochun Li - 2003
522 An algebraic approach to network coding – Ralf Koetter, Muriel Médard, Senior Member - 2003
98 Polynomial Time Algorithms for Network Information Flow – Peter Sanders, Sebastian Egner, Ludo Tolhuizen - 2003
46 On the advantage of Network Coding for Improving Network Throughput – A Agarwal, M Charikar - 2004
188 Polynomial time algorithms for multicast network code construction – Sidharth Jaggi, Student Member, Peter S, Philip A. Chou, Michelle Effros Senior Member Ieee, Ludo M. G. M. Tolhuizen, Senior Member
77 Complexity classification of network information flow problems – A Rasala-Lehman, E Lehman - 2004
90 The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments – S Katti, D Katabi, W Hu, H Rahul, M Médard - 2005
87 Packing Steiner trees – Kamal Jain, Mohammad R. Salavatipoury, et al.
86 Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding – Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, Muriel Médard, Ebad Ahmed, Hyunjoo Lee - 2005
146 On Randomized Network Coding – Tracey Ho, Muriel Medard, Jun Shi, Michelle Effros, David R. Karger - 2003
2220 The capacity of wireless networks – Piyush Gupta, P. R. Kumar - 2000
8567 Elements of Information Theory – T M Cover, J A Thomas - 1991
23 An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem – Lap Chi Lau
7 On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies – Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau - 2004
27 A Comparison of Network Coding and Tree Packing – Yunnan Wu , Philip A. Chou, Kamal Jain - 2004
1875 Randomized Algorithms – Rajeev Motwani - 1995
64 Internets in the Sky: The Capacity of Three Dimensional Wireless Networks – Piyush Gupta, P. R. Kumar - 2001
125 A First Course in Information Theory – Raymond W Yeung - 2002