{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:04:29Z","timestamp":1768899869414,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_29","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"345-356","source":"Crossref","is-referenced-by-count":37,"title":["Succinct Representations of Permutations"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satti Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"29_CR1","unstructured":"D. A. Bader, M. Yan, B. M. W. Moret. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. University of New Mexico Technical Report HPCERC2001-005 (August 2001): http:\/\/www.hpcerc.unm.edu\/Research\/tr\/HPCERC2001-005.pdf"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A. Z. Broder","year":"2000","unstructured":"A. Z. Broder, M. Charikar, A. M. Frieze and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer System Sciences, 60 630\u2013659 (2000).","journal-title":"Journal of Computer System Sciences"},{"key":"29_CR3","unstructured":"E. D. Demaine and A. L\u00f3pez-Ortiz. A linear lower bound on index size for text retrieval. Journal of Algorithms, to appear."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0022-0000(91)90022-W","volume":"43","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, J. I. Munro, M. Naor, A. A. Sch\u00e4ffer, J.P. Schmidt and A. Siegel. An implicit data structure for searching a multikey table in logarithmic time. Journal of Computer and System Sciences, 43 406\u2013424 (1991).","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the ACM Symposium on Theory of Computing, 397\u2013406, 2000.","DOI":"10.1145\/335305.335351"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the Annual Symposium on Foundations of Computer Science, 549\u2013554, 1989.","DOI":"10.1109\/SFCS.1989.63533"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01375471","volume":"11","author":"D. E. Knuth","year":"1991","unstructured":"D. E. Knuth. Efficient representation of perm groups. Combinatorica 11 33\u201343 (1991).","journal-title":"Combinatorica"},{"key":"29_CR8","unstructured":"D. E. Knuth. The Art of Computer Programming, vol. 1: Fundamental Algorithms. Computer Science and Information Processing. Addison-Wesley, 1973."},{"key":"29_CR9","unstructured":"D. E. Knuth. The Art of Computer Programming, vol. 3:Sorting and Searching. Computer Science and Information Processing. Addison-Wesley, 1973."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Computer Science and Information Processing. Morgan Kauffman, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"29_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/3-540-56503-5_65","volume-title":"Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science","author":"P. B. Miltersen","year":"1993","unstructured":"P. B. Miltersen. The bit probe complexity measure revisited. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science, LNCS 665 662\u2013671, Springer-Verlag, 1993."},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J. I. Munro","year":"2002","unstructured":"J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3) 762\u2013776 (2002).","journal-title":"SIAM Journal on Computing"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"#R3","DOI":"10.37236\/1620","volume":"9","author":"N. Pouyanne","year":"2002","unstructured":"N. Pouyanne. On the number of permutations admitting an m-th root. The Electronic Journal of Combinatorics, 9 (2002), #R3.","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/S0097539700369909","volume":"31","author":"R. Pagh","year":"2001","unstructured":"R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2) 353\u2013363 (2001).","journal-title":"SIAM Journal on Computing"},{"key":"29_CR15","unstructured":"R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 233\u2013242, 2002."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T10:28:47Z","timestamp":1683973727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}