{"id":"https://openalex.org/W1577155814","doi":"https://doi.org/10.1007/3-540-57785-8_165","title":"A simple optimal parallel algorithm for reporting paths in a tree","display_name":"A simple optimal parallel algorithm for reporting paths in a tree","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1577155814","doi":"https://doi.org/10.1007/3-540-57785-8_165","mag":"1577155814"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57785-8_165","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_165","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/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["Tata Institute of Fundamental Research, Computer Systems and Communications Group, Homi Bhabha Road, 400 005, Bombay, India","Computer Systems and Communications Group"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Computer Systems and Communications Group, Homi Bhabha Road, 400 005, Bombay, India","institution_ids":["https://openalex.org/I11947397"]},{"raw_affiliation_string":"Computer Systems and Communications Group","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, Lund, Sweden","Lund Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103136561"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2971,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77547853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"487","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},{"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/binary-logarithm","display_name":"Binary logarithm","score":0.7788412570953369},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7289051413536072},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7144315242767334},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6407098174095154},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6288967132568359},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6071289777755737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.584500253200531},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5640299916267395},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5287225842475891},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5285312533378601},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5058736205101013},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46835413575172424},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.4238487780094147},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42011162638664246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.244145929813385},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06799066066741943}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7788412570953369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7289051413536072},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7144315242767334},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6407098174095154},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6288967132568359},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6071289777755737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.584500253200531},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5640299916267395},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5287225842475891},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5285312533378601},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5058736205101013},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46835413575172424},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.4238487780094147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42011162638664246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.244145929813385},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06799066066741943},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-57785-8_165","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57785-8_165","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:CiteSeerX.psu:10.1.1.31.5395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.lth.se/Research/Algorithms/Papers/andrzej2.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1568336836","https://openalex.org/W1584086289","https://openalex.org/W1876661458","https://openalex.org/W1978583881","https://openalex.org/W1995040285","https://openalex.org/W2006795057","https://openalex.org/W2034282023","https://openalex.org/W2038699153","https://openalex.org/W2043380199","https://openalex.org/W2046946959","https://openalex.org/W2072915958","https://openalex.org/W2120490947","https://openalex.org/W2143462372"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2099271296","https://openalex.org/W2055625272","https://openalex.org/W1838063489","https://openalex.org/W2036758175","https://openalex.org/W1968512104"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}