{"id":"https://openalex.org/W1590821367","doi":"https://doi.org/10.1007/978-3-540-70575-8_38","title":"An Approximation Algorithm for Binary Searching in Trees","display_name":"An Approximation Algorithm for Binary Searching in Trees","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1590821367","doi":"https://doi.org/10.1007/978-3-540-70575-8_38","mag":"1590821367"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-70575-8_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70575-8_38","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":"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":"https://openalex.org/A5073527139","display_name":"Eduardo Sany Laber","orcid":"https://orcid.org/0000-0002-9025-8333"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Laber","raw_affiliation_strings":["Informatics Department of PUC-Rio, Brazil, Rua Marqu\u00eas de S\u00e3o Vicente 225, RDC, 4o andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatics Department of PUC-Rio, Brazil, Rua Marqu\u00eas de S\u00e3o Vicente 225, RDC, 4o andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil","institution_ids":["https://openalex.org/I2699952"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091196390","display_name":"Marco Molinaro","orcid":"https://orcid.org/0000-0003-0174-3204"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marco Molinaro","raw_affiliation_strings":["Informatics Department of PUC-Rio, Brazil, Rua Marqu\u00eas de S\u00e3o Vicente 225, RDC, 4o andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatics Department of PUC-Rio, Brazil, Rua Marqu\u00eas de S\u00e3o Vicente 225, RDC, 4o andar, CEP 22453-900, Rio de Janeiro - RJ, Brazil","institution_ids":["https://openalex.org/I2699952"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2699952"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2587,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78359672,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"459","last_page":"471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7527761459350586},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6780811548233032},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6534258723258972},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6342090964317322},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5909205079078674},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5897842049598694},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5788443684577942},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.5762092471122742},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5161350965499878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46629422903060913},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.4521990418434143},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44042977690696716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4339154064655304},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4184669256210327},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3816394507884979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21278920769691467},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.20620104670524597},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1930115520954132},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1554919183254242}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7527761459350586},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6780811548233032},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6534258723258972},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6342090964317322},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5909205079078674},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5897842049598694},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5788443684577942},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.5762092471122742},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5161350965499878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46629422903060913},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.4521990418434143},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44042977690696716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4339154064655304},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4184669256210327},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3816394507884979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21278920769691467},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.20620104670524597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1930115520954132},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1554919183254242},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-70575-8_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70575-8_38","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1490514342","https://openalex.org/W1520451935","https://openalex.org/W1843157236","https://openalex.org/W1966723613","https://openalex.org/W1983477045","https://openalex.org/W1991217335","https://openalex.org/W1995104647","https://openalex.org/W2000843489","https://openalex.org/W2008789644","https://openalex.org/W2014544956","https://openalex.org/W2022352965","https://openalex.org/W2025583426","https://openalex.org/W2062785505","https://openalex.org/W2066209652","https://openalex.org/W2078591209","https://openalex.org/W2088407423","https://openalex.org/W2092404484","https://openalex.org/W2126590220","https://openalex.org/W2142901448","https://openalex.org/W2151960262","https://openalex.org/W2154838933","https://openalex.org/W2157642372","https://openalex.org/W2178078103","https://openalex.org/W2326587081","https://openalex.org/W2397480364","https://openalex.org/W2697349394","https://openalex.org/W2752853835","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2539085113","https://openalex.org/W2384179084","https://openalex.org/W1978536651","https://openalex.org/W2092988444","https://openalex.org/W2914983903","https://openalex.org/W1499707946","https://openalex.org/W2146997899","https://openalex.org/W2363556447","https://openalex.org/W2107129281","https://openalex.org/W2512537634"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}