Published May 27, 1994
| Submitted
Technical Report
Open
Computing Permutation Encodings
- Creators
- Leino, K. Rustan M.
Chicago
An error occurred while generating the citation.
Abstract
We consider some encodings of permutations of the first N natural numbers, discuss some relations among them and how one can be computed from others. We show a short proof of an existing efficient algorithm for one encoding, and present two new efficient algorithms for encoding permutations. One of these algorithms is constructed as the inverse of an existing algorithm for decoding, making it the first efficient permutation encoding algorithm obtained that way.
Additional Information
© 1994 California Institute of Technology. 27 May 1994. Supported in part by a research grant from the Digital Equipment Corporation Systems Research Center.Attached Files
Submitted - postscript.pdf
Files
postscript.pdf
Files
(181.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2f97eb0fb51839d4c19320c99445b406
|
181.3 kB | Preview Download |
Additional details
- Eprint ID
- 26789
- Resolver ID
- CaltechCSTR:1994.cs-tr-94-10
- Digital Equipment Corporation
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports