{"id":"https://openalex.org/W1624114741","doi":"https://doi.org/10.1007/978-3-642-40273-9_16","title":"In Pursuit of the Dynamic Optimality Conjecture","display_name":"In Pursuit of the Dynamic Optimality Conjecture","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1624114741","doi":"https://doi.org/10.1007/978-3-642-40273-9_16","mag":"1624114741"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40273-9_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40273-9_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5088852372","display_name":"John Iacono","orcid":"https://orcid.org/0000-0001-8885-8172"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I90965887","display_name":"SUNY Polytechnic Institute","ror":"https://ror.org/000fxgx19","country_code":"US","type":"education","lineage":["https://openalex.org/I90965887"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Iacono","raw_affiliation_strings":["Polytechnic Institute of New York University, Brooklyn, USA","Polytechnic Institute of New York University"],"affiliations":[{"raw_affiliation_string":"Polytechnic Institute of New York University, Brooklyn, USA","institution_ids":["https://openalex.org/I90965887","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Polytechnic Institute of New York University","institution_ids":["https://openalex.org/I90965887","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088852372"],"corresponding_institution_ids":["https://openalex.org/I57206974","https://openalex.org/I90965887"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0372,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8773437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"236","last_page":"250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.928105354309082},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.8218847513198853},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7007730007171631},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.6830861568450928},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6373870372772217},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.6333723664283752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.608583390712738},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5923071503639221},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5883254408836365},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5489896535873413},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5229024291038513},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4855594336986542},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4839218258857727},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.47835320234298706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4554159641265869},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4539388120174408},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43147939443588257},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.4267627000808716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36601173877716064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2825744152069092},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2281075119972229}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.928105354309082},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.8218847513198853},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7007730007171631},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.6830861568450928},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6373870372772217},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.6333723664283752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.608583390712738},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5923071503639221},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5883254408836365},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5489896535873413},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5229024291038513},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4855594336986542},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4839218258857727},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.47835320234298706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4554159641265869},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4539388120174408},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43147939443588257},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.4267627000808716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36601173877716064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2825744152069092},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2281075119972229},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-40273-9_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40273-9_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/326218","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326218","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture notes in computer science, 8066","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1493919353","https://openalex.org/W1526597670","https://openalex.org/W1529661724","https://openalex.org/W1553603221","https://openalex.org/W1587923304","https://openalex.org/W1793615280","https://openalex.org/W1972748018","https://openalex.org/W1991146548","https://openalex.org/W2016857845","https://openalex.org/W2017619076","https://openalex.org/W2041645394","https://openalex.org/W2068628972","https://openalex.org/W2078589215","https://openalex.org/W2120181493","https://openalex.org/W2130055503","https://openalex.org/W2150865801","https://openalex.org/W2154937603","https://openalex.org/W2624312598","https://openalex.org/W3137830407","https://openalex.org/W4242724277","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2364382882","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W270522628","https://openalex.org/W2146997899","https://openalex.org/W2038309235","https://openalex.org/W2061004850","https://openalex.org/W2004985727","https://openalex.org/W2004482118","https://openalex.org/W2077383771"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}