{"id":"https://openalex.org/W4236607251","doi":"https://doi.org/10.1145/2034773.2034791","title":"Balanced trees inhabiting functional parallel programming","display_name":"Balanced trees inhabiting functional parallel programming","publication_year":2011,"publication_date":"2011-09-19","ids":{"openalex":"https://openalex.org/W4236607251","doi":"https://doi.org/10.1145/2034773.2034791"},"language":"en","primary_location":{"id":"doi:10.1145/2034773.2034791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034773.2034791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-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/A5037284935","display_name":"Akimasa Morihata","orcid":"https://orcid.org/0000-0003-2741-5954"},"institutions":[{"id":"https://openalex.org/I4210093896","display_name":"Tohoku University Hospital","ror":"https://ror.org/00kcd6x60","country_code":"JP","type":"healthcare","lineage":["https://openalex.org/I4210093896"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akimasa Morihata","raw_affiliation_strings":["Tohoku University, Sendai-shi, Miyagi-prefecture, Japan"],"affiliations":[{"raw_affiliation_string":"Tohoku University, Sendai-shi, Miyagi-prefecture, Japan","institution_ids":["https://openalex.org/I4210093896"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081111196","display_name":"Kiminori Matsuzaki","orcid":"https://orcid.org/0009-0003-4663-3292"},"institutions":[{"id":"https://openalex.org/I35568498","display_name":"Kochi University of Technology","ror":"https://ror.org/00rghrr56","country_code":"JP","type":"education","lineage":["https://openalex.org/I35568498"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kiminori Matsuzaki","raw_affiliation_strings":["Kochi University of Technology, Kami-shi, Kochi-prefecture, Japan"],"affiliations":[{"raw_affiliation_string":"Kochi University of Technology, Kami-shi, Kochi-prefecture, Japan","institution_ids":["https://openalex.org/I35568498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037284935"],"corresponding_institution_ids":["https://openalex.org/I4210093896"],"apc_list":null,"apc_paid":null,"fwci":0.2519,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62880596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"117","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9940000176429749,"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.8377274870872498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7856234312057495},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5833632946014404},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5380695462226868},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5310680866241455},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5135927200317383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49527207016944885},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4465154707431793},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.41286325454711914},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3773311376571655},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3377852439880371},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.2638477385044098},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11547717452049255}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.8377274870872498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7856234312057495},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5833632946014404},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5380695462226868},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5310680866241455},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5135927200317383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49527207016944885},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4465154707431793},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.41286325454711914},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3773311376571655},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3377852439880371},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2638477385044098},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11547717452049255}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2034773.2034791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034773.2034791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309707","display_name":"University of Arizona Cancer Center","ror":"https://ror.org/03m2x1q45"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W196896079","https://openalex.org/W326743114","https://openalex.org/W1498362922","https://openalex.org/W1520171143","https://openalex.org/W1556536463","https://openalex.org/W1963791598","https://openalex.org/W1964669678","https://openalex.org/W1965122136","https://openalex.org/W1965874601","https://openalex.org/W1975580206","https://openalex.org/W2001679238","https://openalex.org/W2005600529","https://openalex.org/W2013444956","https://openalex.org/W2013616027","https://openalex.org/W2022050707","https://openalex.org/W2023299380","https://openalex.org/W2024951218","https://openalex.org/W2025791989","https://openalex.org/W2040345331","https://openalex.org/W2057292961","https://openalex.org/W2086688035","https://openalex.org/W2091138079","https://openalex.org/W2098522119","https://openalex.org/W2117818027","https://openalex.org/W2130566259","https://openalex.org/W2145861698","https://openalex.org/W2148599839","https://openalex.org/W2163496769","https://openalex.org/W2208923056","https://openalex.org/W2752908210","https://openalex.org/W4244257941"],"related_works":["https://openalex.org/W1608806855","https://openalex.org/W2023505575","https://openalex.org/W1974621770","https://openalex.org/W1850053445","https://openalex.org/W2118397176","https://openalex.org/W2358725432","https://openalex.org/W2127617483","https://openalex.org/W2160248602","https://openalex.org/W4206199070","https://openalex.org/W4236607251"],"abstract_inverted_index":{"Divide-and-conquer":[0],"is":[1,93],"an":[2],"important":[3],"technique":[4],"in":[5],"parallel":[6,39,59,111,119,157],"programming.":[7],"However,":[8],"algebraic":[9],"data":[10],"structures":[11,68],"do":[12],"not":[13],"fit":[14],"divide-and-conquer":[15,38,88],"parallelism.":[16,89],"For":[17],"example,":[18],"the":[19,96],"usual":[20],"pointer-based":[21],"implementation":[22],"of":[23,77,98,105],"lists":[24,140],"cannot":[25],"efficiently":[26],"be":[27,51,124],"divided":[28],"at":[29],"their":[30,78],"middle,":[31],"which":[32],"prevents":[33],"us":[34],"from":[35,110],"developing":[36,107],"list-iterating":[37],"programs.":[40],"Tree-iterating":[41],"programs":[42,120,158],"possibly":[43],"face":[44],"a":[45,103],"similar":[46],"problem,":[47],"because":[48],"trees":[49,109],"might":[50],"ill-balanced":[52],"and":[53,69,113,144,165],"list-like":[54],"shapes.":[55],"This":[56],"paper":[57],"examines":[58],"programming":[60],"based":[61],"on":[62,73,121],"balanced":[63,108],"trees:":[64],"we":[65,115],"consider":[66,135],"balanced-tree":[67],"develop":[70],"recursive":[71,85],"functions":[72,86,136],"them.":[74],"By":[75],"virtue":[76],"balancing":[79],"nature,":[80],"either":[81,139],"bottom-up":[82],"or":[83,141],"top-down":[84],"exploit":[87],"Our":[90],"main":[91],"contribution":[92],"to":[94],"demonstrate":[95],"promise":[97],"this":[99],"approach.":[100],"We":[101,134],"propose":[102],"way":[104],"systematically":[106],"algorithms,":[112],"then,":[114],"show":[116,145],"that":[117,137,146],"efficient":[118],"them":[122],"can":[123,149],"developed":[125,156],"by":[126,130,163],"equational":[127],"reasoning":[128],"powered":[129],"Reynolds'":[131],"relational":[132],"parametricity.":[133],"operate":[138],"binary":[142],"trees,":[143],"our":[147],"methods":[148],"uniformly":[150],"deal":[151],"with":[152],"both":[153],"cases.":[154],"The":[155],"are":[159],"purely":[160],"functional,":[161],"correct":[162],"construction,":[164],"sometimes":[166],"even":[167],"simpler":[168],"than":[169],"known":[170],"algorithms.":[171]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}