MR4382846 Bridges, William C. ; Calkin, Neil J. ; Kenyon, Catherine M. ; Saltzman, Matthew J. Log transformations: What not to expect when you're expecting. Comm. Statist. Theory Methods 51 (2022), no. 5, 1514--1521. MR4335047 Calkin, Neil J. ; Davis, Killian ; Haithcock, Evan ; Kenyon, Catherine M. ; Wu, Sylvia . What Newton might have known: experimental mathematics in the classroom. Amer. Math. Monthly 128 (2021), no. 9, 845--855. MR4296896 Calkin, Neil ; Mulcahy, Colm . The unity of combinatorics [book review of 4306671]. Amer. Math. Monthly 128 (2021), no. 7, 667--672. MR3684575 Borwein, Jonathan M. ; Calkin, Neil J. ; Lindstrom, Scott B. ; Mattingly, Andrew . Continued logarithms and associated continued fractions. Exp. Math. 26 (2017), no. 4, 412--429. MR3493381 Calkin, Neil J. ; Novick, Beth ; Ushijima-Mwesigwa, Hayato . What Moser could have asked: counting Hamilton cycles in tournaments. Amer. Math. Monthly 123 (2016), no. 4, 382--386. MR3468277 Calkin, Neil ; Mulcahy, Colm . Gallia est omnis divisa in partes quattuor. The mathematics of various entertaining subjects, 139--148, Princeton Univ. Press, Princeton, NJ, 2016. MR3219127 Calkin, Neil J. ; López de Prado, Marcos . The topology of macro financial flows: an application of stochastic flow diagrams. Algorithmic Finance 3 (2014), no. 1-2, 43--85. MR3219126 Calkin, Neil J. ; López de Prado, Marcos . Stochastic flow diagrams. Algorithmic Finance 3 (2014), no. 1-2, 21--42. MR3157031 Calkin, Neil J. ; Janoski, Janine E. ; Nelson, Allison ; Ryan, Sydney ; Xu, Chao . Champion spiders in the game of Graph Nim. Congr. Numer. 218 (2013), 5--19. MR3083481 Calkin, Neil J. ; Davis, Julia ; Delcourt, Michelle ; Engberg, Zebediah ; Jacob, Jobby ; James, Kevin . Taking the convoluted out of Bernoulli convolutions: a discrete approach. Integers 13 (2013), Paper No. A19, 12 pp. MR2812425 Calkin, Neil ; Faulkner, Bryan ; James, Kevin ; King, Matt ; Penniston, David . Average Frobenius distributions for elliptic curves over abelian extensions. Acta Arith. 149 (2011), no. 3, 215--244. MR2763747 Calkin, Neil J. ; Davis, Julia ; Delcourt, Michelle ; Engberg, Zebediah ; Jacob, Jobby ; James, Kevin . Discrete Bernoulli convolutions: an algorithmic approach toward bound improvement. Proc. Amer. Math. Soc. 139 (2011), no. 5, 1579--1584. MR2762470 Calkin, Neil J. ; James, Kevin ; Janoski, Janine E. ; Leggett, Sarah ; Richards, Bryce ; Sitaraman, Nathan ; Thomas, Stephanie M. Computing strategies for graphical Nim. Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 202 (2010), 171--185. MR2584351 Calkin, Neil J. ; Jamison, Robert E. ; Light, J. Bowman . Efficient cross comparison graphs. Proceedings of the Fortieth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 198 (2009), 169--188. MR2584329 Baumann, Jolie ; Calkin, Neil ; Lyle, Jeremy . On the domination of kings. Proceedings of the Fortieth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 197 (2009), 161--176. MR2510837 Borwein, Jonathan M. ; Calkin, Neil J. ; Manna, Dante . Euler-Boole summation revisited. Amer. Math. Monthly 116 (2009), no. 5, 387--412. MR2485499 Burkhart, Jessica F. ; Calkin, Neil J. ; Gao, Shuhong ; Hyde-Volpe, Justine C. ; James, Kevin ; Maharaj, Hiren ; Manber, Shelly ; Ruiz, Jared ; Smith, Ethan . Finite field elements of high order arising from modular curves. Des. Codes Cryptogr. 51 (2009), no. 3, 301--314. MR2489827 Calkin, Neil J. ; Janoski, Janine E. Matrices of row and column sum 2. Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 192 (2008), 19--32. MR2472078 Calkin, Neil ; Drake, Nate ; James, Kevin ; Law, Shirley ; Lee, Philip ; Penniston, David ; Radder, Jeanne . Divisibility properties of the 5-regular and 13-regular partition functions. Integers 8 (2008), A60, 10 pp. MR2419197 Brown, Brittany ; Calkin, Neil J. ; Flowers, Timothy B. ; James, Kevin ; Smith, Ethan ; Stout, Amy . Elliptic curves, modular forms, and sums of Hurwitz class numbers. J. Number Theory 128 (2008), no. 6, 1847--1863. MR2320374 Bailey, David H. ; Borwein, Jonathan M. ; Calkin, Neil J. ; Girgensohn, Roland ; Luke, D. Russell ; Moll, Victor H. Experimental mathematics in action. A K Peters, Ltd., Wellesley, MA, 2007. xii+322 pp. ISBN: 978-1-56881-271-7; 1-56881-271-X MR2299791 Calkin, Neil ; Davis, Jimena ; James, Kevin ; Perez, Elizabeth ; Swannack, Charles . Computing the integer partition function. Math. Comp. 76 (2007), no. 259, 1619--1638. MR2311471 Calkin, Neil J. ; James, Kevin ; Purvis, Shannon ; Race, Shaina ; Schneider, Keith ; Yancey, Matthew . Counting kings: as easy as λ1,λ2,λ3…. Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 183 (2006), 83--95. MR2311287 Calkin, Neil J. ; James, Kevin ; Purvis, Shannon ; Race, Shaina ; Schneider, Keith ; Yancey, Matthew . Counting kings: explicit formulas, recurrence relations, and generating functions! Oh my! Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 182 (2006), 41--51. MR2264848 Brown, Morgan V. ; Calkin, Neil J. ; James, Kevin ; King, Adam J. ; Lockard, Shannon ; Rhoades, Robert C. Trivial Selmer groups and even partitions of a graph. Integers 6 (2006), A33, 17 pp. MR2193917 Bowman, Kim ; Calkin, Neil J. ; Cochran, Zach ; Flowers, Timothy ; James, Kevin ; Purvis, Shannon . Linear independence in a random binary vector model. 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing. Congr. Numer. 172 (2005), 29--32. MR2192081 Calkin, Neil J. ; Finch, Steven R. ; Flowers, Timothy B. Difference density and aperiodic sum-free sets. Integers 5 (2005), no. 2, A3, 10 pp. MR2129120 Calkin, Neil J. ; Stevens, John G. ; Thomas, Diana M. A characterization for the length of cycles of the n-number Ducci game. Fibonacci Quart. 43 (2005), no. 1, 53--59. MR2098768 Dankelmann, Peter ; Calkin, Neil . The domatic number of regular graphs. Ars Combin. 73 (2004), 247--255. MR1975754 Calkin, N. ; Merino, C. ; Noble, S. ; Noy, M. Improved bounds for the number of forests and acyclic orientations in the square lattice. Electron. J. Combin. 10 (2003), Research Paper 4, 18 pp. MR1985176 Calkin, Neil J. ; Farr, Jeffrey B. Slow convergence of a double-biased sequence. Proceedings of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2002). Congr. Numer. 159 (2002), 159--165. MR1910515 Calkin, Neil J. ; Edds, Jonathan D. ; Shier, Douglas R. Cancellation in cyclic consecutive systems. Probabilistic methods in combinatorics and combinatorial optimization. J. Comput. Appl. Math. 142 (2002), no. 1, 13--26. MR1779779 Calkin, Neil J. ; Canfield, E. Rodney ; Wilf, Herbert S. Averaging sequences, deranged mappings, and a problem of Lampert and Slater. In memory of Gian-Carlo Rota. J. Combin. Theory Ser. A 91 (2000), no. 1-2, 171--190. MR1763062 Calkin, Neil ; Wilf, Herbert S. Recounting the rationals. Amer. Math. Monthly 107 (2000), no. 4, 360--363. MR1714374 Calkin, Neil J. ; Key, Jennifer D. ; de Resmini, Marialuisa J. Minimum weight and dimension formulas for some geometric codes. Des. Codes Cryptogr. 17 (1999), no. 1-3, 105--120. MR1642597 Calkin, Neil J. Factors of sums of powers of binomial coefficients. Acta Arith. 86 (1998), no. 1, 17--26. MR1639726 Calkin, Neil J. On the structure of a random sum-free set of positive integers. Discrete Math. 190 (1998), no. 1-3, 247--257. MR1612853 Calkin, Neil J. ; Wilf, Herbert S. The number of independent sets in a grid graph. SIAM J. Discrete Math. 11 (1998), no. 1, 54--60. MR1611106 Calkin, Neil J. ; Cameron, P. J. Almost odd random sum-free sets. Combin. Probab. Comput. 7 (1998), no. 1, 27--32. MR1605903 Calkin, Neil J. ; Thomson, Jan McDonald . Counting generalized sum-free sets. J. Number Theory 68 (1998), no. 2, 151--159. MR1464565 Calkin, Neil J. Dependent sets of constant weight binary vectors. Combin. Probab. Comput. 6 (1997), no. 3, 263--271. MR1459945 Calkin, Neil J. ; Erdős, Paul ; Tovey, Craig A. New Ramsey bounds from cyclic graphs of prime order. SIAM J. Discrete Math. 10 (1997), no. 3, 381--387. MR1611728 Calkin, Neil J. Dependent sets of constant weight vectors in GF(q). Proceedings of the Seventh International Conference on Random Structures and Algorithms (Atlanta, GA, 1995). Random Structures Algorithms 9 (1996), no. 1-2, 49--53. MR1420197 Calkin, Neil J. ; Granville, Andrew . On the number of co-prime-free sets. Number theory (New York, 1991–1995), 9--18, Springer, New York, 1996. MR1418960 Calkin, Neil J. ; Finch, Steven R. Conditions on periodicity for sum-free sets. Experiment. Math. 5 (1996), no. 2, 131--137. MR1382754 Calkin, Neil J. ; Taylor, Angela C. Counting sets of integers, no k of which sum to another. J. Number Theory 57 (1996), no. 2, 323--327. MR1373341 Calkin, Neil J. ; Erdős, Paul . On a class of aperiodic sum-free sets. Math. Proc. Cambridge Philos. Soc. 120 (1996), no. 1, 1--5. MR1287743 Calkin, Neil J. A curious binomial identity. Discrete Math. 131 (1994), no. 1-3, 335--337. MR1179243 Calkin, Neil ; Frieze, Alan ; McKay, Brendan D. On subgraph sizes in random graphs. Combin. Probab. Comput. 1 (1992), no. 2, 123--134. MR1151363 Calkin, Neil J. ; Frieze, A. M. ; Kučera, L. On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph. Random Structures Algorithms 3 (1992), no. 2, 215--221. MR1068490 Calkin, Neil ; Frieze, Alan . Probabilistic analysis of a parallel algorithm for finding maximal independent sets. Random Structures Algorithms 1 (1990), no. 1, 39--50. MR1045283 Calkin, Neil J. On the number of sum-free sets. Bull. London Math. Soc. 22 (1990), no. 2, 141--144. MR2636860 Calkin, Neil James . Sum-free sets and measure spaces. Thesis (Ph.D.)–University of Waterloo (Canada). ProQuest LLC, Ann Arbor, MI, 1988. (no paging). ISBN: 978-0315-45327-2