{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:49Z","timestamp":1725561349304},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_4","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"16-25","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic Dictionary for Priced Information with Application"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information. Journal of Computer and System Sciences\u00a064 (2002)","DOI":"10.1006\/jcss.2002.1828"},{"key":"4_CR3","first-page":"582","volume-title":"Proc. ACM Symp. on Theory of Computation","author":"M. Charikar","year":"2000","unstructured":"Charikar, M., Fagin, R., Guruswami, V., Kleinberg, J., Raghavan, P., Sahai, A.: Query strategies for priced information (extended abstract). In: Proc. ACM Symp. on Theory of Computation, pp. 582\u2013591. ACM, New York (2000)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A.: Sorting and selection with structured costs. In: Proc. IEEE Symp. on Foundations of Comp. Sci. (2001)","DOI":"10.1109\/SFCS.2001.959916"},{"key":"4_CR5","unstructured":"Kannan, S., Khanna, S.: Selection with monotone comparison costs. In: Proc. ACMSIAM Symp. on Discrete Algorithms (2003)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Komlos, J., Ma, Y., Szemeredi, E.: Matching nuts and bolts in O(n log n) time. SIAM Journal on Discrete Mathematics 11 (1998)","DOI":"10.1137\/S0895480196304982"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:11:12Z","timestamp":1552835472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}