{"id":"https://openalex.org/W2125564319","doi":"https://doi.org/10.1093/comjnl/bxq025","title":"Fast Generation of t-ary Trees","display_name":"Fast Generation of t-ary Trees","publication_year":2010,"publication_date":"2010-03-17","ids":{"openalex":"https://openalex.org/W2125564319","doi":"https://doi.org/10.1093/comjnl/bxq025","mag":"2125564319"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxq025","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq025","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5058610334","display_name":"James F. Korsh","orcid":null},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. F. Korsh","raw_affiliation_strings":["Computer and Information Sciences Department, Temple University, Wachman Hall 317, Philadelphia, PA 19103, USA"],"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences Department, Temple University, Wachman Hall 317, Philadelphia, PA 19103, USA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058610334"],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20042468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"54","issue":"5","first_page":"776","last_page":"785"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9947999715805054,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7216627597808838},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.7058485746383667},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6737363338470459},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.617691695690155},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5420215725898743},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5163899064064026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45324671268463135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43765661120414734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2843271791934967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28416359424591064},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.2399415671825409},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.21437934041023254},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0645957887172699}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7216627597808838},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.7058485746383667},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6737363338470459},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.617691695690155},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5420215725898743},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5163899064064026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45324671268463135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43765661120414734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2843271791934967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28416359424591064},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2399415671825409},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.21437934041023254},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0645957887172699},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxq025","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxq025","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312387","display_name":"Temple University","ror":"https://ror.org/00kx1jb78"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2062195135","https://openalex.org/W2795079307","https://openalex.org/W1971148082","https://openalex.org/W2793058541","https://openalex.org/W2378491141","https://openalex.org/W3118638206","https://openalex.org/W1588041347","https://openalex.org/W1985727224","https://openalex.org/W2035903654","https://openalex.org/W2046231668"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"new":[3],"algorithms":[4],"for":[5],"generating":[6],"all":[7],"n-node":[8],"t-ary":[9],"trees":[10],"in":[11],"linked":[12],"representation":[13],"which":[14],"take":[15],"constant":[16],"average":[17],"time":[18],"per":[19],"tree.":[20],"They":[21],"use":[22],"fewer":[23],"memory":[24],"references":[25],"and":[26],"are":[27],"considerably":[28],"faster":[29],"than":[30],"previous":[31],"such":[32],"algorithms.":[33]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}