{"id":"https://openalex.org/W2155963553","doi":"https://doi.org/10.1145/1837210.1837229","title":"Accuracy versus time","display_name":"Accuracy versus time","publication_year":2010,"publication_date":"2010-07-21","ids":{"openalex":"https://openalex.org/W2155963553","doi":"https://doi.org/10.1145/1837210.1837229","mag":"2155963553"},"language":"en","primary_location":{"id":"doi:10.1145/1837210.1837229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837210.1837229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Workshop on Parallel and Symbolic Computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00477511","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065230076","display_name":"Philippe Langlois","orcid":null},"institutions":[{"id":"https://openalex.org/I151295451","display_name":"Universit\u00e9 de Perpignan","ror":"https://ror.org/03am2jy38","country_code":"FR","type":"education","lineage":["https://openalex.org/I151295451"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Philippe Langlois","raw_affiliation_strings":["Universit\u00e9 de Perpignan, Perpignan, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Perpignan, Perpignan, France","institution_ids":["https://openalex.org/I151295451"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057608137","display_name":"Matthieu Martel","orcid":"https://orcid.org/0000-0002-6238-9651"},"institutions":[{"id":"https://openalex.org/I151295451","display_name":"Universit\u00e9 de Perpignan","ror":"https://ror.org/03am2jy38","country_code":"FR","type":"education","lineage":["https://openalex.org/I151295451"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matthieu Martel","raw_affiliation_strings":["Universit\u00e9 de Perpignan, Perpignan, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Perpignan, Perpignan, France","institution_ids":["https://openalex.org/I151295451"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000967928","display_name":"Laurent Th\u00e9venoux","orcid":null},"institutions":[{"id":"https://openalex.org/I151295451","display_name":"Universit\u00e9 de Perpignan","ror":"https://ror.org/03am2jy38","country_code":"FR","type":"education","lineage":["https://openalex.org/I151295451"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Th\u00e9venoux","raw_affiliation_strings":["Universit\u00e9 de Perpignan, Perpignan, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Perpignan, Perpignan, France","institution_ids":["https://openalex.org/I151295451"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065230076"],"corresponding_institution_ids":["https://openalex.org/I151295451"],"apc_list":null,"apc_paid":null,"fwci":1.7239,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85314164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"121","last_page":"130"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9921000003814697,"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.9868999719619751,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.7794597148895264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7308631539344788},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6864109039306641},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6385011672973633},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.6055737733840942},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5921717286109924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.212406188249588},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19039392471313477}],"concepts":[{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.7794597148895264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7308631539344788},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6864109039306641},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6385011672973633},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.6055737733840942},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5921717286109924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.212406188249588},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19039392471313477},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1837210.1837229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837210.1837229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Workshop on Parallel and Symbolic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00477511v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00477511","pdf_url":null,"source":{"id":"https://openalex.org/S4406922276","display_name":"INRIA a CCSD electronic archive server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PASCO'10 : Parallel Symbolic Computation 2010, Jul 2010, Grenoble, France. pp.121-130, &#x27E8;10.1145/1837210.1837229&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00477511v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00477511","pdf_url":null,"source":{"id":"https://openalex.org/S4406922276","display_name":"INRIA a CCSD electronic archive server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PASCO'10 : Parallel Symbolic Computation 2010, Jul 2010, Grenoble, France. pp.121-130, &#x27E8;10.1145/1837210.1837229&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501718237","https://openalex.org/W1565290193","https://openalex.org/W1968165559","https://openalex.org/W1971947347","https://openalex.org/W1981663184","https://openalex.org/W2002064155","https://openalex.org/W2020804487","https://openalex.org/W2033118822","https://openalex.org/W2041844083","https://openalex.org/W2053987390","https://openalex.org/W2070160710","https://openalex.org/W2072118759","https://openalex.org/W2078207501","https://openalex.org/W2102535837","https://openalex.org/W2155673213","https://openalex.org/W2160210898","https://openalex.org/W2752853835","https://openalex.org/W2911265074","https://openalex.org/W4299637698"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2045183646","https://openalex.org/W2162409446","https://openalex.org/W2109463584","https://openalex.org/W2504075107","https://openalex.org/W1492794944","https://openalex.org/W2354058185","https://openalex.org/W2012531322","https://openalex.org/W2402761219"],"abstract_inverted_index":{"In":[0,19],"this":[1,34],"article,":[2],"we":[3,52,70],"focus":[4],"on":[5,43],"numerical":[6],"algorithms":[7,45,56,100],"for":[8,81],"which,":[9],"in":[10,41,47],"practice,":[11],"parallelism":[12],"and":[13,33,46,62],"accuracy":[14],"do":[15],"not":[16],"cohabit":[17],"well.":[18],"order":[20],"to":[21,58,114],"increase":[22],"parallelism,":[23],"expressions":[24],"are":[25,104],"reparsed,":[26],"implicitly":[27],"using":[28],"mathematical":[29],"laws":[30],"like":[31],"associativity,":[32],"reduces":[35],"the":[36,55,59,72,95,109,117],"accuracy.":[37,118],"Our":[38,87],"approach":[39],"consists":[40],"focusing":[42],"summation":[44],"performing":[48],"an":[49],"exhaustive":[50],"study:":[51],"generate":[53],"all":[54],"equivalent":[57],"original":[60],"one":[61],"compatible":[63],"with":[64],"our":[65],"relaxed":[66],"time":[67,96],"constraint.":[68],"Next":[69],"compute":[71],"worst":[73],"errors":[74],"which":[75],"may":[76],"arise":[77],"during":[78],"their":[79],"evaluation,":[80],"several":[82],"relevant":[83],"sets":[84],"of":[85],"data.":[86],"main":[88],"conclusion":[89],"is":[90],"that":[91],"relaxing":[92],"very":[93],"slightly":[94],"constraints":[97],"by":[98],"choosing":[99],"whose":[101],"critical":[102],"paths":[103],"a":[105],"bit":[106],"longer":[107],"than":[108],"optimal":[110],"makes":[111],"it":[112],"possible":[113],"strongly":[115],"optimize":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
