{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:23Z","timestamp":1725544043237},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_4","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"24-35","source":"Crossref","is-referenced-by-count":11,"title":["Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Golynski","sequence":"additional","affiliation":[]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-27801-6_30","volume-title":"Combinatorial Pattern Matching","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.: A Fast Set Intersection Algorithm for Sorted Sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 400\u2013408. Springer, Heidelberg (2004)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-39816-5_3","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"J. Barbay","year":"2003","unstructured":"Barbay, J.: Optimality of randomized algorithms for the intersection problem. In: Albrecht, A.A., Steinh\u00f6fel, K. (eds.) SAGA 2003. LNCS, vol.\u00a02827, pp. 26\u201338. Springer, Heidelberg (2003)"},{"key":"4_CR3","unstructured":"Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 390\u2013399 (2002)"},{"key":"4_CR4","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proceedings of the 7th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA, pp. 383\u2013391 (1996)"},{"key":"4_CR5","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743\u2013752 (2000)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","first-page":"5","volume-title":"Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments","author":"E.D. Demaine","year":"2001","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Experiments on adaptive set intersections for text retrieval systems. In: Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Washington, DC. LNCS, pp. 5\u20136. Springer, Heidelberg (2001)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 184\u2013196 (2005)","DOI":"10.1109\/SFCS.2005.69"},{"key":"4_CR8","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 1\u201310 (2004)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete algorithm (SODA), pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"4_CR11","volume-title":"Theory of games and economic behavior","author":"J.V. Neumann","year":"1944","unstructured":"Neumann, J.V., Morgenstern, O.: Theory of games and economic behavior, 1st edn. Princeton University Press, Princeton (1944)","edition":"1"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Sion, M.: On general minimax theorems. Pacific Journal of Mathematics, 171\u2013176 (1958)","DOI":"10.2140\/pjm.1958.8.171"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space \u0398(N). Information Processing Letters\u00a017(2), 81\u201384 (1983)","journal-title":"Information Processing Letters"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: Toward a unified measure of complexity. In: Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:22Z","timestamp":1619507782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780441_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}