Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. - Neil J. Calkin; Alan M. Frieze (Random Struct. Algorithms, 1990)

On Subgraph Sizes in Random Graphs. - Neil J. Calkin; Alan M. Frieze; Brendan D. McKay (Comb. Probab. Comput., 1992)

On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. - Neil J. Calkin; Alan M. Frieze; Ludek Kucera (Random Struct. Algorithms, 1992)

A curious binomial identity. - Neil J. Calkin (Discret. Math., 1994)

Conditions on Periodicity for Sum-Free Sets. - Neil J. Calkin; Steven R. Finch (Exp. Math., 1996)

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

Dependent Sets of Constant Weight Binary Vectors. - Neil J. Calkin (Comb. Probab. Comput., 1997)

New Ramsey Bounds from Cyclic Graphs of Prime Order. - Neil J. Calkin; Paul Erdös; Craig A. Tovey (SIAM J. Discret. Math., 1997)

Almost Odd Random Sum-Free Sets. - Neil J. Calkin; Peter J. Cameron (Comb. Probab. Comput., 1998)

On the structure of a random sum-free set of positive integers. - Neil J. Calkin (Discret. Math., 1998)

The Number of Independent Sets in a Grid Graph. - Neil J. Calkin; Herbert S. Wilf (SIAM J. Discret. Math., 1998)

Minimum Weight and Dimension Formulas for Some Geometric Codes. - Neil J. Calkin; Jennifer D. Key; Marialuisa J. de Resmini (Des. Codes Cryptogr., 1999)

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. - Neil J. Calkin; E. Rodney Canfield; Herbert S. Wilf (J. Comb. Theory A, 2000)

Recounting the Rationals. - Neil J. Calkin; Herbert S. Wilf (Am. Math. Mon., 2000)

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. - Neil J. Calkin; Criel Merino; Steven D. Noble; Marc Noy (Electron. J. Comb., 2003)

The Domatic Number of Regular Graphs. - Peter Dankelmann; Neil J. Calkin (Ars Comb., 2004)

Computing the integer partition function. - Neil J. Calkin; Jimena Davis; Kevin James; Elizabeth Perez; Charles H. Swannack (Math. Comput., 2007)

Finite field elements of high order arising from modular curves. - Jessica F. Burkhart; Neil J. Calkin; Shuhong Gao; Justine C. Hyde-Volpe; Kevin James; Hiren Maharaj; Shelly Manber; Jared Ruiz; Ethan Smith (Des. Codes Cryptogr., 2009)

Euler-Boole Summation Revisited. - Jonathan M. Borwein; Neil J. Calkin; Dante Manna (Am. Math. Mon., 2009)

Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach. - Neil J. Calkin; Julia Davis; Michelle Delcourt; Zebediah Engberg; Jobby Jacob; Kevin James (Integers, 2013)

Stochastic flow diagrams. - Neil J. Calkin; Marcos López de Prado (Algorithmic Finance, 2014)

The topology of macro financial flows: An application of stochastic flow diagrams. - Neil J. Calkin; Marcos López de Prado (Algorithmic Finance, 2014)

What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments. - Neil J. Calkin; Beth Novick; Hayato Ushijima-Mwesigwa (Am. Math. Mon., 2016)

Continued Logarithms and Associated Continued Fractions. - Jonathan M. Borwein; Neil J. Calkin; Scott B. Lindstrom; Andrew Mattingly (Exp. Math., 2017)

Some Facts and Conjectures about Mandelbrot Polynomials. - Neil J. Calkin; Eunice Y. S. Chan; Robert M. Corless (Maple Trans., 2021)

What Newton Might Have Known: Experimental Mathematics in the Classroom. - Neil J. Calkin; Killian Davis; Evan Haithcock; Catherine M. Kenyon; Sylvia Wu (Am. Math. Mon., 2021)

Reviews. - Neil J. Calkin; Colm Mulcahy (Am. Math. Mon., 2021)

Clemson University's Rotational Attendance Plan During COVID-19. - Amy B. Gore; Mary E. Kurz; Matthew J. Saltzman; Blake Splitter; William C. Bridges; Neil J. Calkin (INFORMS J. Appl. Anal., 2022)

A Fractal Eigenvector. - Neil J. Calkin; Eunice Y. S. Chan; Robert M. Corless; David J. Jeffrey; Piers W. Lawrence (Am. Math. Mon., 2022)