Randall Dougherty

Orcid: 0000-0002-4129-1866

According to our database1, Randall Dougherty authored at least 26 papers between 1987 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Covering Radius of the Reed-Muller Code RM(m - 4, m) in RM(m - 3, m).
IEEE Trans. Inf. Theory, 2022

2015
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding.
IEEE Trans. Inf. Theory, 2015

Achievable Rate Regions for Network Coding.
IEEE Trans. Inf. Theory, 2015

2014
Characteristic-dependent linear rank inequalities and network coding applications.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Computations of linear rank inequalities on six variables.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2012
How to build a probability-free casino.
Inf. Comput., 2012

Translating the Cantor set by a random
CoRR, 2012

2011
Network Coding and Matroid Theory.
Proc. IEEE, 2011

Non-Shannon Information Inequalities in Four Random Variables
CoRR, 2011

2009
Linear rank inequalities on five or more variables
CoRR, 2009

2008
Linear Network Codes and Systems of Polynomial Equations.
IEEE Trans. Inf. Theory, 2008

2007
Networks, Matroids, and Non-Shannon Information Inequalities.
IEEE Trans. Inf. Theory, 2007

2006
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks.
IEEE Trans. Inf. Theory, 2006

Unachievability of network coding capacity.
IEEE Trans. Inf. Theory, 2006

Network routing capacity.
IEEE Trans. Inf. Theory, 2006

Six New Non-Shannon Information Inequalities.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Insufficiency of linear coding in network information flow.
IEEE Trans. Inf. Theory, 2005

2004
Linearity and solvability in multicast networks.
IEEE Trans. Inf. Theory, 2004

The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.
SIAM J. Discret. Math., 2004

Unflippable Tetrahedral Complexes.
Discret. Comput. Geom., 2004

2001
Open Sets Satisfying Systems of Congruences.
J. Math. Log., 2001

Solutions to Congruences using Sets with the Property of Baire.
J. Math. Log., 2001

1997
Narrow Coverings of omega-ary Product Spaces.
Ann. Pure Appl. Log., 1997

1993
Critical Points in an Algebra of Elementary Embeddings.
Ann. Pure Appl. Logic, 1993

1987
Monotone but not Positive Subsets of the Cantor Space.
J. Symb. Log., 1987

Sequential Discreteness and Clopen-I-Boolean Classes.
J. Symb. Log., 1987


  Loading...