{"id":"https://openalex.org/W1994772453","doi":"https://doi.org/10.1137/0206025","title":"Stable Sorting and Merging with Optimal Space and Time Bounds","display_name":"Stable Sorting and Merging with Optimal Space and Time Bounds","publication_year":1977,"publication_date":"1977-06-01","ids":{"openalex":"https://openalex.org/W1994772453","doi":"https://doi.org/10.1137/0206025","mag":"1994772453"},"language":"en","primary_location":{"id":"doi:10.1137/0206025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5084790540","display_name":"Luis Trabb Pardo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis Trabb Pardo","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084790540"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.0820038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"6","issue":"2","first_page":"351","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9984999895095825,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9970999956130981,"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/merge-algorithm","display_name":"Merge algorithm","score":0.7498072981834412},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.7411350011825562},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.7151188850402832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6736183166503906},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6121450662612915},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.5898734927177429},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5643690824508667},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5583437085151672},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5136953592300415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4972093403339386},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.46511131525039673},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41473332047462463},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39283761382102966},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3624170124530792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29408666491508484},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12616801261901855},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08454868197441101}],"concepts":[{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.7498072981834412},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.7411350011825562},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.7151188850402832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6736183166503906},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6121450662612915},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.5898734927177429},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5643690824508667},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5583437085151672},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5136953592300415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4972093403339386},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.46511131525039673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41473332047462463},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39283761382102966},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3624170124530792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29408666491508484},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12616801261901855},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08454868197441101},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2039987359","https://openalex.org/W2049320205"],"related_works":["https://openalex.org/W2925598649","https://openalex.org/W4320925713","https://openalex.org/W2190513794","https://openalex.org/W2540352350","https://openalex.org/W2552439138","https://openalex.org/W2765396134","https://openalex.org/W2011379812","https://openalex.org/W3002580575","https://openalex.org/W2140238930","https://openalex.org/W3014215895"],"abstract_inverted_index":{"This":[0],"work":[1],"introduces":[2],"two":[3],"algorithms":[4,14,42],"for":[5],"stable":[6,9],"merging":[7],"and":[8,25,61,65],"sorting":[10],"of":[11,29,45,49,57,63],"files.":[12],"The":[13],"have":[15],"optimal":[16],"worst":[17],"case":[18],"time":[19],"bounds,":[20],"the":[21,26,58],"merge":[22],"is":[23,28],"linear":[24],"sort":[27],"order":[30],"$n":[31],"\\log":[32],"n$.":[33],"Extra":[34],"storage":[35],"requirements":[36],"are":[37,52],"also":[38],"optimal,":[39],"since":[40],"both":[41],"make":[43],"use":[44],"a":[46],"fixed":[47],"number":[48],"pointers.":[50],"Files":[51],"handled":[53],"only":[54],"by":[55],"means":[56],"primitives":[59],"exchange":[60],"comparison":[62],"records":[64],"basic":[66],"pointer":[67],"transformations.":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"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"}