- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j15 |      | 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 |
| i3 | | Randall Dougherty, Jack Lutz, R. Daniel Mauldin, Jason Teutsch: Translating the Cantor set by a random. CoRR abs/1205.4821 (2012) |
| 2011 | ||
| j14 | | 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 | ||
| j13 | | 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 | ||
| j12 | | 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 | ||
| j11 | | Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Network routing capacity. IEEE Transactions on Information Theory 52(3): 777-788 (2006) |
| j10 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Unachievability of network coding capacity. IEEE Transactions on Information Theory 52(6): 2365-2372 (2006) |
| j9 | | Randall Dougherty, Kenneth Zeger: Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. IEEE Transactions on Information Theory 52(11): 5067-5077 (2006) |
| 2005 | ||
| j8 | | 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 | ||
| j7 | | Randall Dougherty, Vance Faber, Michael Murphy: Unflippable Tetrahedral Complexes. Discrete & Computational Geometry 32(3): 309-315 (2004) |
| j6 | | Randall Dougherty, Vance Faber: The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discrete Math. 17(3): 478-519 (2004) |
| j5 | | Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Linearity and solvability in multicast networks. IEEE Transactions on Information Theory 50(10): 2243-2256 (2004) |
| 1997 | ||
| j4 | | Randall Dougherty: Narrow Coverings of omega-ary Product Spaces. Ann. Pure Appl. Logic 88(1): 47-91 (1997) |
| 1993 | ||
| j3 | | Randall Dougherty: Critical Points in an Algebra of Elementary Embeddings. Ann. Pure Appl. Logic 65(3): 211-241 (1993) |
| 1987 | ||
| j2 |  | Randall Dougherty: Sequential Discreteness and Clopen-I-Boolean Classes. J. Symb. Log. 52(1): 232-242 (1987) |
| j1 | | Randall Dougherty: Monotone but not Positive Subsets of the Cantor Space. J. Symb. Log. 52(3): 817-818 (1987) |
| 1 | Jillian Cannons | |
| 2 | Adam Chalcraft | |
| 3 | Vance Faber | |
| 4 | Christopher F. Freiling | |
| 5 | Jack Lutz | |
| 6 | R. Daniel Mauldin | |
| 7 | Michael Murphy | |
| 8 | Jason Teutsch | |
| 9 | Kenneth Zeger |
Colors in the list of coauthors
Last update Fri May 24 04:05:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page