Neil J. Calkin

Orcid: 0000-0002-5701-8581

According to our database1, Neil J. Calkin authored at least 29 papers between 1990 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A Fractal Eigenvector.
Am. Math. Mon., 2022

Clemson University's Rotational Attendance Plan During COVID-19.
INFORMS J. Appl. Anal., 2022

2021
Reviews.
Am. Math. Mon., 2021

What Newton Might Have Known: Experimental Mathematics in the Classroom.
Am. Math. Mon., 2021

Some Facts and Conjectures about Mandelbrot Polynomials.
Maple Trans., 2021

2017
Continued Logarithms and Associated Continued Fractions.
Exp. Math., 2017

2016
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments.
Am. Math. Mon., 2016

2014
The topology of macro financial flows: An application of stochastic flow diagrams.
Algorithmic Finance, 2014

Stochastic flow diagrams.
Algorithmic Finance, 2014

2013
Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach.
Integers, 2013

2009
Euler-Boole Summation Revisited.
Am. Math. Mon., 2009

Finite field elements of high order arising from modular curves.
Des. Codes Cryptogr., 2009

2007
Computing the integer partition function.
Math. Comput., 2007

2004
The Domatic Number of Regular Graphs.
Ars Comb., 2004

2003
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice.
Electron. J. Comb., 2003

2000
Recounting the Rationals.
Am. Math. Mon., 2000

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.
J. Comb. Theory, Ser. A, 2000

1999
Minimum Weight and Dimension Formulas for Some Geometric Codes.
Des. Codes Cryptogr., 1999

1998
The Number of Independent Sets in a Grid Graph.
SIAM J. Discret. Math., 1998

On the structure of a random sum-free set of positive integers.
Discret. Math., 1998

Almost Odd Random Sum-Free Sets.
Comb. Probab. Comput., 1998

1997
New Ramsey Bounds from Cyclic Graphs of Prime Order.
SIAM J. Discret. Math., 1997

Dependent Sets of Constant Weight Binary Vectors.
Comb. Probab. Comput., 1997

1996
Dependent sets of constant weight vectors in GF(q).
Random Struct. Algorithms, 1996

Conditions on Periodicity for Sum-Free Sets.
Exp. Math., 1996

1994
A curious binomial identity.
Discret. Math., 1994

1992
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph.
Random Struct. Algorithms, 1992

On Subgraph Sizes in Random Graphs.
Comb. Probab. Comput., 1992

1990
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets.
Random Struct. Algorithms, 1990


  Loading...