{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T05:52:25Z","timestamp":1762321945968,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20121-0011"],"award-info":[{"award-number":["MOE-T2EP20121-0011"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFFAI1-2019-0004"],"award-info":[{"award-number":["NRF-NRFFAI1-2019-0004"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533338","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing"],"prefix":"10.1145","author":[{"given":"Remi","family":"Delannoy","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51825-7_18"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2885"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129781"},{"key":"e_1_3_2_1_4_1","first-page":"112","volume-title":"Proceedings of the ninth annual ACM symposium on Theory of computing","author":"Carter J\u00a0Lawrence","unstructured":"[ 4 ] J\u00a0Lawrence Carter and Mark\u00a0 N Wegman . Universal classes of hash functions . In Proceedings of the ninth annual ACM symposium on Theory of computing , pages 106\u2013 112 . ACM, 1977. [4] J\u00a0Lawrence Carter and Mark\u00a0N Wegman. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106\u2013112. ACM, 1977."},{"key":"e_1_3_2_1_5_1","first-page":"1730","volume-title":"Proc. of AAAI","author":"Fremont J.","year":"2014","unstructured":"[ 5 ] S.\u00a0Chakraborty, D.\u00a0 J. Fremont , K.\u00a0 S. Meel , S.\u00a0 A. Seshia , and M.\u00a0 Y. Vardi . Distribution-aware sampling and weighted model counting for SAT . In Proc. of AAAI , pages 1722\u2013 1730 , 2014 . [5] S.\u00a0Chakraborty, D.\u00a0J. Fremont, K.\u00a0S. Meel, S.\u00a0A. Seshia, and M.\u00a0Y. Vardi. Distribution-aware sampling and weighted model counting for SAT. In Proc. of AAAI, pages 1722\u20131730, 2014."},{"key":"e_1_3_2_1_6_1","first-page":"623","volume-title":"Proc. of CAV","author":"Meel S.","year":"2013","unstructured":"[ 6 ] S.\u00a0Chakraborty, K.\u00a0 S. Meel , and M.\u00a0 Y. Vardi . A scalable and nearly uniform generator of SAT witnesses . In Proc. of CAV , pages 608\u2013 623 , 2013 . [6] S.\u00a0Chakraborty, K.\u00a0S. Meel, and M.\u00a0Y. Vardi. A scalable and nearly uniform generator of SAT witnesses. In Proc. of CAV, pages 608\u2013623, 2013."},{"key":"e_1_3_2_1_7_1","first-page":"216","volume-title":"Proc. of CP","author":"Meel S.","year":"2013","unstructured":"[ 7 ] S.\u00a0Chakraborty, K.\u00a0 S. Meel , and M.\u00a0 Y. Vardi . A scalable approximate model counter . In Proc. of CP , pages 200\u2013 216 , 2013 . [7] S.\u00a0Chakraborty, K.\u00a0S. Meel, and M.\u00a0Y. Vardi. A scalable approximate model counter. In Proc. of CP, pages 200\u2013216, 2013."},{"key":"e_1_3_2_1_8_1","first-page":"6","volume-title":"Proc. of DAC","author":"Meel S.","year":"2014","unstructured":"[ 8 ] S.\u00a0Chakraborty, K.\u00a0 S. Meel , and M.\u00a0 Y. Vardi . Balancing scalability and uniformity in SAT witness generator . In Proc. of DAC , pages 1\u2013 6 , 2014 . [8] S.\u00a0Chakraborty, K.\u00a0S. Meel, and M.\u00a0Y. Vardi. Balancing scalability and uniformity in SAT witness generator. In Proc. of DAC, pages 1\u20136, 2014."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of IJCAI","author":"Meel S.","year":"2016","unstructured":"[ 9 ] S.\u00a0Chakraborty, K.\u00a0 S. Meel , and M.\u00a0 Y. Vardi . Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls . In Proc. of IJCAI , 2016 . [9] S.\u00a0Chakraborty, K.\u00a0S. Meel, and M.\u00a0Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Proc. of IJCAI, 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/11534.11537"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"e_1_3_2_1_12_1","first-page":"354","volume-title":"International Symposium on Mathematical Foundations of Computer Science","author":"Markowsky George","unstructured":"[ 12 ] George Markowsky , J\u00a0Lawrence Carter , and Mark\u00a0 N Wegman . Analysis of a universal class of hash functions . In International Symposium on Mathematical Foundations of Computer Science , pages 345\u2013 354 . Springer, 1978. [12] George Markowsky, J\u00a0Lawrence Carter, and Mark\u00a0N Wegman. Analysis of a universal class of hash functions. In International Symposium on Mathematical Foundations of Computer Science, pages 345\u2013354. Springer, 1978."},{"key":"e_1_3_2_1_13_1","first-page":"276","volume-title":"Conference on Computability in Europe","author":"Marques-Silva Joao","unstructured":"[ 13 ] Joao Marques-Silva . Computing with sat oracles: Past, present and future . In Conference on Computability in Europe , pages 264\u2013 276 . Springer, 2018. [13] Joao Marques-Silva. Computing with sat oracles: Past, present and future. In Conference on Computability in Europe, pages 264\u2013276. Springer, 2018."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of Logic in Computer science (LICS), 7","author":"Akshay S. Meel","year":"2020","unstructured":"[ 14 ] Kuldeep\u00a0 S. Meel r S.\u00a0 Akshay . Sparse hashing for scalable approximate model counting: Theory and practice . In Proceedings of Logic in Computer science (LICS), 7 2020 . [14] Kuldeep\u00a0S. Meel r S.\u00a0Akshay. Sparse hashing for scalable approximate model counting: Theory and practice. In Proceedings of Logic in Computer science (LICS), 7 2020."},{"key":"e_1_3_2_1_15_1","first-page":"1727","volume-title":"Proc of IAAI","year":"2006","unstructured":"[ 15 ] Y.\u00a0Naveh, M.\u00a0Rimon, I.\u00a0Jaeger, Y.\u00a0Katz, M.\u00a0Vinov, E.\u00a0Marcus, and G.\u00a0Shurek. Constraint-based random stimuli generation for hardware verification . In Proc of IAAI , pages 1720\u2013 1727 , 2006 . [15] Y.\u00a0Naveh, M.\u00a0Rimon, I.\u00a0Jaeger, Y.\u00a0Katz, M.\u00a0Vinov, E.\u00a0Marcus, and G.\u00a0Shurek. Constraint-based random stimuli generation for hardware verification. In Proc of IAAI, pages 1720\u20131727, 2006."},{"key":"e_1_3_2_1_16_1","volume-title":"The power of simple tabulation hashing. Journal of the ACM (JACM), 59(3):1\u201350","author":"P\u01cetra\u015fcu Mihai","year":"2012","unstructured":"[ 16 ] Mihai P\u01cetra\u015fcu and Mikkel Thorup . The power of simple tabulation hashing. Journal of the ACM (JACM), 59(3):1\u201350 , 2012 . [16] Mihai P\u01cetra\u015fcu and Mikkel Thorup. The power of simple tabulation hashing. Journal of the ACM (JACM), 59(3):1\u201350, 2012."},{"key":"e_1_3_2_1_17_1","volume-title":"Titus: Sampling and summarizing transmission trees with muti-strain infections. bioRxiv","author":"Sashittal Palash","year":"2020","unstructured":"[ 17 ] Palash Sashittal and Mohammed El-Kebir . Titus: Sampling and summarizing transmission trees with muti-strain infections. bioRxiv , 2020 . [17] Palash Sashittal and Mohammed El-Kebir. Titus: Sampling and summarizing transmission trees with muti-strain infections. bioRxiv, 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"volume-title":"Proc","year":"2009","key":"e_1_3_2_1_19_1","unstructured":"[ 19 ] M.\u00a0Soos, K.\u00a0Nohl, and C.\u00a0Castelluccia. Extending SAT Solvers to Cryptographic Problems . In Proc . of SAT. Springer-Verlag , 2009 . [19] M.\u00a0Soos, K.\u00a0Nohl, and C.\u00a0Castelluccia. Extending SAT Solvers to Cryptographic Problems. In Proc. of SAT. Springer-Verlag, 2009."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808740"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":21,"alternative-id":["10.1145\/3531130.3533338","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533338","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}