{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T15:02:26Z","timestamp":1694617346146},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1999,9]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>A permutation can be encoded in several different ways. This paper discusses some relations among some encodings and how one can be computed from others. The paper shows a short proof of an existing efficient algorithm for encoding a permutation and presents two new efficient algorithms. One of the new algorithms is constructed as the inverse of an existing algorithm for decoding, making it the first efficient permutation encoding algorithm obtained in that way.<\/jats:p>","DOI":"10.1007\/s001650050036","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T07:30:30Z","timestamp":1030260630000},"page":"56-74","source":"Crossref","is-referenced-by-count":0,"title":["Computing Permutation Encodings"],"prefix":"10.1145","volume":"11","author":[{"given":"K. Rustan M.","family":"Leino","sequence":"first","affiliation":[{"name":"Department of Computer Science, California Institute of Technology, Pasadena, CA, USA, US"}]}],"member":"320","reference":[{"key":"p_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(90)90042-C","volume":"15","author":"Chen W.","year":"1990","journal-title":"Science of Computer Programming"},{"key":"p_2","first-page":"351","volume-title":": Program inversion. EWD 671","author":"Dijkstra E. W.","year":"1978"},{"key":"p_3","volume-title":"Texts and Monographs in Computer Science","author":"Gries D.","year":"1981"},{"key":"p_4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8596-5","volume-title":": A Practical Theory of Programming. Texts and Monographs in Computer Science","author":"Hehner E. C. R.","year":"1993"},{"key":"p_5","volume-title":"Sorting and searching, section 5.1.1","author":"Knuth D. E.","year":"1973"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001650050036.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001650050036\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s001650050036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:27:04Z","timestamp":1641482824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s001650050036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["10.1007\/s001650050036"],"URL":"https:\/\/doi.org\/10.1007\/s001650050036","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}