{"id":"https://openalex.org/W2141986577","doi":"https://doi.org/10.1017/s0963548309990599","title":"Tight Bounds for Blind Search on the Integers and the Reals","display_name":"Tight Bounds for Blind Search on the Integers and the Reals","publication_year":2009,"publication_date":"2009-12-18","ids":{"openalex":"https://openalex.org/W2141986577","doi":"https://doi.org/10.1017/s0963548309990599","mag":"2141986577"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548309990599","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990599","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MARTIN DIETZFELBINGER","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, 98684 Ilmenau, Germany (e-mail:","Fakult\u00e4t f\u00fcr informatik und automatisierung, technische universit\u00e4t ilmenau, 98684 ilmenau, germany (e-mail: martin.dietzfelbinger@tu-ilmenau.de)#TAB#"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik und Automatisierung, Technische Universit\u00e4t Ilmenau, 98684 Ilmenau, Germany (e-mail:","institution_ids":["https://openalex.org/I119449181"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr informatik und automatisierung, technische universit\u00e4t ilmenau, 98684 ilmenau, germany (e-mail: martin.dietzfelbinger@tu-ilmenau.de)#TAB#","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112196936","display_name":"Jonathan E. Rowe","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"JONATHAN E. ROWE","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK","School of computer science, university of birmingham, birmingham b15 2tt, uk (email: j.e.rowe@cs.bham.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of computer science, university of birmingham, birmingham b15 2tt, uk (email: j.e.rowe@cs.bham.ac.uk)#TAB#","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"INGO WEGENER","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, 44221 Dortmund, Germany","Fakult\u00e4t f\u00fcr informatik, technische universit\u00e4t dortmund, 44221 dortmund, germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr informatik, technische universit\u00e4t dortmund, 44221 dortmund, germany#TAB#","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009422307","display_name":"Philipp Woelfel","orcid":"https://orcid.org/0000-0002-7847-4631"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PHILIPP WOELFEL","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Calgary, Alberta T2N 1N4, Canada","Department of computer science, university of calgary, calgary, alberta t2n 1n4, canada (email: woelfel@cpsc.ucalgary.ca)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Calgary, Alberta T2N 1N4, Canada","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"Department of computer science, university of calgary, calgary, alberta t2n 1n4, canada (email: woelfel@cpsc.ucalgary.ca)#TAB#","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067257613"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.13920125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":"5-6","first_page":"711","last_page":"728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.8675233125686646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6767144203186035},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.6754293441772461},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6210752725601196},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.557496190071106},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5431886911392212},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.486568808555603},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4792076051235199},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.476616770029068},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4519316256046295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22702521085739136},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15406537055969238},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09492534399032593}],"concepts":[{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.8675233125686646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6767144203186035},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.6754293441772461},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6210752725601196},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.557496190071106},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5431886911392212},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.486568808555603},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4792076051235199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.476616770029068},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4519316256046295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22702521085739136},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15406537055969238},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09492534399032593},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548309990599","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990599","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.409.4335","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.4335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~jer/papers/tightbounds.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c88cbd6d-5a4b-4c8f-9c9a-fdd5e8569d39","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/c88cbd6d-5a4b-4c8f-9c9a-fdd5e8569d39","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dietzfelbinger, M, Rowe, J, Wegener, I & Woelfel, P 2010, 'Tight Bounds for Blind Search on the Integers and the Reals', Combinatorics, Probability and Computing, vol. 19, no. 5-6, pp. 711-728. https://doi.org/10.1017/S0963548309990599","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W130232500","https://openalex.org/W1557915104","https://openalex.org/W1981482533","https://openalex.org/W1992467531","https://openalex.org/W2059676477","https://openalex.org/W2121811374","https://openalex.org/W4205396088"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W2373292056"],"abstract_inverted_index":{"We":[0,101],"analyse":[1],"a":[2,8,24,43,53,163,171,190,197],"simple":[3],"random":[4,44,54],"process":[5],"in":[6,12,42,46,67,148,165],"which":[7],"token":[9,39,65,97,143,160],"is":[10,40,58,66,75,176,180],"moved":[11,76],"the":[13,38,64,91,96,106,135,156,159,169,183,187],"interval":[14],"A":[15,47],"=":[16,30],"{0,":[17],".":[18,19,32,33,48,82,128],".,":[20,34],"n":[21,35,150],"}.":[22,36],"Fix":[23],"probability":[25],"distribution":[26],"\u03bc":[27,109],"over":[28,193],"D":[29],"{1,":[31],"Initially,":[37],"placed":[41],"position":[45,68,78,99],"In":[49],"round":[50],"t":[51],",":[52,72],"step":[55,140],"size":[56],"d":[57,71,81],"chosen":[59],"according":[60],"to":[61,77],"\u03bc.":[62,120],"If":[63],"x":[69,79],"\u2265":[70],"then":[73],"it":[74,84],"\u2212":[80],"Otherwise":[83],"stays":[85],"put.":[86],"Let":[87],"T":[88,111,115],"X":[89,112,116],"be":[90],"number":[92],"of":[93,114,185,189],"rounds":[94],"until":[95,158],"reaches":[98],"0.":[100],"show":[102,124],"tight":[103],"bounds":[104,131],"for":[105,117,134],"expectation":[107],"E":[108],"(":[110],")":[113],"varying":[118],"distributions":[119],"More":[121],"precisely,":[122],"we":[123],"that":[125],"$\\min_\\mu\\{\\E_\\mu(T_X)\\}=\\Theta\\bigl((\\log":[126],"n)^2\\bigr)$":[127],"The":[129,178],"same":[130],"are":[132,145],"proved":[133],"analogous":[136],"continuous":[137,191],"process,":[138],"where":[139],"sizes":[141],"and":[142,153],"positions":[144],"real":[146],"values":[147],"[0,":[149,166,194],"+":[151],"1),":[152],"one":[154],"measures":[155],"time":[157],"has":[161],"reached":[162],"point":[164],"1).":[167],"For":[168],"proofs,":[170],"novel":[172],"potential":[173],"function":[174,192],"argument":[175],"introduced.":[177],"research":[179],"motivated":[181],"by":[182],"problem":[184],"approximating":[186],"minimum":[188],"1]":[195],"with":[196],"\u2018blind\u2019":[198],"optimization":[199],"strategy.":[200]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}