{"id":"https://openalex.org/W2076009323","doi":"https://doi.org/10.1016/s0022-0000(05)80002-9","title":"Finding level-ancestors in trees","display_name":"Finding level-ancestors in trees","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2076009323","doi":"https://doi.org/10.1016/s0022-0000(05)80002-9","mag":"2076009323"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(05)80002-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(05)80002-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","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/A5103285481","display_name":"Omer Berkman","orcid":"https://orcid.org/0000-0003-0503-7366"},"institutions":[{"id":"https://openalex.org/I164213776","display_name":"King's College - North Carolina","ror":"https://ror.org/022f44628","country_code":"US","type":"education","lineage":["https://openalex.org/I164213776"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Omer Berkman","raw_affiliation_strings":["Department of Computer Science, Kings College, The Strand, London WC2R 2LS, England"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kings College, The Strand, London WC2R 2LS, England","institution_ids":["https://openalex.org/I164213776"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel 69978","University of Maryland Institute for Advanced Computer Studies (UMIACS) and Department of Electrical Engineering, University of Maryland, College Park, Maryland 20742, USA"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel 69978","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"University of Maryland Institute for Advanced Computer Studies (UMIACS) and Department of Electrical Engineering, University of Maryland, College Park, Maryland 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103285481"],"corresponding_institution_ids":["https://openalex.org/I164213776"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":3.9539,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.93885763,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"48","issue":"2","first_page":"214","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","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/T11269","display_name":"Algorithms and Data Compression","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/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9925000071525574,"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/combinatorics","display_name":"Combinatorics","score":0.703341543674469},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7002238035202026},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6356514692306519},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6073352694511414},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6024922132492065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5222449898719788},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5148853063583374},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5008463859558105},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49838829040527344},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46208783984184265},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45083415508270264},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4129166603088379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3817463517189026},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25459474325180054}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.703341543674469},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7002238035202026},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6356514692306519},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6073352694511414},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6024922132492065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222449898719788},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5148853063583374},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5008463859558105},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49838829040527344},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46208783984184265},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45083415508270264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4129166603088379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3817463517189026},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25459474325180054},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0022-0000(05)80002-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(05)80002-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1586466644","https://openalex.org/W1836810876","https://openalex.org/W1971321752","https://openalex.org/W1981097305","https://openalex.org/W1981573606","https://openalex.org/W1995040285","https://openalex.org/W2011635335","https://openalex.org/W2011999472","https://openalex.org/W2034334221","https://openalex.org/W2046946959","https://openalex.org/W2048128011","https://openalex.org/W2058557216","https://openalex.org/W2059245171","https://openalex.org/W2069001533","https://openalex.org/W2087489294","https://openalex.org/W2092901467","https://openalex.org/W2143462372","https://openalex.org/W2156372444","https://openalex.org/W4213327355","https://openalex.org/W4254317381","https://openalex.org/W6634979821","https://openalex.org/W6653186725","https://openalex.org/W6662542441","https://openalex.org/W6683044779"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645","https://openalex.org/W2887154986"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
