Minimum-complexity pairing functions
type: Item
instance of: scholarly article
title: Minimum-complexity pairing functions
zbMATH Open document ID: 0769.68049
DOI: 10.1016/0022-0000(92)90027-G
author: Kenneth W. Regan
published in: Journal of Computer and System Sciences
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 98617
zbMATH Keywords: linear-time computability
zbMATH Keywords: on-line computation
zbMATH Keywords: pairing function
zbMATH Keywords: constant space
zbMATH Keywords: log space
MaRDI profile type: Publication
cites work: Q4052072
cites work: Q3893911
cites work: Q3954784
cites work: Q5636862
cites work: Some Results on Tape-Bounded Turing Machines
cites work: Q3862379
cites work: Q3915990
cites work: Q4153600
cites work: Q3762301
cites work: Q5573961
cites work: Q3325707
cites work: Real-Time Definable Languages
cites work: On storing concatenable arrays
cites work: Storage schemes for boundedly extendible arrays
cites work: Fast multiplication of large numbers
full work available at URL: 0022-0000(92)90027-g
OpenAlex ID: W2011541295
description: scientific article; zbMATH DE number 98617