{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:46:58Z","timestamp":1750308418262,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Campbs France","award":["PHC GRAPE"],"award-info":[{"award-number":["PHC GRAPE"]}]},{"name":"Agence nationale de la recherche","award":["ANR JCJC GALOP (ANR-17-CE40-0009)"],"award-info":[{"award-number":["ANR JCJC GALOP (ANR-17-CE40-0009)"]}]},{"name":"Fondation Math\u00e9matique Jacques Hadamard","award":["PGMO grant ALMA"],"award-info":[{"award-number":["PGMO grant ALMA"]}]},{"name":"Fondation Sciences Math\u00e9matiques de Paris"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,4]]},"DOI":"10.1145\/3476446.3536190","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T13:16:01Z","timestamp":1657026961000},"page":"273-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Error of Random Sampling"],"prefix":"10.1145","author":[{"given":"Apostolos","family":"Chalkis","sequence":"first","affiliation":[{"name":"GeomScale org, Athens, Greece"}]},{"given":"Christina","family":"Katsamaki","sequence":"additional","affiliation":[{"name":"Inria Paris & IMJ-PRG, Paris, France"}]},{"given":"Josu\u00e9","family":"Tonelli-Cueto","sequence":"additional","affiliation":[{"name":"Inria Paris & IMJ-PRG, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"volume-title":"Complexity and real computation","author":"Blum Lenore","key":"e_1_3_2_1_1_1","unstructured":"Lenore Blum , Felipe Cucker , Michael Shub , and Steve Smale . 1998. Complexity and real computation . Springer-Verlag , New York . xvi+453 pages. https:\/\/doi.org\/10.1007\/978--1--4612-0701--6 With a foreword by Richard M. Karp. 10.1007\/978--1--4612-0701--6 Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. 1998. Complexity and real computation. Springer-Verlag, New York. xvi+453 pages. https:\/\/doi.org\/10.1007\/978--1--4612-0701--6 With a foreword by Richard M. Karp."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13163-018-0273-6"},{"key":"e_1_3_2_1_3_1","volume-title":"Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. In APPROX\/ RANDOM 2019 (LIPIcs","volume":"12","author":"Chen Zongchen","year":"2019","unstructured":"Zongchen Chen and Santosh S. Vempala . 2019 . Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. In APPROX\/ RANDOM 2019 (LIPIcs , Vol. 145), Dimitris Achlioptas and L\u00b4aszl\u00b4o A. V\u00b4egh (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, Wadern, Germany, 64:1--64: 12 . https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM. 2019 .64 10.4230\/LIPIcs.APPROX-RANDOM.2019.64 Zongchen Chen and Santosh S. Vempala. 2019. Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. In APPROX\/ RANDOM 2019 (LIPIcs, Vol. 145), Dimitris Achlioptas and L\u00b4aszl\u00b4o A. V\u00b4egh (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, Wadern, Germany, 64:1--64:12. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.64"},{"key":"e_1_3_2_1_4_1","volume-title":"Understanding the metropolishastings algorithm. The american statistician 49, 4","author":"Chib Siddhartha","year":"1995","unstructured":"Siddhartha Chib and Edward Greenberg . 1995. Understanding the metropolishastings algorithm. The american statistician 49, 4 ( 1995 ), 327--335. https:\/\/doi.org\/10.1080\/00031305.1995.10476177 10.1080\/00031305.1995.10476177 Siddhartha Chib and Edward Greenberg. 1995. Understanding the metropolishastings algorithm. The american statistician 49, 4 (1995), 327--335. https:\/\/doi.org\/10.1080\/00031305.1995.10476177"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","volume":"20","author":"Dwivedi Raaz","year":"2019","unstructured":"Raaz Dwivedi , Yuansi Chen , Martin J Wainwright , and Bin Yu . 2019 . Log-concave sampling: Metropolis-Hastings algorithms are fast . Journal of Machine Learning Research 20 , 183 (2019), 1 -- 42 . Raaz Dwivedi, Yuansi Chen, Martin JWainwright, and Bin Yu. 2019. Log-concave sampling: Metropolis-Hastings algorithms are fast. Journal of Machine Learning Research 20, 183 (2019), 1--42.","journal-title":"Journal of Machine Learning Research"},{"volume-title":"Graphics Gems V","author":"de Figueiredo Luiz Henrique","key":"e_1_3_2_1_6_1","unstructured":"Luiz Henrique de Figueiredo . 1995. IV.4 - Adaptive Sampling of Parametric Curves . In Graphics Gems V , Alan W. Paeth (Ed.). Academic Press , Boston , 173--178. https:\/\/doi.org\/10.1016\/B978-0--12--543457--7.50032--2 10.1016\/B978-0--12--543457--7.50032--2 Luiz Henrique de Figueiredo. 1995. IV.4 - Adaptive Sampling of Parametric Curves. In Graphics Gems V, Alan W. Paeth (Ed.). Academic Press, Boston, 173--178. https:\/\/doi.org\/10.1016\/B978-0--12--543457--7.50032--2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2005.10.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-007-9095-1"},{"key":"e_1_3_2_1_9_1","unstructured":"L. Fox and I. B. Parker. 1968. Chebyshev polynomials in numerical analysis. Oxford University Press London-New York-Toronto Ont. ix+205 pages.  L. Fox and I. B. Parker. 1968. Chebyshev polynomials in numerical analysis. Oxford University Press London-New York-Toronto Ont. ix+205 pages."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/2347565"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00054-2"},{"key":"e_1_3_2_1_12_1","volume-title":"Fast mixing of metropolis-hastings with unimodal targets. Electronic Communications in Probability 23, none","author":"Johndrow James","year":"2018","unstructured":"James Johndrow and Aaron Smith . 2018. Fast mixing of metropolis-hastings with unimodal targets. Electronic Communications in Probability 23, none ( 2018 ), 1 -- 9. https:\/\/doi.org\/10.1214\/18-ECP170 10.1214\/18-ECP170 James Johndrow and Aaron Smith. 2018. Fast mixing of metropolis-hastings with unimodal targets. Electronic Communications in Probability 23, none (2018), 1 -- 9. https:\/\/doi.org\/10.1214\/18-ECP170"},{"key":"#cr-split#-e_1_3_2_1_13_1.1","doi-asserted-by":"crossref","unstructured":"Ravi Kannan and Santosh Vempala. 1997. Sampling Lattice Points. 5 pages. https:\/\/doi.org\/10.1145\/258533.258665 10.1145\/258533.258665","DOI":"10.1145\/258533.258665"},{"key":"#cr-split#-e_1_3_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"Ravi Kannan and Santosh Vempala. 1997. Sampling Lattice Points. 5 pages. https:\/\/doi.org\/10.1145\/258533.258665","DOI":"10.1145\/258533.258665"},{"key":"e_1_3_2_1_14_1","unstructured":"Yin Tat Lee Zhao Song and Santosh S Vempala. 2018. Algorithmic theory of ODEs and sampling from well-conditioned log-concave densities. arXiv:1812.06243.  Yin Tat Lee Zhao Song and Santosh S Vempala. 2018. Algorithmic theory of ODEs and sampling from well-conditioned log-concave densities. arXiv:1812.06243."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/290274.290287"},{"key":"e_1_3_2_1_16_1","volume-title":"Integration and Optimization. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)","author":"Lovasz Laszlo","year":"2006","unstructured":"Laszlo Lovasz and Santosh Vempala . 2006 . Fast Algorithms for Logconcave Functions: Sampling, Rounding , Integration and Optimization. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) . IEEE, Berkeley, CA, USA, 57--68. https:\/\/doi.org\/10.1109\/FOCS. 2006.28 10.1109\/FOCS.2006.28 Laszlo Lovasz and Santosh Vempala. 2006. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE, Berkeley, CA, USA, 57--68. https:\/\/doi.org\/10.1109\/FOCS.2006.28"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the Thirty-Second Conference on Learning Theory (Proceedings of Machine Learning Research","volume":"2293","author":"Mangoubi Oren","year":"2019","unstructured":"Oren Mangoubi and Nisheeth K Vishnoi . 2019 . Nonconvex sampling with the Metropolis-adjusted Langevin algorithm . In Proceedings of the Thirty-Second Conference on Learning Theory (Proceedings of Machine Learning Research , Vol. 99), Alina Beygelzimer and Daniel Hsu (Eds.). PMLR, Phoenix, USA, 2259-- 2293 . https:\/\/proceedings.mlr.press\/v99\/mangoubi19a.html Oren Mangoubi and Nisheeth K Vishnoi. 2019. Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. In Proceedings of the Thirty-Second Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 99), Alina Beygelzimer and Daniel Hsu (Eds.). PMLR, Phoenix, USA, 2259--2293. https:\/\/proceedings.mlr.press\/v99\/mangoubi19a.html"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"J. C. Mason and D. C. Handscomb. 2003. Chebyshev polynomials. Chapman & Hall\/CRC Boca Raton FL. xiv+341 pages.  J. C. Mason and D. C. Handscomb. 2003. Chebyshev polynomials. Chapman & Hall\/CRC Boca Raton FL. xiv+341 pages.","DOI":"10.1201\/9781420036114"},{"key":"e_1_3_2_1_20_1","volume-title":"Slice sampling. Ann. Statist. 31, 3 (06","author":"Neal Radford M.","year":"2003","unstructured":"Radford M. Neal . 2003. Slice sampling. Ann. Statist. 31, 3 (06 2003 ), 705--767. https:\/\/doi.org\/10.1214\/aos\/1056562461 10.1214\/aos Radford M. Neal. 2003. Slice sampling. Ann. Statist. 31, 3 (06 2003), 705--767. https:\/\/doi.org\/10.1214\/aos\/1056562461"},{"volume-title":"Handbook of Markov chain Monte Carlo","author":"Neal Radford M.","key":"e_1_3_2_1_21_1","unstructured":"Radford M. Neal . 2011. MCMC using Hamiltonian dynamics . In Handbook of Markov chain Monte Carlo . CRC Press , Boca Raton, FL, USA , 113--162. Radford M. Neal. 2011. MCMC using Hamiltonian dynamics. In Handbook of Markov chain Monte Carlo. CRC Press, Boca Raton, FL, USA, 113--162."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9053-2"},{"key":"e_1_3_2_1_23_1","unstructured":"Sheehan Olver and Alex Townsend. 2013. Fast inverse transform sampling in one and two dimensions. arXiv:1307.1223  Sheehan Olver and Alex Townsend. 2013. Fast inverse transform sampling in one and two dimensions. arXiv:1307.1223"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2017.11.004"},{"key":"e_1_3_2_1_25_1","volume-title":"The NURBS Book","author":"Piegl Les","unstructured":"Les Piegl and Wayne Tiller . 1997. The NURBS Book ( 2 nd Ed.). Springer-Verlag , Berlin, Heidelberg . Les Piegl and Wayne Tiller. 1997. The NURBS Book (2nd Ed.). Springer-Verlag, Berlin, Heidelberg.","edition":"2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/256562.256619"},{"key":"e_1_3_2_1_27_1","volume-title":"I: Univariate Polynomials and Hypersurfaces. To appear in the special issue of the Journal of Symbolic Computation for ISSAC","author":"Tonelli-Cueto J.","year":"2021","unstructured":"J. Tonelli-Cueto and E. Tsigaridas . 2021 . Condition Numbers for the Cube . I: Univariate Polynomials and Hypersurfaces. To appear in the special issue of the Journal of Symbolic Computation for ISSAC 2020. Available at arXiv:2006.04423. J. Tonelli-Cueto and E. Tsigaridas. 2021. Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces. To appear in the special issue of the Journal of Symbolic Computation for ISSAC 2020. Available at arXiv:2006.04423."},{"volume-title":"Approximation theory and approximation practice","author":"Trefethen Lloyd N.","key":"e_1_3_2_1_28_1","unstructured":"Lloyd N. Trefethen . 2013. Approximation theory and approximation practice . Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA . viii+305 pp.+back matter pages. Lloyd N. Trefethen. 2013. Approximation theory and approximation practice. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. viii+305 pp.+back matter pages."},{"key":"e_1_3_2_1_29_1","volume-title":"Geometric random walks: a survey. Combinatorial and computational geometry 52, 573--612","author":"Vempala Santosh","year":"2005","unstructured":"Santosh Vempala . 2005. Geometric random walks: a survey. Combinatorial and computational geometry 52, 573--612 ( 2005 ), 2. Santosh Vempala. 2005. Geometric random walks: a survey. Combinatorial and computational geometry 52, 573--612 (2005), 2."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 9th Brazilian symposium on computer graphics and image processing. Citeseer","author":"Walter Marcelo","year":"1996","unstructured":"Marcelo Walter and Alain Fournier . 1996 . Approximate arc length parameterization . In Proceedings of the 9th Brazilian symposium on computer graphics and image processing. Citeseer , Caxambu, Minas Gerais, Brazil, 143--150. Marcelo Walter and Alain Fournier. 1996. Approximate arc length parameterization. In Proceedings of the 9th Brazilian symposium on computer graphics and image processing. Citeseer, Caxambu, Minas Gerais, Brazil, 143--150."}],"event":{"name":"ISSAC '22: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Villeneuve-d'Ascq France","acronym":"ISSAC '22"},"container-title":["Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3536190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476446.3536190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:20Z","timestamp":1750268960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3536190"}},"subtitle":["Uniformly Distributed Random Points on Parametric Curves"],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":31,"alternative-id":["10.1145\/3476446.3536190","10.1145\/3476446"],"URL":"https:\/\/doi.org\/10.1145\/3476446.3536190","relation":{},"subject":[],"published":{"date-parts":[[2022,7,4]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}