6 citations · 14 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
Binary Proportional Pairing Functions
Matthew P. Szudzik
A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or…
cs.DM2017★ 6 cited
The Rosenberg-Strong Pairing Function
Matthew P. Szudzik
This article surveys the known results (and not very well-known results) associated with Cantor's pairing function and the Rosenberg-Strong pairing function, including their invers…