- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j9 |      | Adam Chalcraft, Randall Dougherty, Christopher F. Freiling, Jason Teutsch: How to build a probability-free casino. Inf. Comput. 211: 160-164 (2012) |
| c2 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Achievable rate regions for network coding. ITA 2012: 160-167 |
| 2011 | ||
| j8 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Network Coding and Matroid Theory. Proceedings of the IEEE 99(3): 388-405 (2011) |
| i2 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Non-Shannon Information Inequalities in Four Random Variables. CoRR abs/1104.3602 (2011) |
| 2009 | ||
| i1 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Linear rank inequalities on five or more variables. CoRR abs/0910.0284 (2009) |
| 2008 | ||
| j7 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Linear Network Codes and Systems of Polynomial Equations. IEEE Transactions on Information Theory 54(5): 2303-2316 (2008) |
| c1 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Linear network codes and systems of polynomial equations. ISIT 2008: 1838-1842 |
| 2007 | ||
| j6 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Networks, Matroids, and Non-Shannon Information Inequalities. IEEE Transactions on Information Theory 53(6): 1949-1969 (2007) |
| 2006 | ||
| j5 | | Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Network routing capacity. IEEE Transactions on Information Theory 52(3): 777-788 (2006) |
| j4 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Unachievability of network coding capacity. IEEE Transactions on Information Theory 52(6): 2365-2372 (2006) |
| 2005 | ||
| j3 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory 51(8): 2745-2759 (2005) |
| 2004 | ||
| j2 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Linearity and solvability in multicast networks. IEEE Transactions on Information Theory 50(10): 2243-2256 (2004) |
| 2003 | ||
| j1 | | Christopher F. Freiling, Douglas S. Jungreis, François Théberge, Kenneth Zeger: Almost all complete binary prefix codes have a self-synchronizing string. IEEE Transactions on Information Theory 49(9): 2219-2225 (2003) |
| 1 | Jillian Cannons | |
| 2 | Adam Chalcraft | |
| 3 | Randall Dougherty | |
| 4 | Douglas S. Jungreis | |
| 5 | Jason Teutsch | |
| 6 | François Théberge | |
| 7 | Kenneth Zeger |
Data released under the ODC-BY 1.0 license — See also our legal information page