Neil J. Calkin

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Continued Logarithms and Associated Continued Fractions.
Experimental Mathematics, 2017

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

Stochastic flow diagrams.
Algorithmic Finance, 2014

2009
Euler-Boole Summation Revisited.
The American Mathematical Monthly, 2009

Finite field elements of high order arising from modular curves.
Des. Codes Cryptography, 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.
Electr. J. Comb., 2003

2000
Recounting the Rationals.
The American Mathematical Monthly, 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 Cryptography, 1999

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

On the structure of a random sum-free set of positive integers.
Discrete Mathematics, 1998

Almost Odd Random Sum-Free Sets.
Combinatorics, Probability & Computing, 1998

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

Dependent Sets of Constant Weight Binary Vectors.
Combinatorics, Probability & Computing, 1997

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

Conditions on Periodicity for Sum-Free Sets.
Experimental Mathematics, 1996

1994
A curious binomial identity.
Discrete Mathematics, 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.
Combinatorics, Probability & Computing, 1992

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


  Loading...