Efficient Pairing Functions - And Why You Should Care

Authors:
Arnold L. Rosenberg
Affiliations:
-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 2
Cited 2

Allocating Storage for Extendible Arrays

Journal of the ACM (JACM)
Accountable Web-Computing

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Accountable Web-Computing

IEEE Transactions on Parallel and Distributed Systems
Binary trees as a computational framework

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a short tour through the world of pairing functions--bijections between N 脳 N and N--as models for computational "situations." After a short discussion of the computationally simplest pairing functions-- the Cauchy-Cantor "diagonal" polynomials--we describe two specific computational situations in some detail: the use of pairing functions as storage mappings for rectangular arrays/tables that can expand and shrink dynamically; the use of pairing functions as the basis for a mechanism for instilling accountability into Web-computing projects.