{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:21Z","timestamp":1750307001367,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,7]]},"DOI":"10.1145\/2331684.2331711","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T14:38:27Z","timestamp":1342708707000},"page":"165-167","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Refining and verifying the solution of a linear system"],"prefix":"10.1145","author":[{"given":"Hong Diep","family":"Nguyen","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Revol","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141885.1141894"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459082"},{"volume-title":"SIAM","year":"2002","author":"Higham N. J.","key":"e_1_3_2_1_3_1"},{"volume-title":"Cambridge University Press","year":"1990","author":"Neumaier A.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009997221089"},{"key":"e_1_3_2_1_6_1","unstructured":"H. D. Nguyen. Efficient algorithms for verified scientific computing: numerical linear algebra using interval arithmetic. PhD Thesis \u00c9cole Normale Sup\u00e9rieure de Lyon Jan. 2011. http:\/\/perso.ens-lyon.fr\/hong.diep.nguyen\/  H. D. Nguyen. Efficient algorithms for verified scientific computing: numerical linear algebra using interval arithmetic . PhD Thesis \u00c9cole Normale Sup\u00e9rieure de Lyon Jan. 2011. http:\/\/perso.ens-lyon.fr\/hong.diep.nguyen\/"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-010-9389-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02307386"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1247-7_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03186534"}],"event":{"name":"ISSAC '11: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"San Jose California","acronym":"ISSAC '11"},"container-title":["Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331684.2331711","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2331684.2331711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:50Z","timestamp":1750236530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331684.2331711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":10,"alternative-id":["10.1145\/2331684.2331711","10.1145\/2331684"],"URL":"https:\/\/doi.org\/10.1145\/2331684.2331711","relation":{},"subject":[],"published":{"date-parts":[[2012,6,7]]},"assertion":[{"value":"2012-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}