{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:54:56Z","timestamp":1773330896843,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424239","type":"print"},{"value":"9783540446347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_39","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"426-437","source":"Crossref","is-referenced-by-count":56,"title":["Succinct Dynamic Data Structures"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"39_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-48447-7_4","volume-title":"Proceedings of Workshop on Algorithms and Data Structures","author":"A. Brodnik","year":"1999","unstructured":"A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro and R. Sedgewick, \u201cResizable Arrays in Optimal Time and Space\u201d, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 37\u201348 (1999)."},{"issue":"5","key":"39_CR2","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"A. Brodnik and J. I. Munro, \u201cMembership in Constant Time and Almost Minimum Space\u201d, SIAM Journal on Computing, 28(5), 1628\u20131640 (1999).","journal-title":"SIAM Journal on Computing"},{"key":"39_CR3","unstructured":"D. R. Clark, \u201cCompact Pat Trees\u201d, Ph.D. Thesis, University of Waterloo, 1996."},{"key":"39_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-51542-9_5","volume-title":"Proceedings of Workshop on Algorithms and Data Structures","author":"P. F. Dietz","year":"1989","unstructured":"Paul F. Dietz, \u201cOptimal Algorithms for List Indexing and Subset Rank\u201d, Proceedings of Workshop on Algorithms and Data Structures, LNCS 382, 39\u201346 (1989)."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"M. L. Fredman and M. Saks, \u201cThe Cell Probe Complexity of Dynamic Data Structures\u201d, Proceedings of the 21\n                           st\n                           tACM Symposium on Theory of Computing, 345\u2013354(1989).","DOI":"10.1145\/73007.73040"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M. L. Fredman","year":"1994","unstructured":"M. L. Fredman and D. E. Willard, \u201cTrans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths\u201d, Journal of Computer Systems Science, 48, 533\u2013551 (1994).","journal-title":"Journal of Computer Systems Science"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G. N. Fredrickson","year":"1983","unstructured":"G. N. Fredrickson, \u201cImplicit Data Structures for the Dictionary Problem\u201d, Journal of Association of the Computing Machinery, 30, 80\u201394 (1983).","journal-title":"Journal of Association of the Computing Machinery"},{"key":"39_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-48447-7_21","volume-title":"Proceedings of Workshop on Algorithms and Data Structures","author":"M. T. Goodrich","year":"1999","unstructured":"M. T. Goodrich and J. G. Kloss II, \u201cTiered Vectors: Efficient Dynamic Array for JDSL\u201d, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 205\u2013216 (1999)."},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"R. Grossi and J. S. Vitter, \u201cCompressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching\u201d, Proceedings of Symposium on Theory of Computing, 397\u2013406 (2000).","DOI":"10.1145\/335305.335351"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"G. Jacobson, \u201cSpace Efficient Static Trees and Graphs\u201d, Proceedings of the IEEE Symposium on Foundations of Computer Science, 549\u2013554 (1989).","DOI":"10.1109\/SFCS.1989.63533"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"J. I. Munro and V. Raman, \u201cSuccinct representation of balanced parentheses, static trees and planar graphs\u201d, Proceedings of the IEEE Symposium on Foundations of Computer Science (1997) 118\u2013126.","DOI":"10.1109\/SFCS.1997.646100"},{"key":"39_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-49382-2_17","volume-title":"Proceedings of the conference on Foundations of Software Technology and Theoretical Computer Science","author":"J. I. Munro","year":"1998","unstructured":"J. I. Munro, V. Raman and S. S. Rao, \u201cSpace Efficient Suffix trees\u201d, Proceedings of the conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, 186\u2013196 (1998)."},{"key":"39_CR13","unstructured":"J. I. Munro, V. Raman and A. Storm, \u201cRepresenting Dynamic Binary Trees Succinctly\u201d, Proceedings of Symposium on Discrete Algorithms, 529\u2013536 (2001)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:01:32Z","timestamp":1550732492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}