[This page is incomplete]

Change Log
1 May 2002: Page Started
5 May 2002: Decided to make consistent with MathSciNet. (but how can I get access?)
29 May 2002: Added MathSciNet-listed publications from Graham Leuschke, eliminated duplicates.

I've prepared this annotated Klarner bibliography from several sources. They're listed at the bottom of the document.

Mathematics Papers & Books

Klarner published approximately 65 peer-reviewed mathematics papers.

[1] 99g:00014 Mathematical recreations. A collection in honor of Martin Gardner. Corrected reprint of The Mathematical Gardner [Wadsworth, Belmont, CA, 1981]. Edited by David A. Klarner. Dover Publications, Inc., Mineola, NY, 1998. x+382 pp. ISBN: 0-486-40089-1 (Reviewer: G. A. Heuer)

[2] 93i:11031 Klarner, David A.; Post, Karel Some fascinating integer sequences. A collection of contributions in honour of Jack van Lint. Discrete Math. 106/107 (1992), 303--309. (Reviewer: Jeffrey O. Shallit)

[3] 92g:20093 Klarner, David A.; Birget, Jean-Camille; Satterfield, Wade On the undecidability of the freeness of integer matrix semigroups. Internat. J. Algebra Comput. 1 (1991), no. 2, 223--226. (Reviewer: Fred W. Roush)

[4] 90m:68075 Klarner, David A. $m$-recognizability of sets closed under certain affine functions. Discrete Appl. Math. 21 (1988), no. 3, 207--214.

[4] 90c:05064 Klarner, David A.; Magliveras, Spyros S. The number of tilings of a block with blocks. European J. Combin. 9 (1988), no. 4, 317--330. (Reviewer: Heiko Harborth)

[6] 88d:05084 Klarner, David The number of tiered posets modulo six. Discrete Math. 62 (1986), no. 3, 295--297. (Reviewer: G. L. Alexanderson)

[7] 85a:00009 {\cyr Matematicheski\u\i tsvetnik}. (Russian) [The mathematical Gardner] Edited by David A. Klarner. Translated from the English by Yu. A. Danilov. Translation edited and with a preface by I. M. Yaglom. ``Mir'', Moscow, 1983. 494 pp.

[8] 84j:05013 Klarner, David A.; Woodworth, Patricia Asymptotics for coefficients of algebraic functions. Aequationes Math. 23 (1981), no. 2-3, 236--241.

[9] 84i:05008 de Bruijn, N. G.; Klarner, D. A. Multisets of aperiodic cycles. SIAM J. Algebraic Discrete Methods 3 (1982), no. 3, 359--368. (Reviewer: P. Komjáth)

[10] 84h:10076 Klarner, David A. An algorithm to determine when certain sets have $0$-density. J. Algorithms 2 (1981), no. 1, 31--43. (Reviewer: Author's review)

[11] 83e:10081 Klarner, David A. A sufficient condition for certain semigroups to be free. J. Algebra 74 (1982), no. 1, 140--148. (Reviewer: Georges Grekos)

[12] 83e:10080 Hoffman, D. G.; Klarner, D. A. Sets of integers closed under affine operators---the finite basis theorem. Pacific J. Math. 83 (1979), no. 1, 135--144.

[13] 83e:05038 Klarner, D. My life among the polyominoes. Nieuw Arch. Wisk. (3) 29 (1981), no. 2, 156--177. (Reviewer: Heiko Harborth)

[14] 83b:10007 Klarner, David A. The ubiquitous rational sequence. Fibonacci Quart. 19 (1981), no. 3, 219--228. (Reviewer: Heiko Harborth)

[15] 83a:05018 Klarner, D. A. Mathematical crystal growth. II. Discrete Appl. Math. 3 (1981), no. 2, 113--117. (Reviewer: G. W. Peck)

[16] 82e:05016 Klarner, D. A. Mathematical crystal growth. I. Discrete Appl. Math. 3 (1981), no. 1, 47--52. (Reviewer: G. W. Peck)

[17] 82b:00003 The mathematical Gardner. Edited by David A. Klarner. Wadsworth International, Belmont, Calif.; PWS Publishers, Boston, Mass., 1981. viii+382 pp. ISBN: 0-534-98015-5 (Reviewer: A. K. Austin)

[18] 81m:05035 Klarner, David A. Queen squares. J. Recreational Math. 12 (1979/80), no. 3, 177--178. (Reviewer: J. B. Kelly)

[19] 81k:05008 Klarner, David; Pollack, Jordan Domino tilings of rectangles with fixed width. Discrete Math. 32 (1980), no. 1, 45--52. (Reviewer: I. Debroey)

[20] 81j:52009 Klarner, David A search for $N$-pentacube prime boxes. J. Recreational Math. 12 (1979/80), no. 4, 252--257. (Reviewer: A. Florian)

[21] 80i:10075 Hoffman, D. G.; Klarner, D. A. Sets of integers closed under affine operators---the closure of finite sets. Pacific J. Math. 78 (1978), no. 2, 337--344. (Reviewer: M. Livingston)

[22] 80b:05005 Klarner, David A. Sets of words which omit specified words as subwords. Nederl. Akad. Wetensch. Indag. Math. 40 (1978), no. 2, 230--237.

[23] 56 #17914 Klarner, David A. A model for population growth. Fibonacci Quart. 14 (1976), no. 3, 277--281. (Reviewer: Niels Keiding)

[24] 54 #2688 Klarner, David A. Some remarks on the Cayley-Hamilton theorem. Amer. Math. Monthly 83 (1976), no. 5, 367--369. (Reviewer: Marvin Marcus)

[25] 50 #9784 Klarner, D. A.; Rado, R. Arithmetic properties of certain recursively defined sets. Pacific J. Math. 53 (1974), 445--463. (Reviewer: S. Stein)

[26] 49 #91 Klarner, David A.; Rivest, Ronald L. Asymptotic bounds for the number of convex $n$-ominoes. Discrete Math. 8 (1974), 31--40. (Reviewer: R. C. Read)

[27] 49 #54 Klarner, David A. The number of ${\rm SDR}$'s in certain regular systems. Fibonacci Quart. 11 (1973), no. 3, 267--270. (Reviewer: R. A. Brualdi)

[28] 48 #8378 Klarner, D. A.; Rado, R. Linear combinations of sets of consecutive integers. Amer. Math. Monthly 80 (1973), 985--989. (Reviewer: I. Niven)

[29] 48 #1943 Klarner, D. A.; Rivest, R. L. A procedure for improving the upper bound for the number of $n$-ominoes. Canad. J. Math. 25 (1973), 585--602. (Reviewer: R. C. Read)

[30] 46 #8855 Problems from the Colloquium on Combinatorial Theory. Combinatorial theory and its applications, III (Proc. Colloq., Balatonfüred, 1969), pp. 1153--1195. North-Holland, Amsterdam, 1970. (Reviewer: R. K. Guy)

[31] 45 #8564 Klarner, D. A. Methods for the general cell growth problem. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969), pp. 705--720. North-Holland, Amsterdam, 1970. (Reviewer: R. C. Read)

[32] 45 #1773 Klarner, David A. Correspondences between plane trees and binary sequences. J. Combinatorial Theory 9 (1970), 401--411. (Reviewer: N. G. de Bruijn)

[33] 44 #6547 Klarner, D. A.; Hautus, M. L. J. Uniformly coloured stained glass windows. Proc. London Math. Soc. (3) 23 1971 613--628. (Reviewer: D. J. Kleitman)

[34] 43 #6103 Klarner, David A. A formula for a cycle inventory. Nederl. Akad. Wetensch. Proc. Ser. A 73=Indag. Math. 32 1970 217--221. (Reviewer: H. Nagao)

[35] 43 #2383 Hautus, M. L. J.; Klarner, D. A. The diagonal of a double power series. Duke Math. J. 38 1971 229--235. (Reviewer: M. E. Noble)

[36] 42 #2989 Klarner, David A. The number of classes of isomorphic graded partially ordered sets. J. Combinatorial Theory 9 1970 412--419. (Reviewer: D. J. Kleitman)

[37] 41 #8295 Klarner, David A. The number of Hamiltonian paths and cycles on $k$-colored graphs. Nederl. Akad. Wetensch. Proc. Ser. A 72=Indag. Math. 31 1969 384--387. (Reviewer: J. A. Bondy)

[38] 40 #7131 Klarner, David A. A packing theory. J. Combinatorial Theory 8 1970 272--278. (Reviewer: E. C. Milner)

[39] 40 #7123 Klarner, D. A. The problem of reflecting queens. Amer. Math. Monthly 74 1967 953--955.

[40] 40 #6362 Klarner, D. A.; Göbel, F. Packing boxes with congruent figures. Nederl. Akad. Wetensch. Proc. Ser. A 72 = Indag. Math. 31 1969 465--472. (Reviewer: D. W. Walkup)

[41] 40 #1894 Klarner, David A. Packing a rectangle with congruent $n$-ominoes. J. Combinatorial Theory 7 1969 107--115. (Reviewer: R. P. Bambah)

[42] 39 #5416 Klarner, David A. A correspondence between two sets of trees. Nederl. Akad. Wetensch. Proc. Ser. A 72=Indag. Math. 31 1969 292--296. (Reviewer: W. T. Tutte)

[43] 39 #3252 Klarner, D. A. Algebraic theory for difference and differential equations. Amer. Math. Monthly 76 1969 366--373. (Reviewer: I. Fenyö)

[44] 39 #1341 de Bruijn, N. G.; Klarner, D. A. Enumeration of generalized graphs. Nederl. Akad. Wetensch. Proc. Ser. A 72=Indag. Math. 31 1969 1--9. (Reviewer: R. C. Read)

[45] 38 #5703 Klarner, David A. Partitions of $N$ into distinct Fibonacci numbers. Fibonacci Quart. 6 1968 no. 4, 235--244. (Reviewer: M. S. Cheema)

[46] 38 #4333 Klarner, David A. The number of graded partially ordered sets. J. Combinatorial Theory 6 1969 12--19. (Reviewer: L. K. Durst)

[47] 38 #2055 Klarner, David A. The number of $k$-coloured graphs. Canad. J. Math. 20 1968 1344--1352. (Reviewer: K. Wagner)

[48] 38 #63 Klarner, David A. A combinatorial formula involving the Fredholm integral equation. J. Combinatorial Theory 5 1968 59--74. (Reviewer: N. G. de Bruijn)

[49] 36 #2612 Klarner, D. A. A ring of sequences generated by rational functions. Amer. Math. Monthly 74 1967 813--816. (Reviewer: E. F. Assmus, Jr.)

[50] 36 #1384 Klarner, David A. Representations of $N$ as a sum of distinct elements from special sequences. Fibonacci Quart. 4 1966 289--306, 322. (Reviewer: S. Lin)

[51] 35 #5339 Klarner, David A. Cell growth problems. Canad. J. Math. 19 1967 851--863. (Reviewer: F. Harary)

[52] 35 #4159 Klarner, D. A. Representation of an integer as a sum of four integer cubes and related problems. Amer. Math. Monthly 74 1967 531--537. (Reviewer: A. Schinzel)

[53] 32 #4028 Klarner, David A. Some results concerning polyominoes. Fibonacci Quart. 3 1965 9--20. (Reviewer: Andrew Adler)

[54] 1 730 168 Klarner, David A. Polyominoes. Handbook of discrete and computational geometry, 225--240, CRC Press Ser. Discrete Math. Appl., CRC, Boca Raton, FL, 1997.

Other papers not listed in MathSciNet (incomplete)

"Sequences of k powers with k power partial sums," Mathematics Magazine, Vol 37, No 3, (1964) pp 166-167.

"Determinants involving k powers from second order sequences," Fibonacci Quarterly, Vol. 4, No. 2 (1966) pp 179-184.

Sources Consulted

[A] Curriculum Vitae, David Anthony Klarner. A 7 page fax sent from the University of Nebraska at Lincoln Computer Science & Engineering Department, 24 March 1999. [Thanks to Kara Lynn Klarner for sending this].

[B] MathSciNet: The American Mathematical Society's Mathematical Reviews on the Web
[Thanks to Graham Leuschke for helping with this].