default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil J. Calkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Amy B. Gore
, Mary E. Kurz, Matthew J. Saltzman, Blake Splitter, William C. Bridges, Neil J. Calkin:
Clemson University's Rotational Attendance Plan During COVID-19. INFORMS J. Appl. Anal. 52(6): 553-567 (2022)- [j28]Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless, David J. Jeffrey, Piers W. Lawrence:
A Fractal Eigenvector. Am. Math. Mon. 129(6): 503-523 (2022) - 2021
- [j27]Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless:
Some Facts and Conjectures about Mandelbrot Polynomials. Maple Trans. 1(1): <ee>https://doi.org/10.5206/mt.v1i1.14037</ee> (2021) - [j26]Neil J. Calkin, Colm Mulcahy:
Reviews. Am. Math. Mon. 128(7): 667-672 (2021) - [j25]Neil J. Calkin, Killian Davis, Evan Haithcock, Catherine M. Kenyon, Sylvia Wu:
What Newton Might Have Known: Experimental Mathematics in the Classroom. Am. Math. Mon. 128(9): 845-855 (2021)
2010 – 2019
- 2017
- [j24]Jonathan M. Borwein, Neil J. Calkin, Scott B. Lindstrom, Andrew Mattingly:
Continued Logarithms and Associated Continued Fractions. Exp. Math. 26(4): 412-429 (2017) - 2016
- [j23]Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa:
What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments. Am. Math. Mon. 123(4): 382-386 (2016) - 2014
- [j22]Neil J. Calkin, Marcos López de Prado:
Stochastic flow diagrams. Algorithmic Finance 3(1-2): 21-42 (2014) - [j21]Neil J. Calkin, Marcos López de Prado:
The topology of macro financial flows: An application of stochastic flow diagrams. Algorithmic Finance 3(1-2): 43-85 (2014) - 2013
- [j20]Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob, Kevin James:
Taking the Convoluted Out of Bernoulli Convolutions: A Discrete Approach. Integers 13: A19 (2013)
2000 – 2009
- 2009
- [j19]Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith:
Finite field elements of high order arising from modular curves. Des. Codes Cryptogr. 51(3): 301-314 (2009) - [j18]Jonathan M. Borwein, Neil J. Calkin, Dante Manna:
Euler-Boole Summation Revisited. Am. Math. Mon. 116(5): 387-412 (2009) - 2007
- [j17]Neil J. Calkin, Jimena Davis, Kevin James, Elizabeth Perez, Charles H. Swannack:
Computing the integer partition function. Math. Comput. 76(259): 1619-1638 (2007) - 2004
- [j16]Peter Dankelmann, Neil J. Calkin:
The Domatic Number of Regular Graphs. Ars Comb. 73 (2004) - 2003
- [j15]Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy:
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electron. J. Comb. 10 (2003) - 2000
- [j14]Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf:
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory A 91(1-2): 171-190 (2000) - [j13]Neil J. Calkin, Herbert S. Wilf:
Recounting the Rationals. Am. Math. Mon. 107(4): 360-363 (2000)
1990 – 1999
- 1999
- [j12]Neil J. Calkin, Jennifer D. Key, Marialuisa J. de Resmini:
Minimum Weight and Dimension Formulas for Some Geometric Codes. Des. Codes Cryptogr. 17(1-3): 105-120 (1999) - 1998
- [j11]Neil J. Calkin, Peter J. Cameron:
Almost Odd Random Sum-Free Sets. Comb. Probab. Comput. 7(1): 27-32 (1998) - [j10]Neil J. Calkin:
On the structure of a random sum-free set of positive integers. Discret. Math. 190(1-3): 247-257 (1998) - [j9]Neil J. Calkin, Herbert S. Wilf:
The Number of Independent Sets in a Grid Graph. SIAM J. Discret. Math. 11(1): 54-60 (1998) - 1997
- [j8]Neil J. Calkin:
Dependent Sets of Constant Weight Binary Vectors. Comb. Probab. Comput. 6(3): 263-271 (1997) - [j7]Neil J. Calkin, Paul Erdös, Craig A. Tovey:
New Ramsey Bounds from Cyclic Graphs of Prime Order. SIAM J. Discret. Math. 10(3): 381-387 (1997) - 1996
- [j6]Neil J. Calkin, Steven R. Finch:
Conditions on Periodicity for Sum-Free Sets. Exp. Math. 5(2): 131-137 (1996) - [j5]Neil J. Calkin:
Dependent sets of constant weight vectors in GF(q). Random Struct. Algorithms 9(1-2): 49-53 (1996) - 1994
- [j4]Neil J. Calkin:
A curious binomial identity. Discret. Math. 131(1-3): 335-337 (1994) - 1992
- [j3]Neil J. Calkin, Alan M. Frieze, Brendan D. McKay:
On Subgraph Sizes in Random Graphs. Comb. Probab. Comput. 1: 123-134 (1992) - [j2]Neil J. Calkin, Alan M. Frieze, Ludek Kucera:
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. Random Struct. Algorithms 3(2): 215-222 (1992) - 1990
- [j1]Neil J. Calkin, Alan M. Frieze:
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. Random Struct. Algorithms 1(1): 39-50 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
