{"id":"https://openalex.org/W1585373186","doi":"https://doi.org/10.1007/11841036_18","title":"Purely Functional Worst Case Constant Time Catenable Sorted Lists","display_name":"Purely Functional Worst Case Constant Time Catenable Sorted Lists","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1585373186","doi":"https://doi.org/10.1007/11841036_18","mag":"1585373186"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_18","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":"conference-paper","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Department of Computer Science, University of Aarhus, BRICS, Basic Research in Computer Science, funded by the Danish National Research Foundation,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Aarhus, BRICS, Basic Research in Computer Science, funded by the Danish National Research Foundation,","institution_ids":["https://openalex.org/I4210087405"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087360505","display_name":"Christos Makris","orcid":"https://orcid.org/0000-0003-2571-7449"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Makris","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086706681","display_name":"Kostas Tsichlas","orcid":"https://orcid.org/0000-0003-4107-9520"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Kostas Tsichlas","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.07718997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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.7957381010055542},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.7478686571121216},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6794082522392273},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4923292398452759},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47407475113868713},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4301602244377136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41689029335975647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37909170985221863},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2716987431049347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22854000329971313},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11691662669181824}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7957381010055542},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7478686571121216},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6794082522392273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4923292398452759},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47407475113868713},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4301602244377136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41689029335975647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37909170985221863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2716987431049347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22854000329971313},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11691662669181824}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/11841036_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_18","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.70.1493","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.1493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.au.dk/~gerth/Papers/esa06trees.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/b5f908a0-d941-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/b5f908a0-d941-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Makris, C & Tsichlas, K 2006, Purely Functional Worst Case Constant Time Catenable Sorted Lists. in Y Azar & T Erlebach (eds), Algorithms \u2013 ESA 2006 : 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings. Springer, Lecture Notes in Computer Science, vol. 4168, pp. 172-183, 14th Annual European Symposium on Algorithms. ESA 2006, Zurich, Switzerland, 11/09/2006. https://doi.org/10.1007/11841036_18","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W8290509","https://openalex.org/W41435888","https://openalex.org/W117034736","https://openalex.org/W199376359","https://openalex.org/W1484930340","https://openalex.org/W1505451213","https://openalex.org/W1574082713","https://openalex.org/W1964669678","https://openalex.org/W1977154819","https://openalex.org/W1986380853","https://openalex.org/W2010063782","https://openalex.org/W2015816114","https://openalex.org/W2043869213","https://openalex.org/W2068096826","https://openalex.org/W2069528896","https://openalex.org/W2082663866","https://openalex.org/W2105045857","https://openalex.org/W2136598300","https://openalex.org/W2142947709","https://openalex.org/W2398866592","https://openalex.org/W3138411056","https://openalex.org/W4213048098","https://openalex.org/W4240404419"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3100139999","https://openalex.org/W2030312085"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}