EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE

DOI10.1142/S012905410300156XzbMath1099.68634MaRDI QIDQ5696889

Arnold L. Rosenberg

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

pairing functionaccountability in web computingstoring extendible arrays/tables

Mathematics Subject Classification ID

Related Items (2)

Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ A Groupoid of Isomorphic Data Transformations

Cites Work

• Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials
• Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials
• Allocating Storage for Extendible Arrays
• Managing Storage for Extendible Arrays
• Hashing Schemes for Extendible Arrays
• Unnamed Item
• Unnamed Item

This page was built for publication: EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE