{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:35Z","timestamp":1725561395794},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_59","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"575-584","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Algorithm for the t-Threshold Set Problem"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Barbay, J.: Analyse fine: bornes inf\u00e9rieures et algorithmes de calculs d\u2019intersection pour moteurs de recherche. PhD thesis, Universit\u00e9 Paris-Sud, Laboratoire de Recherche en Informatique (Septembre 2002)"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"2nd Symposium on Stochastic Algorithms, Foundations and applications","author":"J. Barbay","year":"2003","unstructured":"Barbay, J.: Optimality of randomized algorithms for the intersection problem. In: 2nd Symposium on Stochastic Algorithms, Foundations and applications. LNCS, Springer, Heidelberg (2003)"},{"key":"59_CR3","first-page":"390","volume-title":"Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), ACM-SIAM","author":"J. Barbay","year":"2002","unstructured":"Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), ACM-SIAM, January 2002, pp. 390\u2013399. ACM Press, New York (2002)"},{"issue":"3","key":"59_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J.L. Bentley","year":"1976","unstructured":"Bentley, J.L., Yao, A.C.-C.: An almost optimal algorithm for unbounded searching. Information processing letters\u00a05(3), 82\u201387 (1976)","journal-title":"Information processing letters"},{"key":"59_CR5","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"C. Cool","year":"1980","unstructured":"Cool, C., Kim, D.: Best sorting algorithm for nearly sorted lists. Communication of ACM\u00a023, 620\u2013624 (1980)","journal-title":"Communication of ACM"},{"key":"59_CR6","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":"59_CR7","doi-asserted-by":"crossref","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, January 2001. LNCS, pp. 5\u20136 (2001)","DOI":"10.1007\/3-540-44808-X_7"},{"issue":"4","key":"59_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys\u00a024(4), 441\u2013476 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"59_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D.G. Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D.G., Seidel, R.: The ultimate planar convex hull algorithm? SIAM J. Comput.\u00a015(1), 287\u2013299 (1986)","journal-title":"SIAM J. Comput."},{"key":"59_CR10","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. chapter 4.2 Nearly Optimal Binary Search Tree, pp. 184\u2013185. Springer, Heidelberg (1984)"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(93)E0160-Z","volume":"59","author":"O. Petersson","year":"1995","unstructured":"Petersson, O., Moffat, A.: A framework for adaptive sorting. Discrete Applied Mathematics\u00a059, 153\u2013179 (1995)","journal-title":"Discrete Applied Mathematics"}],"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_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T04:04:29Z","timestamp":1635825869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}