{"id":"https://openalex.org/W7092942752","doi":"https://doi.org/10.1109/isit63088.2025.11195583","title":"Enhancing Binary Search via Overlapping Partitions","display_name":"Enhancing Binary Search via Overlapping Partitions","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092942752","doi":"https://doi.org/10.1109/isit63088.2025.11195583"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Kaan Buyukkalayci","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaan Buyukkalayci","raw_affiliation_strings":["University of California,Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Merve Karakas","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Merve Karakas","raw_affiliation_strings":["University of California,Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Xinlin Li","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xinlin Li","raw_affiliation_strings":["University of California,Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":null,"display_name":"Christina Fragouli","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christina Fragouli","raw_affiliation_strings":["University of California,Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.2915000021457672,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.2915000021457672,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.15230000019073486,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.05810000002384186,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6480000019073486},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5914000272750854},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5910999774932861},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5874999761581421},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.5602999925613403},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5324000120162964},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5318999886512756},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5285999774932861},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.45410001277923584},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.39469999074935913}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6480000019073486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6335999965667725},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5914000272750854},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5910999774932861},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5874999761581421},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.5602999925613403},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5324000120162964},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5318999886512756},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5285999774932861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.489300012588501},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4496000111103058},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.39469999074935913},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.33959999680519104},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3384000062942505},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.3221000134944916},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.31839999556541443},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31369999051094055},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2669000029563904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26420000195503235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2558000087738037},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2465974559","display_name":null,"funder_award_id":"W911NF-17-20196","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"},{"id":"https://openalex.org/G6013220325","display_name":"CIF: Small: Group Testing for Epidemics Control","funder_award_id":"2146828","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1965313644","https://openalex.org/W1967005434","https://openalex.org/W1975013860","https://openalex.org/W1976172966","https://openalex.org/W2037342645","https://openalex.org/W2040877654","https://openalex.org/W2052165970","https://openalex.org/W2070164574","https://openalex.org/W2092718229","https://openalex.org/W2103604181","https://openalex.org/W2142425726","https://openalex.org/W2151260466","https://openalex.org/W2195832715","https://openalex.org/W2473645431","https://openalex.org/W3128489471","https://openalex.org/W3199828336","https://openalex.org/W4251391716","https://openalex.org/W7092942752"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,14,21,25,39,71,104,114,117,127,134,138,157,166,171,188],"task":[4],"of":[5,16,23,29,41,116,129,170],"performing":[6],"binary":[7,30,50,92],"search":[8,31,51,77,93,105,141,181],"under":[9],"noisy":[10,49,180],"decisions,":[11],"focusing":[12],"on":[13,48],"application":[15],"target":[17],"area":[18,130],"localization.":[19],"In":[20],"presence":[22],"noise,":[24],"classical":[26],"partitioning":[27,191],"approach":[28,151],"is":[32],"prone":[33],"to":[34,38,61,69,107,178],"error":[35,74,145],"propagation":[36],"due":[37],"use":[40],"strictly":[42],"disjoint":[43],"splits.":[44],"While":[45],"existing":[46,179],"works":[47],"propose":[52,90],"techniques":[53],"such":[54],"as":[55],"query":[56],"repetition":[57],"or":[58],"probabilistic":[59],"updates":[60],"mitigate":[62],"errors,":[63],"they":[64],"often":[65],"lack":[66],"explicit":[67],"mechanisms":[68],"manage":[70],"trade-off":[72,139],"between":[73,140,159,190],"probability":[75],"and":[76,123,144,161,168,183,193],"complexity,":[78],"with":[79,95],"some":[80],"providing":[81,174],"only":[82],"asymptotic":[83],"guarantees.":[84],"To":[85],"address":[86],"this":[87,150],"gap,":[88],"we":[89],"a":[91,175],"framework":[94],"tunable":[96],"overlapping":[97],"partitions,":[98],"which":[99],"introduces":[100],"controlled":[101],"redundancy":[102],"into":[103,187],"process":[106],"enhance":[108],"robustness":[109],"against":[110],"noise.":[111],"We":[112],"analyze":[113],"performance":[115],"proposed":[118,172],"algorithm":[119],"in":[120],"both":[121],"discrete":[122],"continuous":[124],"domains":[125],"for":[126,153],"problem":[128],"localization,":[131],"quantifying":[132],"how":[133],"overlap":[135],"parameter":[136],"impacts":[137],"tree":[142],"depth":[143],"probability.":[146],"Unlike":[147],"previous":[148],"methods,":[149],"allows":[152],"direct":[154],"control":[155],"over":[156],"balance":[158],"reliability":[160],"efficiency.":[162],"Our":[163],"results":[164],"emphasize":[165],"versatility":[167],"effectiveness":[169],"method,":[173],"principled":[176],"extension":[177],"paradigms":[182],"enabling":[184],"new":[185],"insights":[186],"interplay":[189],"strategies":[192],"measurement":[194],"reliability.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-21T00:00:00"}