Computing permutation encodings

DOI10.1007/S001650050036MaRDI QIDQ1125690zbMATH OpenOpenAlexFDO

Authors K. Rustan, K. Rustan M. Leino

Publication date 2 January 2000

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://authors.library.caltech.edu/26789/

zbMATH Keywords

permutation encoding algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Nonnumerical algorithms (68W05)

Recommendations

• The insertion encoding of permutations
• scientific article; zbMATH DE number 3557795
• A new algorithm for generation of permutations
• Finding regular insertion encodings for permutation classes
• Compressed representations of permutations, and applications

Cited in

(11)

• On some connections between permutations and coding
• Coding for locality in reconstructing permutations
• The insertion encoding of permutations
• Sorting parity encodings by reusing variables
• An efficient algorithm for saving ordered sets in a compacted form
• Some integer formula encodings and related algorithms
• Indexing permutations for binary strings
• Fast enumeration of combinatorial objects
• Compressed representations of permutations, and applications
• String Processing and Information Retrieval
• Finding regular insertion encodings for permutation classes

This page was built for publication: Computing permutation encodings

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