Deriving a fast inverse of the generalized Cantor n-tupling bijection

DOI10.4230/LIPICS.ICLP.2012.312MaRDI QIDQ5398069zbMATH OpenOpenAlexFDO

Authors Paul Tarau

Publication date 25 February 2014

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2012/3632/pdf/30.pdf

zbMATH Keywords

bijective data type transformationscombinatorial number systemgeneralized Cantor \(n\)-tupling bijectionsolving combinatorial problems in Prolog

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Recommendations

• Compact serialization of Prolog terms (with Catalan skeletons, Cantor tupling and Gödel numberings)
• scientific article; zbMATH DE number 5292707
• Canonical codings of \(\mathbb{N}{}^ k\)
• Program inversion: More than fun!
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE

Cited in

(2)

• Canonical codings of \(\mathbb{N}{}^ k\)
• Compact serialization of Prolog terms (with Catalan skeletons, Cantor tupling and Gödel numberings)

This page was built for publication: Deriving a fast inverse of the generalized Cantor \(n\)-tupling bijection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398069)