default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandall Dougherty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j20]Randall Dougherty
, R. Daniel Mauldin, Mark Tiefenbruck:
The Covering Radius of the Reed-Muller Code RM(m - 4, m) in RM(m - 3, m). IEEE Trans. Inf. Theory 68(1): 560-571 (2022)- 2015
- [j19]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable Rate Regions for Network Coding. IEEE Trans. Inf. Theory 61(5): 2488-2509 (2015) - [j18]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding. IEEE Trans. Inf. Theory 61(5): 2510-2530 (2015) - 2012
- [j17]Adam Chalcraft, Randall Dougherty, Christopher F. Freiling, Jason Teutsch:
How to build a probability-free casino. Inf. Comput. 211: 160-164 (2012) - 2011
- [j16]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network Coding and Matroid Theory. Proc. IEEE 99(3): 388-405 (2011) - 2008
- [j15]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linear Network Codes and Systems of Polynomial Equations. IEEE Trans. Inf. Theory 54(5): 2303-2316 (2008) - 2007
- [j14]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Networks, Matroids, and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 53(6): 1949-1969 (2007) - 2006
- [j13]Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network routing capacity. IEEE Trans. Inf. Theory 52(3): 777-788 (2006) - [j12]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Unachievability of network coding capacity. IEEE Trans. Inf. Theory 52(6): 2365-2372 (2006) - [j11]Randall Dougherty, Kenneth Zeger:
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. IEEE Trans. Inf. Theory 52(11): 5067-5077 (2006) - 2005
- [j10]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Insufficiency of linear coding in network information flow. IEEE Trans. Inf. Theory 51(8): 2745-2759 (2005) - 2004
- [j9]Randall Dougherty, Vance Faber, Michael Murphy:
Unflippable Tetrahedral Complexes. Discret. Comput. Geom. 32(3): 309-315 (2004) - [j8]Randall Dougherty, Vance Faber:
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discret. Math. 17(3): 478-519 (2004) - [j7]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linearity and solvability in multicast networks. IEEE Trans. Inf. Theory 50(10): 2243-2256 (2004) - 2001
- [j6]Randall Dougherty:
Solutions to Congruences using Sets with the Property of Baire. J. Math. Log. 1(2) (2001) - [j5]Randall Dougherty:
Open Sets Satisfying Systems of Congruences. J. Math. Log. 1(2) (2001) - 1997
- [j4]Randall Dougherty:
Narrow Coverings of omega-ary Product Spaces. Ann. Pure Appl. Log. 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)
Conference and Workshop Papers
- 2014
- [c7]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-dependent linear rank inequalities and network coding applications. ISIT 2014: 101-105 - [c6]Randall Dougherty:
Computations of linear rank inequalities on six variables. ISIT 2014: 2819-2823 - 2012
- [c5]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable rate regions for network coding. ITA 2012: 160-167 - 2008
- [c4]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linear network codes and systems of polynomial equations. ISIT 2008: 1838-1842 - 2006
- [c3]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Six New Non-Shannon Information Inequalities. ISIT 2006: 233-236 - 2005
- [c2]Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network routing capacity. ISIT 2005: 11-13 - [c1]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Insufficiency of linear coding in network information flow. ISIT 2005: 264-267
Informal and Other Publications
- 2021
- [i6]Randall Dougherty, R. Daniel Mauldin, Mark Tiefenbruck:
The Covering Radius of the Reed-Muller Code RM(m-4, m) in RM(m-3, m). CoRR abs/2106.13910 (2021) - 2014
- [i5]Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-Dependent Linear Rank Inequalities with Applications to Network Coding. CoRR abs/1401.2507 (2014) - 2013
- [i4]Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Achievable Rate Regions for Network Coding. CoRR abs/1311.4601 (2013) - 2012
- [i3]Randall Dougherty, Jack H. Lutz, R. Daniel Mauldin, Jason Teutsch:
Translating the Cantor set by a random. CoRR abs/1205.4821 (2012) - 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
