Joshua N. Cooper

Orcid: 0000-0001-5187-1322

Affiliations:
  • University of South Carolina, Department of Mathematics, Columbia, SC, USA


According to our database1, Joshua N. Cooper authored at least 36 papers between 2002 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A generalization of the Graham-Pollak tree theorem to Steiner distance.
Discret. Math., April, 2024

2023
Characteristic power series of graph limits.
Eur. J. Comb., 2023

2022
Sampling Permutations for Shapley Value Estimation.
J. Mach. Learn. Res., 2022

2021
A Harary-Sachs theorem for hypergraphs.
J. Comb. Theory, Ser. B, 2021

Geometric vs Algebraic Nullity for Hyperpaths.
CoRR, 2021

Recurrence Ranks and Moment Sequences.
CoRR, 2021

Spectral Extremal Results for Hypergraphs.
Electron. J. Comb., 2021

2020
A New Characterization of <i>V</i>-Posets.
Order, 2020

Stably computing the multiplicity of known roots given leading coefficients.
Numer. Linear Algebra Appl., 2020

2019
Transfer Entropy in Continuous Time.
CoRR, 2019

Uniquely pressable graphs: Characterization, enumeration, and recognition.
Adv. Appl. Math., 2019

2018
On the Adjacency Spectra of Hypertrees.
Electron. J. Comb., 2018

Density dichotomy in random words.
Contributions Discret. Math., 2018

2017
Throwing a Ball as Far as Possible, Revisited.
Am. Math. Mon., 2017

2016
Asymptotic Density of Zimin Words.
Discret. Math. Theor. Comput. Sci., 2016

The Twelfth International Conference on Permutation Patterns, 2014.
Australas. J Comb., 2016

The complexity of counting poset and permutation patterns.
Australas. J Comb., 2016

2015
Coloring so that no Pythagorean Triple is Monochromatic.
CoRR, 2015

2014
Critical sets for Sudoku and general graph colorings.
Discret. Math., 2014

Deterministic walks with choice.
Discret. Appl. Math., 2014

2013
Greedy Galois Games.
Am. Math. Mon., 2013

Generalized Pattern Frequency in Large Permutations.
Electron. J. Comb., 2013

Generalized Fibonacci recurrences and the lex-least de Bruijn sequence.
Adv. Appl. Math., 2013

2012
Uniquely C 4-Saturated Graphs.
Graphs Comb., 2012

2011
Monochromatic Boxes in Colored Grids.
SIAM J. Discret. Math., 2011

Graphs with Asymptotically Invariant Degree Sequences under Restriction.
Internet Math., 2011

Graham's Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions
CoRR, 2011

2010
The discrepancy of the lex-least de Bruijn sequence.
Discret. Math., 2010

Iterated Point-Line Configurations Grow Doubly-Exponentially.
Discret. Comput. Geom., 2010

2007
Deterministic Random Walks on Regular Trees.
Electron. Notes Discret. Math., 2007

Deterministic random walks on the integers.
Eur. J. Comb., 2007

2006
Simulating a Random Walk with Constant Error.
Comb. Probab. Comput., 2006

A Permutation Regularity Lemma.
Electron. J. Comb., 2006

Deterministic Random Walks.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2004
De Bruijn cycles for covering codes.
Random Struct. Algorithms, 2004

2002
Asymmetric Binary Covering Codes.
J. Comb. Theory, Ser. A, 2002


  Loading...