{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:56Z","timestamp":1725663176958},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_95","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:00:56Z","timestamp":1330189256000},"page":"512-530","source":"Crossref","is-referenced-by-count":1,"title":["Optimal unbounded search strategies"],"prefix":"10.1007","author":[{"given":"J. C.","family":"Raoult","sequence":"first","affiliation":[]},{"given":"J.","family":"Vuillemin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"3","author":"J. L. Bentley","year":"1976","unstructured":"J.L. BENTLEY & A.C. YAO [76]: An almost optimal algorithm for unbounded searching, IPL, vol. 3, no 3 (1976) pp. 82\u201387.","journal-title":"IPL"},{"key":"42_CR2","unstructured":"N. BOURBAKI [76]: Th\u00e9orie des fonctions de variables r\u00e9elles, ch. V, app. no 8 (1976 3rd ed.), Hermann Paris."},{"key":"42_CR3","unstructured":"S. EILENBERG [74]: Automata, languages, and machines, Vol. A, Academic Press (1974)."},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P. Elias","year":"1975","unstructured":"P. ELIAS [75]: Universal codework sets and representation of the integers, IEEE Trans. on Information theory, IT-21 (1975) pp. 194\u2013203.","journal-title":"IEEE Trans. on Information theory"},{"issue":"4","key":"42_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/359460.359480","volume":"21","author":"S. Even","year":"1978","unstructured":"S. EVEN & M. RODEH [78]: Economical encoding of commas between strings, CACM, Vol. 21, no 4 (1978) pp. 315\u2013317.","journal-title":"CACM"},{"key":"42_CR6","unstructured":"L. HYAFIL [77]: Optimal search for the zero of the n t h derivative, IRIA\/LABORIA, Rapport no 247 (1977)."},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0021-9800(68)80083-3","volume":"4","author":"R. M. Karp","year":"1972","unstructured":"R.M. KARP & W.L. MIRANKER [72]: Parallel minimax search for a maximum, J. of Comb. Theory 4 (1972) pp. 19\u201335.","journal-title":"J. of Comb. Theory"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"H.P. KATSEFF [78]: Complexity dip in random infinite binary sequences, SIGACT Newsletters (Winter 1978) pp. 22\u201323.","DOI":"10.1145\/1008369.1008373"},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J. Kiefer","year":"1953","unstructured":"J. KIEFER [53]: Sequential minimax search for a maximum, Proc. Ameri. Soc. 4 (1953) pp. 502\u2013506.","journal-title":"Proc. Ameri. Soc."},{"key":"42_CR10","unstructured":"D.E. KNUTH [75]: The art of computer programming, Vol. 3, Sorting and searching, Addison-Wesley (1975)."},{"key":"42_CR11","unstructured":"D.E. KNUTH [79]: Supernatural numbers. (Dedicated to Martin Gardner)."},{"key":"42_CR12","unstructured":"A. KOLMOGOROV [68]: Three approaches for defining the concept of information quantity, Selected Translations in Math. Stat. and Prob., AMS Publication (1968)."},{"key":"42_CR13","unstructured":"H.T. KUNG [76]: Synchronized and asynchronous parallel algorithms for multi-processors, in Proc. of a Symp. on Algorithms and Complexity (1976). Edited by J.F. Traub, Academic Press, 1976, pp. 153\u2013200."},{"key":"42_CR14","unstructured":"J. LINN [73]: General methods for parallel searching, Tech. Rep. no 61, Digital Systems Lab., Stanford University (1973)."},{"key":"42_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00534110","volume":"19","author":"P. Martin-L\u00f6f","year":"1971","unstructured":"P. MARTIN-L\u00d6F [71]: Complexity oscillations in infinite binary sequences, Z. Wahrsheinlichkeitstheorie Verw. Geb. 19 (1971) pp. 225\u2013230.","journal-title":"Z. Wahrsheinlichkeitstheorie Verw. Geb."},{"key":"42_CR16","unstructured":"J.C. RAOULT, J. VUILLEMIN [79]: Optimal unbounded search strategies, Rapport LRI, no 33 (1979)."},{"key":"42_CR17","unstructured":"R.L. RIVEST, A.R. MEYER, D.J. KLEITMAN, J. SPENCER, K. WINKLMAN [78]: Coping with errors in binary search procedures, Proc. of the 10th annual ACM Symposium on Theory of Computing, San Diego (1978) pp. 227\u2013232."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_95.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:33:15Z","timestamp":1619555595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}