Leino, K. Rustan M. (1994) Computing Permutation Encodings. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-10
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Submitted Version
See Usage Policy. 181kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-10
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.
| Item Type: | Report or Paper (Technical Report) | ||||
|---|---|---|---|---|---|
| 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. | ||||
| Group: | Computer Science Technical Reports | ||||
| Funders: |
| ||||
| Series Name: | Computer Science Technical Reports | ||||
| DOI: | 10.7907/Z90863BZ | ||||
| Record Number: | CaltechCSTR:1994.cs-tr-94-10 | ||||
| Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-10 | ||||
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. | ||||
| ID Code: | 26789 | ||||
| Collection: | CaltechCSTR | ||||
| Deposited By: | Imported from CaltechCSTR | ||||
| Deposited On: | 25 Apr 2001 | ||||
| Last Modified: | 03 Oct 2019 03:18 |
Repository Staff Only: item control page
