{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:15Z","timestamp":1781078235311,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"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":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585207","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"103-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Discrete Sampling via Continuous Walks"],"prefix":"10.1145","author":[{"given":"Nima","family":"Anari","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yizhi","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thuy-Duong","family":"Vuong","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Xu","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katherine","family":"Yu","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403039"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451123"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Nima Anari Callum Burgess Kevin Tian and Thuy-Duong Vuong. 2022. Quadratic speedups in parallel sampling from determinantal distributions. ( 2022 ). arXiv:2203.11190 [cs.DS]. \t\t\t\t  Nima Anari Callum Burgess Kevin Tian and Thuy-Duong Vuong. 2022. Quadratic speedups in parallel sampling from determinantal distributions. ( 2022 ). arXiv:2203.11190 [cs.DS].","DOI":"10.1145\/3558481.3591104"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. Inform.","volume":"185","author":"Anari Nima","year":"2021","unstructured":"Nima Anari , Nathan Hu , Amin Saberi , and Aaron Schild . 2021 . Sampling arborescences in parallel. I1n2th Innovations in Theoretical Computer Science Conference. LIPIcs. Leibniz Int . Proc. Inform. Vol. 185 . Schloss Dagstuhl. LeibnizZent. Inform., Wadern, Art. No. 83, 18h.ttps:\/\/doi.org\/10.4230\/LIPIcs.ITCS. 202 1.83. 10.4230\/LIPIcs.ITCS Nima Anari, Nathan Hu, Amin Saberi, and Aaron Schild. 2021. Sampling arborescences in parallel. I1n2th Innovations in Theoretical Computer Science Conference. LIPIcs. Leibniz Int. Proc. Inform. Vol. 185. Schloss Dagstuhl. LeibnizZent. Inform., Wadern, Art. No. 83, 18h.ttps:\/\/doi.org\/10.4230\/LIPIcs.ITCS. 202 1.83."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520048"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808688"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00618-8"},{"key":"e_1_3_2_1_8_1","volume-title":"Coverings and delta-coverings. IInnteger programming and combinatorial optimization (Copenhagen","author":"Bouchet Andr\u00e9","year":"1995","unstructured":"Andr\u00e9 Bouchet . 1995. Coverings and delta-coverings. IInnteger programming and combinatorial optimization (Copenhagen , 1995 ). Lecture Notes in Comput. Sci. Vol. 920 . Springer , Berlin, 228-243 https:\/\/doi.org\/10.1007\/3-540-59408-6_54. 10.1007\/3-540-59408-6_54 Andr\u00e9 Bouchet. 1995. Coverings and delta-coverings. IInnteger programming and combinatorial optimization (Copenhagen, 1995 ). Lecture Notes in Comput. Sci. Vol. 920. Springer, Berlin, 228-243 https:\/\/doi.org\/10.1007\/3-540-59408-6_54."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2007.05.011"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX \/ANALCO 2005","author":"Graham","year":"2005","unstructured":"Graham R. Brightwell and Peter Winkler. 2005. Counting eulerian circuits is #p-complete . In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX \/ANALCO 2005 , Vancouver, BC, Canada , 22 January 2005 . Camil Demetrescu, Robert Sedgewick, and Roberto Tamassia, (Eds.) SIAM, 259-262. Graham R. Brightwell and Peter Winkler. 2005. Counting eulerian circuits is #p-complete. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX \/ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. Camil Demetrescu, Robert Sedgewick, and Roberto Tamassia, (Eds.) SIAM, 259-262."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63516"},{"key":"e_1_3_2_1_12_1","first-page":"716","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research). Jennifer Dy and Andreas Krause, (Eds.)","volume":"80","author":"Celis Elisa","year":"2018","unstructured":"Elisa Celis , Vijay Keswani , Damian Straszak , Amit Deshpande , Tarun Kathuria , and Nisheeth Vishnoi . 2018 . Fair and diverse DPP-based data summarization . In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research). Jennifer Dy and Andreas Krause, (Eds.) Vol. 80 . PMLR, (Oct. 2018 ), 716 - 725 . Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, and Nisheeth Vishnoi. 2018. Fair and diverse DPP-based data summarization. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research). Jennifer Dy and Andreas Krause, (Eds.) Vol. 80. PMLR, (Oct. 2018 ), 716-725."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90067-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00018"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205040"},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"34","article-title":"Determinantal point processes in randomized numerical linear algebrNao. tices","volume":"68","author":"Derezi\u0144ski Micha\u0142and Mahoney Michael W.","year":"2021","unstructured":"Michael W. Derezi\u0144ski Micha\u0142and Mahoney . 2021 . Determinantal point processes in randomized numerical linear algebrNao. tices Amer. Math. Soc. , 68 , 1 , 34 - 45 . https:\/\/doi.org\/10.1090\/noti220.2 Martin Dyer, Alan Frieze, and Ravi Kannan. 1991. A random polynomial-time algorithm for approximating the volume of convex bodiJe. sA. ssoc. Comput. Mach., 38, 1, 1-17. https:\/\/doi.org\/10.1145\/102782.102783. 10.1090\/noti220.2 Michael W. Derezi\u0144ski Micha\u0142and Mahoney. 2021. Determinantal point processes in randomized numerical linear algebrNao. tices Amer. Math. Soc., 68, 1, 34-45. https:\/\/doi.org\/10.1090\/noti220.2 Martin Dyer, Alan Frieze, and Ravi Kannan. 1991. A random polynomial-time algorithm for approximating the volume of convex bodiJe. sA. ssoc. Comput. Mach., 38, 1, 1-17. https:\/\/doi.org\/10.1145\/102782.102783.","journal-title":"Amer. Math. Soc."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2003.09.001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3180298"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00038"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-013-0214-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44479-6_16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2022.109392"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.127"},{"key":"e_1_3_2_1_25_1","volume-title":"H. Larochelle, A. Beygelz- imer, F. d' Alch\u00e9-Buc","author":"Gartrell Mike","unstructured":"Mike Gartrell , Victor-Emmanuel Brunel , Elvis Dohmatob , and Syrine Krichene . 2019. Learning nonsymmetric determinantal point processes. AIdnvances in Neural Information Processing Systems. H. Wallach , H. Larochelle, A. Beygelz- imer, F. d' Alch\u00e9-Buc , E. Fox, and R. Garnet, (Eds.) Vol. 32 . Curran Associates, Inc. Mike Gartrell, Victor-Emmanuel Brunel, Elvis Dohmatob, and Syrine Krichene. 2019. Learning nonsymmetric determinantal point processes. AIdnvances in Neural Information Processing Systems. H. Wallach, H. Larochelle, A. Beygelz- imer, F. d' Alch\u00e9-Buc, E. Fox, and R. Garnet, (Eds.) Vol. 32. Curran Associates, Inc."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9463-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1214\/22-aap1847"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703953"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000044"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519999"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548313000345"},{"key":"e_1_3_2_1_34_1","volume-title":"H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc","author":"Shen Ruoqi","unstructured":"Ruoqi Shen and Yin Tat Lee . 2019. The randomized midpoint method for logconcave sampling. InAdvances in Neural Information Processing Systems. H. Wallach , H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc , E. Fox, and R. Garnet, (Eds.) Vol. 32 . Curran Associates, Inc. Ruoqi Shen and Yin Tat Lee. 2019. The randomized midpoint method for logconcave sampling. InAdvances in Neural Information Processing Systems. H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnet, (Eds.) Vol. 32. Curran Associates, Inc."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786436108243366"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00289-U"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.2307\/2302716"},{"key":"e_1_3_2_1_38_1","unstructured":"T. van Aardenne-Ehrenfest and N. G. de Bruijn. 1951. Circuits and trees in oriented linear graphSsi. mon Stevin 28 203-217. \t\t\t\t  T. van Aardenne-Ehrenfest and N. G. de Bruijn. 1951. Circuits and trees in oriented linear graphSsi. mon Stevin 28 203-217."}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":38,"alternative-id":["10.1145\/3564246.3585207","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585207","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}