{"id":"https://openalex.org/W2007732780","doi":"https://doi.org/10.1137/0213049","title":"The Information-Theoretic Bound is Good for Merging","display_name":"The Information-Theoretic Bound is Good for Merging","publication_year":1984,"publication_date":"1984-11-01","ids":{"openalex":"https://openalex.org/W2007732780","doi":"https://doi.org/10.1137/0213049","mag":"2007732780"},"language":"en","primary_location":{"id":"doi:10.1137/0213049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213049","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/A5050009387","display_name":"Nathan Linial","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Nathan Linial","raw_affiliation_strings":["Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904 Israel"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904 Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050009387"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":6.5144,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.97223818,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"4","first_page":"795","last_page":"801"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.7580356597900391},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6848962306976318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6837877035140991},{"id":"https://openalex.org/keywords/linear-extension","display_name":"Linear extension","score":0.5950256586074829},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.574581503868103},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5702719688415527},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5535964965820312},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4989478588104248},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.45327579975128174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4513484835624695},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4217853248119354},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.26404374837875366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14995026588439941}],"concepts":[{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.7580356597900391},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6848962306976318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6837877035140991},{"id":"https://openalex.org/C129393996","wikidata":"https://www.wikidata.org/wiki/Q6553442","display_name":"Linear extension","level":3,"score":0.5950256586074829},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.574581503868103},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5702719688415527},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5535964965820312},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4989478588104248},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.45327579975128174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4513484835624695},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4217853248119354},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.26404374837875366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14995026588439941},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0213049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213049","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.710.9171","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.710.9171","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.huji.ac.il/%7Enati/PAPERS/inf_th_merging.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1996384709","https://openalex.org/W1999154601","https://openalex.org/W2047135973","https://openalex.org/W2091505308","https://openalex.org/W2105310556","https://openalex.org/W2137364798","https://openalex.org/W2167019081","https://openalex.org/W2604196755","https://openalex.org/W3015657067"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"Let":[0],"$A":[1,44],"=":[2,11,55,132],"(a_1":[3],">":[4,6,13,15],"\\cdots":[5,14],"a_m":[7],")$":[8,17],"and":[9,33,63],"$B":[10],"(b_1":[12],"b_n":[16],"be":[18,25,100,153],"given":[19,26],"ordered":[20],"lists:":[21],"also":[22],"let":[23],"there":[24,116],"some":[27],"order":[28,41,71,83],"relations":[29,53],"between":[30],"$a_i":[31],"$\u2019s":[32],"$b_j":[34],"$\u2019s.":[35],"Suppose":[36],"that":[37,94,115],"an":[38,118],"unknown":[39],"total":[40,70],"exists":[42,117],"on":[43],"\\cup":[45],"B$":[46],"which":[47,120],"is":[48,165],"consistent":[49],"with":[50],"all":[51],"these":[52],"($":[54],"a$":[56],"linear":[57,86],"extension":[58],"of":[59,75],"the":[60,81,89,103,147],"partial":[61,82],"order)":[62],"we":[64,113],"wish":[65],"to":[66,145,152],"find":[67],"out":[68],"this":[69,111],"by":[72],"comparing":[73],"pairs":[74],"elements":[76],"$a_t":[77,149],":b_s":[78,150],"$.":[79,141],"If":[80],"has":[84,155],"N":[85],"extensions,":[87],"then":[88],"Information":[90],"Theoretic":[91],"Bound":[92],"says":[93],"$\\log":[95],"_2":[96,127,134],"N$":[97,128],"steps":[98],"will":[99,121],"required":[101,144],"in":[102,158],"worst":[104],"case":[105],"from":[106],"any":[107],"such":[108],"algorithm.":[109],"In":[110],"paper":[112],"show":[114],"algorithm":[119],"take":[122],"no":[123],"more":[124],"than":[125],"$C\\log":[126],"comparisons":[129],"where":[130],"$C":[131],"(\\log":[133],"((\\sqrt":[135],"5":[136],"+":[137,160],"1)/":[138],"2))^{":[139],"-1}":[140],"The":[142,162],"computation":[143],"determine":[146],"pair":[148],"$":[151],"compared":[154],"length":[156],"polynomial":[157],"$(m":[159],"n)$.":[161],"constant":[163],"C":[164],"best":[166],"possible.":[167],"Many":[168],"related":[169],"results":[170],"are":[171],"reviewed.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}