乐胖代购免代理版

{"id":"https://openalex.org/W3160262327","doi":"https://doi.org/10.1145/3433651","title":"Cache Oblivious Algorithms for Computing the Triplet Distance between Trees","display_name":"Cache Oblivious Algorithms for Computing the Triplet Distance between Trees","publication_year":2021,"publication_date":"2021-05-08","ids":{"openalex":"https://openalex.org/W3160262327","doi":"https://doi.org/10.1145/3433651","mag":"3160262327"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3433651","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol087-esa2017/LIPIcs.ESA.2017.21/LIPIcs.ESA.2017.21.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044288547","display_name":"Konstantinos Mampentzidis","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Konstantinos Mampentzidis","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.132,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.402035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":57,"max":67},"biblio":{"volume":"26","issue":null,"first_page":"1","last_page":"44"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9978,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.7684041},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42462963}],"concepts":[{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.7684041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6425021},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6366995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.571285},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4674965},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.43699437},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42462963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37423533},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.35374558},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31106585},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.30215034},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2024383},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3433651","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol087-esa2017/LIPIcs.ESA.2017.21/LIPIcs.ESA.2017.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":["Schloss Dagstuhl \u2013 Leibniz Center for Informatics"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://pure.au.dk/portal/da/publications/cache-oblivious-algorithms-for-computing-the-triplet-distance-between-trees(42e8c01a-7dcf-4364-bc85-6976750a0613).html","pdf_url":"https://pure.au.dk/portal/files/118168826/LIPIcs_ESA_2017_21.pdf","source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://pure.au.dk/ws/files/118168826/LIPIcs_ESA_2017_21.pdf","pdf_url":"https://pure.au.dk/ws/files/118168826/LIPIcs_ESA_2017_21.pdf","source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1706.10284","pdf_url":"http://arxiv.org/pdf/1706.10284","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol087-esa2017/LIPIcs.ESA.2017.21/LIPIcs.ESA.2017.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":["Schloss Dagstuhl \u2013 Leibniz Center for Informatics"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1972425460","https://openalex.org/W1996437477","https://openalex.org/W1999727705","https://openalex.org/W2037749900","https://openalex.org/W2038142281","https://openalex.org/W2060425093","https://openalex.org/W2097706568","https://openalex.org/W2114055146","https://openalex.org/W2117489143","https://openalex.org/W2127902590","https://openalex.org/W2144144677","https://openalex.org/W2164147196","https://openalex.org/W2561675875","https://openalex.org/W2567683150","https://openalex.org/W2964236121","https://openalex.org/W4291439952","https://openalex.org/W4379662611"],"related_works":["https://openalex.org/W4388717692","https://openalex.org/W4312770956","https://openalex.org/W2527471267","https://openalex.org/W2475955799","https://openalex.org/W2167303720","https://openalex.org/W2147122795","https://openalex.org/W2046128376","https://openalex.org/W2001324285","https://openalex.org/W1863436361","https://openalex.org/W1593732971"],"abstract_inverted_index":{"We":[0,101,193],"consider":[1],"the":[2,6,23,27,37,84,109,119,122,130,145,159,178,189,198],"problem":[3],"of":[4,29,111,140],"computing":[5],"triplet":[7,24],"distance":[8,25],"between":[9],"two":[10,38,103,123,137],"rooted":[11],"unordered":[12],"trees":[13,125,139],"with":[14],"n":[15,48,50,74,77,88,90,152,154,164,169],"labeled":[16],"leaves.":[17],"Introduced":[18],"by":[19,53],"Dobson":[20],"in":[21,36,70,80,144,158,207,210],"1975,":[22],"is":[26,45,117,132],"number":[28],"leaf":[30],"triples":[31],"that":[32,107,180,195,201],"induce":[33],"different":[34],"topologies":[35],"trees.":[39],"The":[40,114],"current":[41],"theoretically":[42,85],"fastest":[43],"algorithm":[44,52,66,116,135],"an":[46],"O(":[47,73,87,151,163],"log":[49,75,89,153,167],")":[51,78,91,155,172],"Brodal":[54],"et":[55],"al.":[56],"(SODA":[57],"2013).":[58],"Recently,":[59],"Jansson":[60],"and":[61,129,157,177,209],"Rajaby":[62],"proposed":[63],"a":[64,133],"new":[65],"that,":[67],"while":[68],"slower":[69],"theory,":[71],"requiring":[72],"3":[76],"time,":[79,156],"practice":[81],"it":[82],"outperforms":[83],"faster":[86],"algorithm.":[92],"Both":[93],"algorithms":[94,106,149,200],"do":[95],"not":[96],"scale":[97,182,202],"to":[98,183,203],"external":[99,184,204],"memory.":[100],"present":[102],"cache":[104,160],"oblivious":[105,161],"combine":[108],"best":[110,190],"both":[112,148,206],"worlds.":[113],"first":[115,199],"for":[118,136,212],"case":[120],"when":[121],"input":[124,138],"are":[126,197],"binary":[127],"trees,":[128],"second":[131],"generalized":[134],"arbitrary":[141],"degree.":[142],"Analyzed":[143],"RAM":[146],"model,":[147],"require":[150],"model":[162],"/":[165,170],"B":[166],"2":[168],"M":[171],"I/Os.":[173],"Their":[174],"relative":[175],"simplicity":[176],"fact":[179],"they":[181],"memory":[185],"makes":[186],"them":[187],"achieve":[188],"practical":[191],"performance.":[192],"note":[194],"these":[196],"memory,":[205],"theory":[208],"practice,":[211],"this":[213],"problem.":[214]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3160262327","counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-01-17T00:55:38.692686","created_date":"2021-05-24"}