{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:04Z","timestamp":1725558904820},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201038"},{"type":"electronic","value":"9783540398165"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39816-5_3","type":"book-chapter","created":{"date-parts":[[2010,6,27]],"date-time":"2010-06-27T22:01:32Z","timestamp":1277676092000},"page":"26-38","source":"Crossref","is-referenced-by-count":5,"title":["Optimality of Randomized Algorithms for the Intersection Problem"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), January 2002, pp. 390\u2013399. ACM-SIAM, ACM (2002)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Barbay, J., Kenyon, C.: Randomized lower bound and deterministic algorithms for intersection. t-threshold and opt-threshold (May 2003) (submitted)","DOI":"10.1007\/978-3-540-24587-2_59"},{"issue":"3","key":"3_CR3","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":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., L\u00f6pez-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"},{"key":"3_CR6","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, ch. 4.2","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Nearly Optimal Binary Search Tree. In: Data Structures and Algorithms 1: Sorting and Searching, ch. 4.2, pp. 184\u2013185. Springer, Heidelberg (1984)"},{"key":"3_CR7","volume-title":"Theory of games and economic behavior","author":"J. Neumann Von","year":"1944","unstructured":"Von Neumann, J., Morgenstern, O.: Theory of games and economic behavior, 1st edn. Princeton University Press, Princeton (1944)","edition":"1"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Sion, M.: On general minimax theorems. Pacic Journal of Mathematics, 171\u2013176 (1958)","DOI":"10.2140\/pjm.1958.8.171"},{"key":"3_CR9","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","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39816-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:32:47Z","timestamp":1559208767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39816-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201038","9783540398165"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39816-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}