{"id":"https://openalex.org/W1571068804","doi":"https://doi.org/10.1007/3-540-07407-4_4","title":"Best possible bounds on the weighted path length of optimum binary search trees","display_name":"Best possible bounds on the weighted path length of optimum binary search trees","publication_year":1975,"publication_date":"1975-01-01","ids":{"openalex":"https://openalex.org/W1571068804","doi":"https://doi.org/10.1007/3-540-07407-4_4","mag":"1571068804"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-07407-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-07407-4_4","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/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Kurt Mehlhorn","raw_affiliation_strings":["Fachbereich 1o Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, D 66, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich 1o Angewandte Mathematik und Informatik, Universit\u00e4t des Saarlandes, D 66, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010961023"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4545,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55693069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9818000197410583,"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/path","display_name":"Path (computing)","score":0.5728011727333069},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5460018515586853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.535648763179779},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47196662425994873},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44934993982315063},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.43992123007774353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3800410032272339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35667771100997925},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3201764225959778},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1583395004272461}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5728011727333069},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5460018515586853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.535648763179779},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47196662425994873},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44934993982315063},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.43992123007774353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3800410032272339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35667771100997925},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3201764225959778},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1583395004272461},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-07407-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-07407-4_4","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:edoc.mpg.de:344678","is_oa":false,"landing_page_url":"http://edoc.mpg.de/344678","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Automata Theory and Formal Languages, 2nd GI Conference, Springer, 31-41 (1975)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1332288","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-AFD8-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"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","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1571068804","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/automata/automata1975.html#Mehlhorn75","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"mag:1593762879","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4099999964237213,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2005247984","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2092885083"],"related_works":["https://openalex.org/W1577191794","https://openalex.org/W2017355568","https://openalex.org/W2811271262","https://openalex.org/W1533847733","https://openalex.org/W2013021781","https://openalex.org/W1735088419","https://openalex.org/W2077623653","https://openalex.org/W122288055","https://openalex.org/W264197046","https://openalex.org/W2024535490","https://openalex.org/W2086815838","https://openalex.org/W1986816810","https://openalex.org/W1539838225","https://openalex.org/W2004158059","https://openalex.org/W2135212710","https://openalex.org/W2140003446","https://openalex.org/W2010959587","https://openalex.org/W2123024824","https://openalex.org/W2075365229","https://openalex.org/W1988325634"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}