24742 Martin Aigner/Günter Ziegler: Brillanten für das Buch der Beweise.
Internet 2003, 7p.

24668 Patrick Cegielski/Denis Richard: Decidability of the theory of the natural
integers with the Cantor pairing function and the successor.
Theor. Comp. Sci. 257 (2001), 51-77.

R. Fueter/G. Polya: Rationale Abzählung der Gitterpunkte.
Vjschr. Naturf. Ges. Zürich 58 (1923), 380-386.

24658 David Haraburda: Arithmetic computations and memory management
using a binary tree encoding of natural numbers.
M. Sci. thesis Univ. North Texas 2011, 85p.

24663 Richard Kaye: Review of the book "Logical number theory I" by
Craig Smorynski. Modern Logic 8/1-2 (2000), 154-158.

24678 John Lew/Arnold Rosenberg: Polynomial indexing of integer lattices I-II.
J. Number Th. 10 (1978), 192-214, 215-243.

24662 Meri Lisi: Some remarks on the Cantor pairing function.
Le Matematiche 62/1 (2007), 55-65.

24679 E. Otoo/T. Merrett: A storage scheme for extendible arrays.
Computing 31 (1983), 1-9.

25800 Steven Pigeon: Contributions a' la compression de donnees.
PhD thesis Univ. Montreal 2001, 320p.

24660 Boris Putievskiy: Transformations, integer sequences and pairing functions.
Internet 2012, 13p.

25801 Kenneth Regan: Minimum-complexity pairing functions.
J. Comp. Syst. Sci. 45 (1992), 285-295.

Arnold Rosenberg: Allocating storage for extendible arrays. J. ACM 21 (1974), 652-670.

Arnold Rosenberg: Managing storage for extendible arrays.
SIAM J. Computing 4 (1975), 287-306.

24680 Arnold Rosenberg: On storing ragged arrays by hashing.
Math. Systems Th. 10 (1977), 193-210.

Arnold Rosenberg: Accountable Web-computing. ... (2002), ...

24671 Arnold Rosenberg: Efficient pairing functions - and why you should care.
Int. J. Found. Comp. Sci. 14 (2003), 3-17.

24667 Arnold Rosenberg: The pillars of computation theory.
Springer 2010, 330p. Eur 65 (Ebook).

Craig Smorynski: Logical number theory. Springer 1991, 410p.

24659 Matthew Szudzik: An elegant pairing function. Internet 2006, 12p.

24673 Paul Tarau: Declarative combinatorics - boolean functions, circuit synthesis
and BDDs in Haskell. Internet 2008, 10p.

24732 Paul Tarau: A groupoid of isomorphic data transformations.
Internet ca. 2008, 16p.

24672 Paul Tarau: Pairing functions, boolean evaluation and binary decision
diagrams in Prolog. Internet 2009, 15p.

24675 Paul Tarau: Bijective term encodings. Internet 2011, 14p.

24674 Paul Tarau: Two mechanisms for generating infinite families of
pairing bijections. Internet 2013, 18p.

25803 Paul Tarau: On two infinite families of pairing bijections. Internet 2013, 7p.

25802 Paul Tarau: Deriving a fast inverse of the generalized Cantor N-tupling bijection.
Internet ca. 2014, 15p.

24657 Wikipedia: Cantorsche Paarungsfunktion. Wikipedia 2014, 7p.

1137 A. Yasuhara: Recursive function theory and logic. Academic Press 1971.