{"id":"https://openalex.org/W2092901467","doi":"https://doi.org/10.1137/0222017","title":"Recursive Star-Tree Parallel Data Structure","display_name":"Recursive Star-Tree Parallel Data Structure","publication_year":1993,"publication_date":"1993-04-01","ids":{"openalex":"https://openalex.org/W2092901467","doi":"https://doi.org/10.1137/0222017","mag":"2092901467"},"language":"en","primary_location":{"id":"doi:10.1137/0222017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Omer Berkman","raw_affiliation_strings":["King's College London, London, UK"],"affiliations":[{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"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/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]},{"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"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["Univ. of Maryland, College Park and Tel Aviv Univ., Tel Aviv, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Univ. of Maryland, College Park and Tel Aviv Univ., Tel Aviv, Israel#TAB#","institution_ids":["https://openalex.org/I16391192","https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103285481"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":12.8258,"has_fulltext":false,"cited_by_count":189,"citation_normalized_percentile":{"value":0.98831219,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"22","issue":"2","first_page":"221","last_page":"242"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.9376052021980286},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7871991395950317},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6336644291877747},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.5983190536499023},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5545133352279663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428379774093628},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5417062044143677},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5310174822807312},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5166435837745667},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5095691680908203},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4767763912677765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46767839789390564},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44197922945022583},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.42781662940979004},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4207344055175781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4109991192817688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37077903747558594}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.9376052021980286},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7871991395950317},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6336644291877747},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5983190536499023},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5545133352279663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428379774093628},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5417062044143677},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5310174822807312},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5166435837745667},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5095691680908203},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4767763912677765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46767839789390564},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44197922945022583},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.42781662940979004},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4207344055175781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4109991192817688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37077903747558594},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0222017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"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/W1585069742","https://openalex.org/W1586466644","https://openalex.org/W1967575173","https://openalex.org/W1968477205","https://openalex.org/W1981796679","https://openalex.org/W1986022261","https://openalex.org/W1988727224","https://openalex.org/W1991454799","https://openalex.org/W1995040285","https://openalex.org/W2003200876","https://openalex.org/W2011999472","https://openalex.org/W2019176509","https://openalex.org/W2027679733","https://openalex.org/W2034334221","https://openalex.org/W2035582095","https://openalex.org/W2045347717","https://openalex.org/W2046946959","https://openalex.org/W2052899946","https://openalex.org/W2058557216","https://openalex.org/W2059245171","https://openalex.org/W2061303458","https://openalex.org/W2065890574","https://openalex.org/W2067661972","https://openalex.org/W2069489095","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2137236909","https://openalex.org/W2143462372","https://openalex.org/W4213327355"],"related_works":["https://openalex.org/W1973821254","https://openalex.org/W2095450548","https://openalex.org/W2553341645","https://openalex.org/W4237768433","https://openalex.org/W2286072184","https://openalex.org/W2349129821","https://openalex.org/W2364284914","https://openalex.org/W1513184872","https://openalex.org/W2003911591","https://openalex.org/W2352354297"],"abstract_inverted_index":{"This":[0,86],"paper":[1],"introduces":[2],"a":[3,19,31,79,180,200],"novel":[4],"parallel":[5,84,92,119,146,202],"data":[6,75],"structure":[7,76],"called":[8],"the":[9,22,48,63,66,102,105,115,138,143,151,168,188,192],"recursive":[10,71],"star-tree":[11],"(denoted":[12],"\u201c${}^":[13],"*":[14,24,34,55,73],"$-tree\u201d).":[15],"For":[16],"its":[17],"definition":[18],"generalization":[20],"of":[21,51,65,104,112,135,145,158,167],"$":[23,25,46],"functional":[26],"is":[27,47,101,148,184],"used":[28],"(where":[29,98],"for":[30,83,89,191],"function":[32],"$f":[33],"f(n)":[35],"=":[36],"\\min":[37],"\\{":[38],"{i|f^{(i)}":[39],"(n)":[40],"\\leqslant":[41],"1}":[42],"\\}$":[43],"and":[44,130,199],"$f^{(i)}":[45],"ith":[49],"iterate":[50],"f).":[52],"Recursive":[53],"${}^":[54,72],"$-trees":[56],"are":[57],"derived":[58],"by":[59,179],"using":[60,108],"recursion":[61],"in":[62,177],"spirit":[64],"inverse":[67,103],"Ackermann":[68,106],"function.":[69],"The":[70],"$-tree":[74],"leads":[77],"to":[78,150],"new":[80,181,201],"design":[81],"paradigm":[82,87],"algorithms.":[85],"allows":[88],"extremely":[90,155],"fast":[91],"computations,":[93],"specifically,":[94],"$O(\\alpha":[95],"(n))$":[96],"time":[97],"$\\alpha":[99],"(n)$":[100],"function),":[107],"an":[109,132,154],"optimal":[110,133],"number":[111,134,157],"processors":[113,136,159],"on":[114],"(weakest)":[116],"concurrent-read,":[117],"concurrent-write":[118],"random-access":[120],"machine":[121],"(CRCW":[122],"PRAM).":[123],"These":[124],"computations":[125],"need":[126],"only":[127],"constant":[128],"time,":[129],"use":[131],"if":[137],"following":[139],"nonstandard":[140],"assumption":[141],"about":[142],"model":[144],"computation":[147],"added":[149],"CRCW":[152],"PRAM:":[153],"small":[156],"each":[160],"can":[161],"write":[162],"simultaneously":[163],"into":[164],"different":[165],"bits":[166],"same":[169],"word.":[170],"Applications":[171],"include":[172],"finding":[173],"lowest":[174],"common":[175],"ancestors":[176],"trees":[178],"algorithm":[182],"that":[183],"considerably":[185],"simpler":[186],"than":[187],"known":[189],"algorithms":[190],"problem,":[193],"restricted":[194],"domain":[195],"merging,":[196],"parentheses":[197],"matching,":[198],"reducibility.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}