{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:20Z","timestamp":1750221080759,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"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":[[2018,11]]},"DOI":"10.1145\/3243176.3243193","type":"proceedings-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T13:32:32Z","timestamp":1539178352000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["M\n            <scp>emo<\/scp>\n            D\n            <scp>yn<\/scp>"],"prefix":"10.1145","author":[{"given":"Prakash","family":"Prabhu","sequence":"first","affiliation":[{"name":"Google India and Princeton University"}]},{"given":"Stephen R.","family":"Beard","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Sotiris","family":"Apostolakis","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Ayal","family":"Zaks","sequence":"additional","affiliation":[{"name":"Intel Corporation, Haifa, Israel"}]},{"given":"David I.","family":"August","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2018,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.546611"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1787234.1787255"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/384197.384229"},{"key":"e_1_3_2_1_4_1","volume-title":"IEEE International Conference on. IEEE, 1--8.","author":"Agrawal Ankur","year":"2016","unstructured":"Ankur Agrawal , Jungwook Choi , Kailash Gopalakrishnan , Suyog Gupta , Ravi Nair , Jinwook Oh , Daniel A Prener , Sunil Shukla , Vijayalakshmi Srinivasan , and Zehra Sura . 2016 . Approximate computing: Challenges and opportunities. In Rebooting Computing (ICRC) , IEEE International Conference on. IEEE, 1--8. Ankur Agrawal, Jungwook Choi, Kailash Gopalakrishnan, Suyog Gupta, Ravi Nair, Jinwook Oh, Daniel A Prener, Sunil Shukla, Vijayalakshmi Srinivasan, and Zehra Sura. 2016. Approximate computing: Challenges and opportunities. In Rebooting Computing (ICRC), IEEE International Conference on. IEEE, 1--8."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.821450"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375591"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.35"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01018692"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048109"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2016604.2016638"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814290"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950376"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133956.1133974"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998582.1998587"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing, Enrico Giunchiglia and Armando Tacchella (Eds.)","author":"E\u00e9n Niklas","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . 2004. An Extensible SAT-Solver . In Theory and Applications of Satisfiability Testing, Enrico Giunchiglia and Armando Tacchella (Eds.) . Lecture Notes in Computer Science , Vol. 2919 . Springer Berlin \/ Heidelberg , 333--336. Niklas E\u00e9n and Niklas S\u00f6rensson. 2004. An Extensible SAT-Solver. In Theory and Applications of Satisfiability Testing, Enrico Giunchiglia and Armando Tacchella (Eds.). Lecture Notes in Computer Science, Vol. 2919. Springer Berlin \/ Heidelberg, 333--336."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837615"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"PMSat: A Parallel Version of MiniSAT","volume":"6","author":"Gil Lu\u00eds","year":"2009","unstructured":"Lu\u00eds Gil , Paulo F. Flores , and Luis Miguel Silveira . 2009 . PMSat: A Parallel Version of MiniSAT . JSAT 6 , 1 -- 3 (2009), 71--98. Lu\u00eds Gil, Paulo F. Flores, and Luis Miguel Silveira. 2009. PMSat: A Parallel Version of MiniSAT. JSAT 6, 1--3 (2009), 71--98.","journal-title":"JSAT"},{"key":"e_1_3_2_1_19_1","unstructured":"Harm Gunnar. 2011. Bobcat. http:\/\/github.com\/Bobcat\/bobcat.  Harm Gunnar. 2011. Bobcat. http:\/\/github.com\/Bobcat\/bobcat."},{"key":"e_1_3_2_1_20_1","first-page":"245","article-title":"ManySAT","volume":"6","author":"Hamadi Youssef","year":"2009","unstructured":"Youssef Hamadi , Sa\u00efd Jabbour , and Lakhdar Sais . 2009 . ManySAT : A Parallel SAT Solver. JSAT 6 , 4 (2009), 245 -- 262 . Youssef Hamadi, Sa\u00efd Jabbour, and Lakhdar Sais. 2009. ManySAT: A Parallel SAT Solver. JSAT 6, 4 (2009), 245--262.","journal-title":"A Parallel SAT Solver. JSAT"},{"volume-title":"HPEC 2005 Workshop.","author":"Haney R.","key":"e_1_3_2_1_21_1","unstructured":"R. Haney , T. Meuse , J. Kepner , and J. Lebak . 2005. The HPEC challenge benchmark suite . In HPEC 2005 Workshop. R. Haney, T. Meuse, J. Kepner, and J. Lebak. 2005. The HPEC challenge benchmark suite. In HPEC 2005 Workshop."},{"volume-title":"A practical theory of programming","author":"Hehner E.C.R.","key":"e_1_3_2_1_22_1","unstructured":"E.C.R. Hehner . 1993. A practical theory of programming . Springer . E.C.R. Hehner. 1993. A practical theory of programming. Springer."},{"key":"e_1_3_2_1_23_1","volume-title":"Making large-Scale SVM Learning Practical. Advances in Kernel Methods Support Vector Learning","author":"Joachims T","year":"1999","unstructured":"T Joachims . 1999. Making large-Scale SVM Learning Practical. Advances in Kernel Methods Support Vector Learning ( 1999 ), 169--184. http:\/\/www-ai.cs.uni-dortmund.de\/DOKUMENTE\/joachims_99a.ps.gz T Joachims. 1999. Making large-Scale SVM Learning Practical. Advances in Kernel Methods Support Vector Learning (1999), 169--184. http:\/\/www-ai.cs.uni-dortmund.de\/DOKUMENTE\/joachims_99a.ps.gz"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/165854.165874"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009850"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190091"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_28_1","volume-title":"LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO '04: Proceedings of the International Symposium on Code Generation and Optimization. IEEE Computer Society","author":"Lattner Chris","year":"2004","unstructured":"Chris Lattner and Vikram Adve . 2004 . LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO '04: Proceedings of the International Symposium on Code Generation and Optimization. IEEE Computer Society , Washington, DC, USA, 75. Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO '04: Proceedings of the International Symposium on Code Generation and Optimization. IEEE Computer Society, Washington, DC, USA, 75."},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Optimization - Eureka, You Shrink!, Michael J\u00fcnger, Gerhard Reinelt, and Giovanni Rinaldi (Eds.)","author":"Letchford Adam","unstructured":"Adam Letchford and Andrea Lodi . 2003. An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming . In Combinatorial Optimization - Eureka, You Shrink!, Michael J\u00fcnger, Gerhard Reinelt, and Giovanni Rinaldi (Eds.) . Lecture Notes in Computer Science , Vol. 2570 . Springer Berlin \/ Heidelberg , 119--133. Adam Letchford and Andrea Lodi. 2003. An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. In Combinatorial Optimization - Eureka, You Shrink!, Michael J\u00fcnger, Gerhard Reinelt, and Giovanni Rinaldi (Eds.). Lecture Notes in Computer Science, Vol. 2570. Springer Berlin \/ Heidelberg, 119--133."},{"key":"e_1_3_2_1_30_1","unstructured":"S. Luke. 2010. Essentials of Metaheuristics.  S. Luke. 2010. Essentials of Metaheuristics."},{"key":"e_1_3_2_1_31_1","volume-title":"Memo Functions and Machine Learning. Nature 218, 5136","author":"Michie Donald","year":"1968","unstructured":"Donald Michie . 1968. Memo Functions and Machine Learning. Nature 218, 5136 ( 1968 ), 19--22. Donald Michie. 1968. Memo Functions and Machine Learning. Nature 218, 5136 (1968), 19--22."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2983997"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254082"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Lawrence Rauchwerger Francisco Arzu and Koji Ouchi. 1998. Standard Templates Adaptive Parallel Library (STAPL). In LCR. 402--409.   Lawrence Rauchwerger Francisco Arzu and Koji Ouchi. 1998. Standard Templates Adaptive Parallel Library (STAPL). In LCR . 402--409.","DOI":"10.1007\/3-540-49530-4_32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414737"},{"volume-title":"Presented as part of the 5th USENIX Workshop on Hot Topics in Parallelism","author":"Rinard Martin","key":"e_1_3_2_1_36_1","unstructured":"Martin Rinard . 2013. Parallel Synchronization-Free Approximate Data Structure Construction . In Presented as part of the 5th USENIX Workshop on Hot Topics in Parallelism . USENIX , San Jose, CA . https:\/\/www.usenix.org\/conference\/hotpar13\/workshop-program\/presentation\/Rinard Martin Rinard. 2013. Parallel Synchronization-Free Approximate Data Structure Construction. In Presented as part of the 5th USENIX Workshop on Hot Topics in Parallelism. USENIX, San Jose, CA. https:\/\/www.usenix.org\/conference\/hotpar13\/workshop-program\/presentation\/Rinard"},{"key":"e_1_3_2_1_38_1","volume-title":"Unsynchronized Techniques for Approximate Parallel Computing. RACES","author":"Rinard Martin C","year":"2012","unstructured":"Martin C Rinard . 2012. Unsynchronized Techniques for Approximate Parallel Computing. RACES ( 2012 ). Martin C Rinard. 2012. Unsynchronized Techniques for Approximate Parallel Computing. RACES (2012)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/641909.641911"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254102"},{"key":"e_1_3_2_1_41_1","first-page":"59","article-title":"A chess program that uses transposition table to learn from experience","volume":"10","author":"Slate D.J.","year":"1987","unstructured":"D.J. Slate . 1987 . A chess program that uses transposition table to learn from experience . International Computer Chess Association Journal 10 , 2 (1987), 59 -- 71 . D.J. Slate. 1987. A chess program that uses transposition table to learn from experience. International Computer Chess Association Journal 10, 2 (1987), 59--71.","journal-title":"International Computer Chess Association Journal"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_66"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.52"},{"volume-title":"Parallel combinatorial optimization","author":"Talbi E.G.","key":"e_1_3_2_1_44_1","unstructured":"E.G. Talbi . 2006. Parallel combinatorial optimization . Vol. 58 . Wiley-Blackwell . E.G. Talbi. 2006. Parallel combinatorial optimization. Vol. 58. Wiley-Blackwell."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000417.2000418"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993555"},{"key":"e_1_3_2_1_47_1","volume-title":"Principles and Practice of Constraint Programming - CP","author":"Zhang Weixiong","year":"2001","unstructured":"Weixiong Zhang . 2001. Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT . In Principles and Practice of Constraint Programming - CP 2001 , Toby Walsh (Ed.). Lecture Notes in Computer Science, Vol. 2239 . Springer Berlin \/ Heidelberg , 153--167. Weixiong Zhang. 2001. Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. In Principles and Practice of Constraint Programming - CP 2001, Toby Walsh (Ed.). Lecture Notes in Computer Science, Vol. 2239. Springer Berlin \/ Heidelberg, 153--167."}],"event":{"name":"PACT '18: International conference on Parallel Architectures and Compilation Techniques","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IFIP WG 10.3 IFIP WG 10.3","IEEE CS"],"location":"Limassol Cyprus","acronym":"PACT '18"},"container-title":["Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243176.3243193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:39Z","timestamp":1750208259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243193"}},"subtitle":["exploiting weakly consistent data structures for dynamic parallel memoization"],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":46,"alternative-id":["10.1145\/3243176.3243193","10.1145\/3243176"],"URL":"https:\/\/doi.org\/10.1145\/3243176.3243193","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]},"assertion":[{"value":"2018-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}