{"id":"https://openalex.org/W1607877412","doi":"https://doi.org/10.1007/3-540-57155-8_238","title":"A general lower bound on the I/O-complexity of comparison-based algorithms","display_name":"A general lower bound on the I/O-complexity of comparison-based algorithms","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1607877412","doi":"https://doi.org/10.1007/3-540-57155-8_238","mag":"1607877412"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57155-8_238","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57155-8_238","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/A5084056010","display_name":"Lars Arge","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":true,"raw_author_name":"Lars Arge","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","Aarhus University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","institution_ids":[]},{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077153160","display_name":"Mikael Bergholz Knudsen","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":"Mikael Knudsen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","Aarhus University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","institution_ids":[]},{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030441743","display_name":"Kirsten Larsen","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":"Kirsten Larsen","raw_affiliation_strings":["Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","Aarhus University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C","institution_ids":[]},{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.938,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.93870816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"83","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"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/multiset","display_name":"Multiset","score":0.9583940505981445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6469559073448181},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.625098466873169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5061184763908386},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4902932941913605},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4323575794696808},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3462640643119812},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33361560106277466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29659557342529297}],"concepts":[{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.9583940505981445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6469559073448181},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.625098466873169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5061184763908386},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4902932941913605},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4323575794696808},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3462640643119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33361560106277466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29659557342529297},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-57155-8_238","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57155-8_238","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.17.1504","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.1504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~large/Papers/wads.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.5616","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5616","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/PB/407/PB-407.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/b0639900-c61e-11df-8cb9-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/b0639900-c61e-11df-8cb9-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A, Knudsen, M & Larsen, K 1993, A general lower bound on the I/O-complexity of comparison-based algorithms. in F Dehne, J-R Sack, N Santoro & S Whitesides (eds), Algorithms and Data Structures : Third Workshop, WADS '93 Montr\u00e9al, Canada, August 11-13, 1993 Proceedings. Springer, Lecture Notes in Computer Science, vol. 709, pp. 83-94, Workshop on Algorithms and Data Structures, Montr\u00e9al, Canada, 11/08/1993. https://doi.org/10.1007/3-540-57155-8_238","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W123136391","https://openalex.org/W1501775657","https://openalex.org/W1526131532","https://openalex.org/W1529120744","https://openalex.org/W1536890784","https://openalex.org/W1965609430","https://openalex.org/W1996641400","https://openalex.org/W2006355640","https://openalex.org/W2059985428","https://openalex.org/W2075620352","https://openalex.org/W3198160809","https://openalex.org/W6633749307"],"related_works":["https://openalex.org/W4300455649","https://openalex.org/W2296588302","https://openalex.org/W4328119206","https://openalex.org/W2033245919","https://openalex.org/W4252409532","https://openalex.org/W2006067547","https://openalex.org/W9228044","https://openalex.org/W3143753676","https://openalex.org/W2954483618","https://openalex.org/W2770810599"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}