{"id":"https://openalex.org/W1532592410","doi":"https://doi.org/10.1137/s0097539798341594","title":"Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors","display_name":"Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1532592410","doi":"https://doi.org/10.1137/s0097539798341594","mag":"1532592410"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798341594","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798341594","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/A5109219665","display_name":"Ming\u2010Yang Kao","orcid":null},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]},{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ming-Yang Kao","raw_affiliation_strings":["University of North Carolina at Greensboro","Yale University"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Greensboro","institution_ids":["https://openalex.org/I169335092"]},{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100440013","display_name":"Jie Wang","orcid":"https://orcid.org/0000-0001-7870-0646"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Wang","raw_affiliation_strings":["Yale University  ;"],"affiliations":[{"raw_affiliation_string":"Yale University  ;","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109219665"],"corresponding_institution_ids":["https://openalex.org/I169335092","https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.4684,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63146233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"5","first_page":"1568","last_page":"1576"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"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/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/mathematics","display_name":"Mathematics","score":0.6797287464141846},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6704146265983582},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5977842211723328},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.5863028764724731},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5779171586036682},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5645177364349365},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5390855669975281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4409812390804291},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.41996386647224426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38655808568000793},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.10623770952224731}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6797287464141846},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6704146265983582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5977842211723328},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.5863028764724731},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5779171586036682},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5645177364349365},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5390855669975281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4409812390804291},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.41996386647224426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38655808568000793},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.10623770952224731},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539798341594","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798341594","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.138.3571","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.3571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs.ds/9907015.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":16,"referenced_works":["https://openalex.org/W80079294","https://openalex.org/W1981663184","https://openalex.org/W1982553213","https://openalex.org/W2010205902","https://openalex.org/W2011039300","https://openalex.org/W2020804487","https://openalex.org/W2026891778","https://openalex.org/W2029745051","https://openalex.org/W2053987390","https://openalex.org/W2064558818","https://openalex.org/W2169004268","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W3021014091","https://openalex.org/W3022909171","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3195953963","https://openalex.org/W2795652519","https://openalex.org/W2064998746","https://openalex.org/W2146193603","https://openalex.org/W4303648853","https://openalex.org/W2044769119","https://openalex.org/W3115255814","https://openalex.org/W2953237671","https://openalex.org/W1532592410","https://openalex.org/W748479430"],"abstract_inverted_index":{"Given":[0],"a":[1,73,83,125,150],"multiset":[2],"X={x1":[3],",.":[4],".":[5,19,20,21],".,xn}":[6],"of":[7,35],"real":[8],"numbers,":[9,48],"the":[10,27,56,65,108,144],"floating-point":[11],"set":[12],"summation":[13],"problem":[14],"asks":[15],"for":[16,77,134],"Sn=x1":[17],"+":[18,22],"xn.":[23],"Let":[24],"$E^*_n$":[25,159],"denote":[26],"minimum":[28],"worst-case":[29,57,84,126,151],"error":[30,58,76,85,127,152],"over":[31],"all":[32,114,117],"possible":[33],"orderings":[34],"evaluating":[36],"Sn.":[37],"We":[38,62],"prove":[39],"that":[40,71],"if":[41],"X":[42,99,111],"has":[43,72],"both":[44],"positive":[45,115],"and":[46],"negative":[47],"it":[49,102],"is":[50,100,112],"NP-hard":[51],"to":[52,60,162],"compute":[53],"Sn":[54],"with":[55,124],"equal":[59],"$E^*_n$.":[61],"then":[63],"give":[64,120],"first":[66],"known":[67,161],"polynomial-time":[68],"approximation":[69,122,147],"algorithm":[70,81,123,138,148],"provably":[74],"small":[75],"arbitrary":[78],"X.":[79],"Our":[80],"incurs":[82],"at":[86,128,153],"most":[87,129,154],"$2(\\lceil\\log(n-1)\\rceil+1)E^*_n$.":[88],"(All":[89],"logarithms":[90],"log":[91,167],"in":[92,104,140,165],"this":[93,137],"paper":[94],"are":[95],"base":[96],"2.)":[97],"After":[98],"sorted,":[101],"runs":[103,139],"O(n)":[105,141],"time.":[106,142],"For":[107],"case":[109],"where":[110],"either":[113],"or":[116],"negative,":[118],"we":[119],"another":[121],"$\\lceil\\log\\log":[130],"n\\rceil":[131,156],"E^*_n$.":[132],"Even":[133],"unsorted":[135],"X,":[136],"Previously,":[143],"best":[145],"linear-time":[146],"had":[149],"$\\lceil\\log":[155],"E^*_n$,":[157],"while":[158],"was":[160],"be":[163],"attainable":[164],"O(n":[166],"n)":[168],"time":[169],"using":[170],"Huffman":[171],"coding.":[172]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}