{"id":"https://openalex.org/W1598131534","doi":"https://doi.org/10.1007/3-540-60220-8_69","title":"Amortization results for chromatic search trees, with an application to priority queues","display_name":"Amortization results for chromatic search trees, with an application to priority queues","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1598131534","doi":"https://doi.org/10.1007/3-540-60220-8_69","mag":"1598131534"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60220-8_69","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60220-8_69","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/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joan Boyar","raw_affiliation_strings":["Odense University, Denmark","Odense University"],"affiliations":[{"raw_affiliation_string":"Odense University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["Odense University, Denmark","Odense University"],"affiliations":[{"raw_affiliation_string":"Odense University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000210653","display_name":"Kim S. Larsen","orcid":"https://orcid.org/0000-0003-0560-3794"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim S. Larsen","raw_affiliation_strings":["Odense University, Denmark","Odense University"],"affiliations":[{"raw_affiliation_string":"Odense University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068354624"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7909,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89479905,"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":"270","last_page":"281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9937000274658203,"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":0.9937000274658203,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9901000261306763,"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/T11478","display_name":"Caching and Content Delivery","score":0.9890999794006348,"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/computer-science","display_name":"Computer science","score":0.8354793787002563},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6572763919830322},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.615563690662384},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5213783383369446},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.4765075743198395},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.46998679637908936},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4416751265525818},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4317858815193176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3443527817726135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3391255736351013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17167925834655762},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1660710871219635},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11010655760765076},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06249034404754639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8354793787002563},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6572763919830322},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.615563690662384},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5213783383369446},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.4765075743198395},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.46998679637908936},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4416751265525818},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4317858815193176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3443527817726135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3391255736351013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17167925834655762},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1660710871219635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11010655760765076},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06249034404754639}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-60220-8_69","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60220-8_69","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.4.4293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.4293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.leekillough.com/heaps/papers/ss971511.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.4232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.4232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.imada.ou.dk/~rolf/VersionSentToWADS.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W6502334","https://openalex.org/W17487755","https://openalex.org/W112831861","https://openalex.org/W1972027649","https://openalex.org/W1973610879","https://openalex.org/W1974269564","https://openalex.org/W1984825199","https://openalex.org/W2016559894","https://openalex.org/W2019235922","https://openalex.org/W2021615496","https://openalex.org/W2028764399","https://openalex.org/W2029390211","https://openalex.org/W2033584818","https://openalex.org/W2039071499","https://openalex.org/W2050529741","https://openalex.org/W2057391254","https://openalex.org/W2077180154","https://openalex.org/W2108179552","https://openalex.org/W2139241970","https://openalex.org/W2145052180","https://openalex.org/W2157823105","https://openalex.org/W2431458507","https://openalex.org/W2753176400","https://openalex.org/W2901608006","https://openalex.org/W3198470706","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2584231425","https://openalex.org/W2150611273","https://openalex.org/W2045183646","https://openalex.org/W207411050","https://openalex.org/W189328514","https://openalex.org/W2143289692","https://openalex.org/W1974858599","https://openalex.org/W3049636605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
