- On the expected performance of a parallel algorithm for finding maximal independent
- Combinatorics, Probability and Computing (2008) 00, 000000. c 2008 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom
- A CURIOUS BINOMIAL IDENTITY NEIL J. CALKIN
- Recounting the rationals Neil Calkin
- Slow Convergence of a Double-Biased Neil J. Calkin and Jeffrey B. Farr
- ON A CLASS OF APERIODIC SUM-FREE SETS NEIL J. CALKIN
- Averaging Sequences, Deranged Mappings, and a Problem of Lambert and Slater
- Combinatorics, Probability and Computing (2003) 00, 000000. c 2003 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom
- The Domatic Number of Regular Graphs Peter Dankelmann
- COUNTING GENERALIZED SUM-FREE SETS NEIL J. CALKIN AND JAN MCDONALD THOMSON
- Probabilistic Analysis Of A Parallel Algorithm For Finding Maximal Independent Sets
- Minimum weight for some binary geometric codes Neil J. Calkin
- A CHARACTERIZATION FOR THE LENGTH OF CYCLES OF THE N -NUMBER DUCCI GAME
- NEW RAMSEY BOUNDS FROM CYCLIC GRAPHS OF PRIME NEIL J. CALKIN, PAUL ERDOS, AND CRAIG A. TOVEY
- FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS NEIL J. CALKIN
- SIAM J. SCI. STAT. COMP. c 1997 Society for Industrial and Applied Mathematics Vol. 0, No. 0, pp. 000000, April 1997 000
- On the number of co-prime-free sets. Neil J. Calkin and Andrew Granville *
- On the number of sum-free sets. Neil J. Calkin
- DEPENDENT SETS OF CONSTANT WEIGHT VECTORS IN GF(q) NEIL J. CALKIN
- ON SUBGRAPH SIZES IN RANDOM Neil Calkin
- On the expected performance of a parallel algorithm for finding maximal independent
- Cancellation in Cyclic Consecutive Systems Neil J. Calkin Jonathan Edds Douglas R. Shier
- Counting sets of integers, no k of which sum to another
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- ON THE STRUCTURE OF A RANDOM SUM-FREE SET OF POSITIVE INTEGERS
