{"id":"https://openalex.org/W2022085444","doi":"https://doi.org/10.1137/s0097539796305298","title":"Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults","display_name":"Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2022085444","doi":"https://doi.org/10.1137/s0097539796305298","mag":"2022085444"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796305298","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796305298","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/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tom Leighton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089761627","display_name":"Yuan Ma","orcid":"https://orcid.org/0000-0002-4794-5496"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuan Ma","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113572159"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.1865754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"29","issue":"1","first_page":"258","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9984999895095825,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9858999848365784,"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/comparator","display_name":"Comparator","score":0.8861754536628723},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6087896227836609},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6012394428253174},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.592739999294281},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.5561505556106567},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5520741939544678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5190333127975464},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5178945064544678},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5058817267417908},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5028209090232849},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4861392676830292},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4508969783782959},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4456171989440918},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4183826744556427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4097299575805664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38977450132369995},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.3832366168498993},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33854788541793823},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2970852553844452},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0872250497341156}],"concepts":[{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.8861754536628723},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6087896227836609},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6012394428253174},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.592739999294281},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.5561505556106567},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5520741939544678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5190333127975464},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5178945064544678},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5058817267417908},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5028209090232849},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4861392676830292},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4508969783782959},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4456171989440918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4183826744556427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4097299575805664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38977450132369995},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.3832366168498993},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33854788541793823},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2970852553844452},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0872250497341156},{"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796305298","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796305298","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":[{"id":"https://metadata.un.org/sdg/16","score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1984072326","https://openalex.org/W1988695498","https://openalex.org/W2016350196","https://openalex.org/W2020570928","https://openalex.org/W2028006945","https://openalex.org/W2046805643","https://openalex.org/W2085891284","https://openalex.org/W2087711310","https://openalex.org/W2127105163","https://openalex.org/W2144536576","https://openalex.org/W4241840173"],"related_works":["https://openalex.org/W2908348257","https://openalex.org/W2994182992","https://openalex.org/W2350549588","https://openalex.org/W4281648223","https://openalex.org/W2396743875","https://openalex.org/W2072995086","https://openalex.org/W2362374543","https://openalex.org/W2085265870","https://openalex.org/W2187267622","https://openalex.org/W2351942115"],"abstract_inverted_index":{"We":[0,21,55,176,236],"study":[1],"networks":[2,26],"that":[3,27,132,185,214,228,239,259],"can":[4,106,136,158,193,229],"sort":[5,137],"n,":[6],"items":[7,139],"even":[8,140],"when":[9],"a":[10,103,125,142,195,223,295],"large":[11],"number":[12,155],"of":[13,29,59,72,88,102,109,115,145,156,198,209,262,294],"the":[14,17,57,69,99,113,146,151,154,207,260,272,279,286,292],"comparators":[15,131,147,157,218],"in":[16,97,180],"network":[18,126,191,227],"are":[19,36,49,148,219,285],"faulty.":[20,149],"restrict":[22],"our":[23],"attention":[24],"to":[25,38,45,51,123,221,232,265],"consist":[28],"registers,":[30],"comparators,":[31],"and":[32,47,62,66,79,119,278],"replicators.":[33],"(":[34],"Replicators":[35],"used":[37],"copy":[39],"an":[40,172],"item":[41],"from":[42],"one":[43],"register":[44],"another,":[46],"they":[48],"assumed":[50],"be":[52,159],"fault":[53],"free.)":[54],"consider":[56],"scenario":[58],"both":[60],"random":[61,116,199,276],"worst-case":[63,210,234,266,283],"comparator":[64,74,105],"faults,":[65,117,211],"we":[67,212],"follow":[68],"general":[70],"model":[71],"destructive":[73],"failure":[75],"proposed":[76],"by":[77,183],"Assaf":[78,118],"Upfal":[80,120],"[":[81],"Proc.":[82],"31st":[83],"IEEE":[84],"Symposium":[85],"on":[86,153,291],"Foundations":[87],"Computer":[89],"Science,":[90],"St.":[91],"Louis,":[92],"MO,":[93],"1990,":[94],"pp.":[95],"275--284]":[96],"which":[98,192],"two":[100],"outputs":[101],"faulty":[104],"fail":[107],"independently":[108],"each":[110],"other.":[111],"In":[112,206],"case":[114,208],"showed":[121],"how":[122],"construct":[124,222],"with":[127],"O(n":[128,163],"log2n":[129],")":[130],"(with":[133],"high":[134],"probability)":[135],"n":[138],"if":[141],"constant":[143,196],"fraction":[144,197],"Whether":[150],"bound":[152,241,251,274,281],"improved":[160],"(to,":[161],"say,":[162],"log":[164],"n))":[165],"for":[166,244,275,282],"sorting":[167,188,224,297],"(or":[168],"merging)":[169],"has":[170,201],"remained":[171],"interesting":[173],"open":[174],"question.":[175],"resolve":[177],"this":[178,181,240],"question":[179],"paper":[182],"proving":[184],"any":[186],"n-item":[187],"or":[189,225,298],"merging":[190,226,299],"tolerate":[194,230],"failures":[200,267],"$\\Omega(n":[202],"\\log^2":[203],"n)$":[204,217],"comparators.":[205],"show":[213,238],"$\\Omega(kn":[215],"\\log":[216],"necessary":[220],"up":[231],"k":[233,245],"faults.":[235],"also":[237],"is":[242,252,268],"tight":[243],"=":[246],"O(log":[247],"n).":[248],"The":[249],"lower":[250,273,280,289],"particularly":[253],"significant":[254],"since":[255],"it":[256],"formally":[257],"proves":[258],"cost":[261],"being":[263],"tolerant":[264],"very":[269],"high.":[270],"Both":[271],"faults":[277,284],"first":[287],"nontrivial":[288],"bounds":[290],"size":[293],"fault-tolerant":[296],"network.":[300]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}