{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:17:54Z","timestamp":1771024674827,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755197","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_18","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"187-193","source":"Crossref","is-referenced-by-count":13,"title":["Linear-Time Ranking of Permutations"],"prefix":"10.1007","author":[{"given":"Martin","family":"Mare\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Straka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Critani, F., Dall\u2019Aglio, M., Di Biase, G.: Ranking and unranking permutations with applications. In: Innovation in Mathematics. In: Proceedings of Second International Mathematica Symposium, pp. 99\u2013106 (1997)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(94)00078-R","volume":"57","author":"F. Ruskey","year":"1995","unstructured":"Ruskey, F., Jiang, M., Weston, A.: The Hamiltonicity of directed-Cayley graphs (or: A tale of backtracking). Discrete Appl. Math.\u00a057, 75\u201383 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0406012","volume":"6","author":"F. Ruskey","year":"1993","unstructured":"Ruskey, F., Savage, C.: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. SIAM Journal on Discrete Mathematics\u00a06(1), 152\u2013166 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR4","unstructured":"Slocum, J., Sonneveld, D.: The 15 Puzzle Book. The Slocum Puzzle Foundation, Beverly Hills, CA, USA (2006)"},{"issue":"4","key":"18_CR5","first-page":"227","volume":"2","author":"J. Liebehenschel","year":"1997","unstructured":"Liebehenschel, J.: Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis. Journal of Automata, Languages and Combinatorics\u00a02(4), 227\u2013268 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"18_CR6","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. Reingold","year":"1977","unstructured":"Reingold, E.: Combinatorial Algorithms: Theory and Practice. Prentice Hall College Div., Englewood Cliffs (1977)"},{"key":"18_CR7","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol.\u00a03. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA (1998)"},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"W. Myrvold","year":"2001","unstructured":"Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters\u00a079(6), 281\u2013284 (2001)","journal-title":"Information Processing Letters"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-51542-9_5","volume-title":"Algorithms and Data Structures","author":"P.F. Dietz","year":"1989","unstructured":"Dietz, P.F.: Optimal algorithms for list indexing and subset rank. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 39\u201346. Springer, Heidelberg (1989)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M. Fredman","year":"1993","unstructured":"Fredman, M., Willard, D.: Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences\u00a047(3), 424\u2013436 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M. Fredman","year":"1994","unstructured":"Fredman, M., Willard, D.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences\u00a048(3), 533\u2013551 (1994)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:22:46Z","timestamp":1619518966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_18","relation":{},"subject":[]}}