Randall Dougherty | Academic Influence

Randall Dougherty's AcademicInfluence.com Rankings

Randall Dougherty

Mathematics

#5100

World Rank

#7211

Historical Rank

#1701

USA Rank

Measure Theory

#3267

World Rank

#3862

Historical Rank

#945

USA Rank

mathematics Degrees

Download Badge

Mathematics

Randall Dougherty's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Randall Dougherty Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Randall Dougherty is an American mathematician. Dougherty has made contributions in widely varying areas of mathematics, including set theory, logic, real analysis, discrete mathematics, computational geometry, information theory, and coding theory.

(See a Problem?)

Randall Dougherty's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Insufficiency of linear coding in network information flow (2005) (344)
The structure of hy-per nite Borel equivalence relations (1994) (245)
Networks, Matroids, and Non-Shannon Information Inequalities (2007) (230)
Nonnegativity-, monotonicity-, or convexity-preserving cubic and quintic Hermite interpolation (1989) (147)
Six New Non-Shannon Information Inequalities (2006) (110)
Insufficiency of linear coding in network information flow (2005) (97)
Network routing capacity (2005) (90)
Unachievability of network coding capacity (2006) (87)
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks (2006) (86)
Linear rank inequalities on five or more variables (2009) (82)
Linearity and solvability in multicast networks (2004) (74)
Non-Shannon Information Inequalities in Four Random Variables (2011) (73)
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case (1994) (73)
Linear Network Codes and Systems of Polynomial Equations (2008) (59)
Banach-Tarski decompositions using sets with the property of Baire (1994) (44)
Examples of non-shy sets (1994) (39)
Network Coding and Matroid Theory (2011) (38)
Finite Left-Distributive Algebras and Embedding Algebras (1992) (37)
Reducibility and nonreducibility between ℓ^{} equivalence relations (1999) (27)
The prevalence of permutations with infinite cycles (1994) (27)
Critical Points in an Algebra of Elementary Embeddings (1992) (26)
Definable Boolean combinations of open sets are Boolean combinations of open definable sets (2001) (22)
Covering radius computations for binary cyclic codes (1991) (22)
Achievable Rate Regions for Network Coding (2012) (20)
Computations of linear rank inequalities on six variables (2014) (17)
Banach-Tarski paradox using pieces with the property of Baire. (1992) (17)
Translating the Cantor set by a random real (2014) (17)
Unflippable Tetrahedral Complexes (2004) (16)
How Many Turing Degrees are There (2000) (16)
Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding (2014) (14)
The complexity of antidifferentiation (1991) (13)
How to build a probability-free casino (2012) (12)
Which Bernoulli measures are good measures (2008) (10)
On homeomorphic Bernoulli measures on the Cantor space (2004) (10)
On Disjoint Borel Uniformizations (1996) (9)
Narrow Coverings of omega-ary Product Spaces (1996) (8)
Matroidal Networks (6)
Monotone but not positive subsets of the Cantor space (1987) (6)
The Vámos Network (2006) (5)
Functors on the category of finite sets (1992) (5)
The Vámos Network (2005) (4)
Characteristic-dependent linear rank inequalities and network coding applications (2014) (4)
Left-distributive embedding algebras (1997) (4)
Monotone reducibility over the Cantor space (1988) (3)
Hausdorff Measures and Sets of Uniqueness for Trigonometric Series (1989) (3)
Finite left-distributive algebras and embedding algebras\endtitle (1992) (3)
Sequential discreteness and clopen-I-Boolean classes (1987) (3)
The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m) (2021) (3)
On homeomorphic product measures on the Cantor set (2004) (2)
Open Sets Satisfying Systems of Congruences (2000) (1)
Solutions to Congruences using Sets with the Property of Baire (2000) (1)
Translating the Cantor set by a random (2012) (1)
Canonical Universes and Intuitions About Probabilities (2006) (1)
A divide-and-conquer algorithm for grid generation (1994) (1)
Network Routing on Regular Directed Graphs from Spanning Factorizations (2014) (1)
Network Coding and Matroid Theory This paper explores the connection between network coding and matroid theory, a branch of mathematics that generalizes linear algebra and graph theory. (2011) (1)
A [55, 16, 19] binary Goppa code and related codes having large minimum distance (1991) (1)
FUNCTORS ON THE CATEGORY OF FINITE (2009) (0)
Binary Cyclic Codes (2021) (0)
Narrow coverings of omega-product spaces (1996) (0)
Network Coding And (2011) (0)
2 8 Ja n 20 00 How Many Turing Degrees are There ? (2000) (0)

This paper list is powered by the following services:

Other Resources About Randall Dougherty

en.wikipedia.org

What Schools Are Affiliated With Randall Dougherty?

Randall Dougherty is affiliated with the following schools:

Image Attributions

Image Source for Randall Dougherty