{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:17:18Z","timestamp":1771913838767,"version":"3.50.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T00:00:00Z","timestamp":1464048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2016,6,3]]},"abstract":"<jats:p>We introduce a new software tool and library named Lattice Builder, written in C++, that implements a variety of construction algorithms for good rank-1 lattice rules. It supports exhaustive and random searches, as well as component-by-component (CBC) and random CBC constructions, for any number of points, and for various measures of (non)uniformity of the points. The measures currently implemented are all shift-invariant and represent the worst-case integration error for certain classes of integrands. They include, for example, the weighted P\u03b1 square discrepancy, the R\u03b1 criterion, and figures of merit based on the spectral test, with projection-dependent weights. Each of these measures can be computed as a finite sum. For the P\u03b1 and R\u03b1 criteria, efficient specializations of the CBC algorithm are provided for projection-dependent, order-dependent, and product weights. For numbers of points that are integer powers of a prime base, the construction of embedded rank-1 lattice rules is supported through any of these algorithms, and through a fast CBC algorithm, with a variety of possibilities for the normalization of the merit values of individual embedded levels and for their combination into a single merit value. The library is extensible, thanks to the decomposition of the algorithms into decoupled components, which makes it easy to implement new types of weights, new search domains, new figures of merit, and so on.<\/jats:p>","DOI":"10.1145\/2754929","type":"journal-article","created":{"date-parts":[[2016,5,25]],"date-time":"2016-05-25T18:07:06Z","timestamp":1464199626000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Algorithm 958"],"prefix":"10.1145","volume":"42","author":[{"given":"Pierre","family":"L'ecuyer","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada"}]},{"given":"David","family":"Munger","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Modern C++ Design: Generic Programming and Design Patterns Applied","author":"Alexandrescu A.","unstructured":"A. Alexandrescu . 2001. Modern C++ Design: Generic Programming and Design Patterns Applied . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA . A. Alexandrescu. 2001. Modern C++ Design: Generic Programming and Design Patterns Applied. Addison-Wesley Longman Publishing Co., Inc., Boston, MA."},{"key":"e_1_2_2_2_1","unstructured":"Boost.org. 2012. Boost C++ libraries. Retrieved April 8 2016 from http:\/\/www.boost.org. Boost.org. 2012. Boost C++ libraries. Retrieved April 8 2016 from http:\/\/www.boost.org."},{"key":"e_1_2_2_3_1","unstructured":"J. Burkardt. 2012. LATTICE_RULE. Retrieved April 8 2016 from http:\/\/people.sc.fsu.edu\/&sim;jburkardt\/m_src\/lattice_rule\/lattice_rule.html. J. Burkardt. 2012. LATTICE_RULE. Retrieved April 8 2016 from http:\/\/people.sc.fsu.edu\/&sim;jburkardt\/m_src\/lattice_rule\/lattice_rule.html."},{"key":"e_1_2_2_4_1","volume-title":"Lattices and Groups","author":"Conway J. H.","unstructured":"J. H. Conway and N. J. A. Sloane . 1999. Sphere Packings , Lattices and Groups ( 3 rd ed.). Grundlehren der Mathematischen Wissenschaften 290. Springer-Verlag , New York, NY. J. H. Conway and N. J. A. Sloane. 1999. Sphere Packings, Lattices and Groups (3rd ed.). Grundlehren der Mathematischen Wissenschaften 290. Springer-Verlag, New York, NY.","edition":"3"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/06065074X"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0713071"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"J. Dick and F. Pillichshammer. 2010. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press Cambridge U.K. J. Dick and F. Pillichshammer. 2010. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press Cambridge U.K.","DOI":"10.1017\/CBO9780511761188"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"J. Dick F. Pillichshammer and B. J. Waterhouse. 2008. The construction of good extensible rank-1 lattices. Mathematics of Computation 77 264 2345--2373. J. Dick F. Pillichshammer and B. J. Waterhouse. 2008. The construction of good extensible rank-1 lattices. Mathematics of Computation 77 264 2345--2373.","DOI":"10.1090\/S0025-5718-08-02009-7"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.06.002"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-005-0674-6"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345462"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00894-1"},{"key":"e_1_2_2_15_1","volume-title":"Lattice rules: How well do they measure up? In Random and Quasi-Random Point Sets","author":"Hickernell F. J.","unstructured":"F. J. Hickernell . 1998b. Lattice rules: How well do they measure up? In Random and Quasi-Random Point Sets , P. Hellekalek and G. Larcher, (Eds.). Lecture Notes in Statistics Series, Vol. 138 . Springer-Verlag , New York, 109--166. F. J. Hickernell. 1998b. Lattice rules: How well do they measure up? In Random and Quasi-Random Point Sets, P. Hellekalek and G. Larcher, (Eds.). Lecture Notes in Statistics Series, Vol. 138. Springer-Verlag, New York, 109--166."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827599356638"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0885-064X(02)00026-2"},{"key":"e_1_2_2_18_1","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"Knuth D. E.","unstructured":"D. E. Knuth . 1998. The Art of Computer Programming, Volume 2: Seminumerical Algorithms ( 3 rd ed.). Addison-Wesley, Reading , MA. D. E. Knuth. 1998. The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley, Reading, MA.","edition":"3"},{"key":"e_1_2_2_19_1","volume-title":"Lattice rule generating vectors. Retrieved","author":"Kuo F.","year":"2016","unstructured":"F. Kuo . 2012. Lattice rule generating vectors. Retrieved April 8, 2016 from http:\/\/web.maths.unsw.edu.au\/ fkuo\/lattice\/index.html. F. Kuo. 2012. Lattice rule generating vectors. Retrieved April 8, 2016 from http:\/\/web.maths.unsw.edu.au\/ fkuo\/lattice\/index.html."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2002.0650"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1446181112000077"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845537"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.10.006"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.04.006"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-00996-5"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01039-X"},{"key":"e_1_2_2_27_1","volume-title":"SSJ: A Java Library for Stochastic Simulation. Software user\u2019s guide. Retrieved","author":"L\u2019Ecuyer P.","year":"2008","unstructured":"P. L\u2019Ecuyer . 2008 . SSJ: A Java Library for Stochastic Simulation. Software user\u2019s guide. Retrieved April 8, 2016 from http:\/\/www.iro.umontreal.ca\/&sim;lecuyer. P. L\u2019Ecuyer. 2008. SSJ: A Java Library for Stochastic Simulation. Software user\u2019s guide. Retrieved April 8, 2016 from http:\/\/www.iro.umontreal.ca\/&sim;lecuyer."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00780-009-0095-y"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.2.206"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.9.1214.12231"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"P. L\u2019Ecuyer and D. Munger. 2012. On figures of merit for randomly-shifted lattice rules. In Monte Carlo and Quasi-Monte Carlo Methods 2010 H. Wo\u017aniakowski and L. Plaskota (Eds.). Springer-Verlag Berlin 133--159. P. L\u2019Ecuyer and D. Munger. 2012. On figures of merit for randomly-shifted lattice rules. In Monte Carlo and Quasi-Monte Carlo Methods 2010 H. Wo\u017aniakowski and L. Plaskota (Eds.). Springer-Verlag Berlin 133--159.","DOI":"10.1007\/978-3-642-27440-4_6"},{"key":"e_1_2_2_32_1","unstructured":"P. L\u2019Ecuyer and D. Munger. 2016. Lattice Builder Manual and Source Code. Retrieved May 9 2016 from http:\/\/www.iro.umontreal.ca\/&sim;lecuyer\/ and https:\/\/github.com\/umontreal-simul\/. P. L\u2019Ecuyer and D. Munger. 2016. Lattice Builder Manual and Source Code. Retrieved May 9 2016 from http:\/\/www.iro.umontreal.ca\/&sim;lecuyer\/ and https:\/\/github.com\/umontreal-simul\/."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-EJS574"},{"key":"e_1_2_2_34_1","volume-title":"(Eds.)","author":"L\u2019Ecuyer P.","year":"2009","unstructured":"P. L\u2019Ecuyer and A. B. Owen , (Eds.) . 2009 . Monte Carlo and Quasi-Monte Carlo Methods 2008. Springer-Verlag , Berlin. P. L\u2019Ecuyer and A. B. Owen, (Eds.). 2009. Monte Carlo and Quasi-Monte Carlo Methods 2008. Springer-Verlag, Berlin."},{"key":"e_1_2_2_35_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Sampling","author":"Lemieux C.","unstructured":"C. Lemieux . 2009. Monte Carlo and Quasi-Monte Carlo Sampling . Springer-Verlag , New York, NY . C. Lemieux. 2009. Monte Carlo and Quasi-Monte Carlo Sampling. Springer-Verlag, New York, NY."},{"key":"e_1_2_2_36_1","volume-title":"RandQMC library. Retrieved","author":"Lemieux C.","year":"2016","unstructured":"C. Lemieux . 2012. RandQMC library. Retrieved April 8, 2016 from http:\/\/www.math.uwaterloo.ca\/&sim;clemieux\/randqmc.html. C. Lemieux. 2012. RandQMC library. Retrieved April 8, 2016 from http:\/\/www.math.uwaterloo.ca\/&sim;clemieux\/randqmc.html."},{"key":"e_1_2_2_37_1","volume-title":"The Programmer\u2019s Introduction to C++","author":"Lischner R.","unstructured":"R. Lischner . 2009. Exploring C++ : The Programmer\u2019s Introduction to C++ . Apress, Springer. R. Lischner. 2009. Exploring C++: The Programmer\u2019s Introduction to C++. Apress, Springer."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000001410"},{"key":"e_1_2_2_39_1","volume-title":"\u201cbons treillis","author":"Maisonneuve D.","unstructured":"D. Maisonneuve . 1972. Recherche et utilisation des \u201cbons treillis \u201d, programmation et r\u00e9sultats num\u00e9riques. In Applications of Number Theory to Numerical Analysis, S. K. Zaremba, (Ed.). Academic Press , New York, NY, 121--201. D. Maisonneuve. 1972. Recherche et utilisation des \u201cbons treillis\u201d, programmation et r\u00e9sultats num\u00e9riques. In Applications of Number Theory to Numerical Analysis, S. K. Zaremba, (Ed.). Academic Press, New York, NY, 121--201."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/167293.167348"},{"key":"e_1_2_2_41_1","series-title":"SIAM CBMS-NSF Regional Conference Series in Applied Mathematics Series","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"Niederreiter H.","unstructured":"H. Niederreiter . 1992b. Random Number Generation and Quasi-Monte Carlo Methods . SIAM CBMS-NSF Regional Conference Series in Applied Mathematics Series , Vol. 63 . SIAM , Philadelphia, PA . H. Niederreiter. 1992b. Random Number Generation and Quasi-Monte Carlo Methods. SIAM CBMS-NSF Regional Conference Series in Applied Mathematics Series, Vol. 63. SIAM, Philadelphia, PA."},{"key":"e_1_2_2_42_1","volume-title":"Fast component-by-component constructions. Retrieved","author":"Nuyens D.","year":"2016","unstructured":"D. Nuyens . 2012. Fast component-by-component constructions. Retrieved April 8, 2016 from http:\/\/people.cs.kuleuven.be\/&sim;dirk.nuyens\/fast-cbc\/. D. Nuyens. 2012. Fast component-by-component constructions. Retrieved April 8, 2016 from http:\/\/people.cs.kuleuven.be\/&sim;dirk.nuyens\/fast-cbc\/."},{"key":"e_1_2_2_43_1","volume-title":"Uniform Distribution and Quasi-Monte Carlo Methods: Discrepancy, Integration and Applications","author":"Nuyens D.","unstructured":"D. Nuyens . 2014. The construction of good lattice rules and polynomial lattice rules . In Uniform Distribution and Quasi-Monte Carlo Methods: Discrepancy, Integration and Applications , P. Kritzer, H. Niederreiter, F. Pillichshammer, and A. Winterhof (Eds.). De Gruyter , 223--255. D. Nuyens. 2014. The construction of good lattice rules and polynomial lattice rules. In Uniform Distribution and Quasi-Monte Carlo Methods: Discrepancy, Integration and Applications, P. Kritzer, H. Niederreiter, F. Pillichshammer, and A. Winterhof (Eds.). De Gruyter, 223--255."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-06-01785-6"},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"D. Nuyens and R. Cools. 2006b. Fast component-by-component construction a reprise for different kernels. In Monte Carlo and Quasi-Monte Carlo Methods 2004 H. Niederreiter and D. Talay (Eds.). 373--387. D. Nuyens and R. Cools. 2006b. Fast component-by-component construction a reprise for different kernels. In Monte Carlo and Quasi-Monte Carlo Methods 2004 H. Niederreiter and D. Talay (Eds.). 373--387.","DOI":"10.1007\/3-540-31186-6_22"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2005.07.002"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.273010"},{"key":"e_1_2_2_48_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Sinescu V.","year":"2008","unstructured":"V. Sinescu and P. L\u2019Ecuyer . 2009. On the behavior of weighted star discrepancy bounds for shifted lattice rules . In Monte Carlo and Quasi-Monte Carlo Methods 2008 , P. L\u2019Ecuyer and A. B. Owen, (Eds.). Springer-Verlag , Berlin, 603--616. V. Sinescu and P. L\u2019Ecuyer. 2009. On the behavior of weighted star discrepancy bounds for shifted lattice rules. In Monte Carlo and Quasi-Monte Carlo Methods 2008, P. L\u2019Ecuyer and A. B. Owen, (Eds.). Springer-Verlag, Berlin, 603--616."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2012.02.034"},{"key":"e_1_2_2_50_1","doi-asserted-by":"crossref","unstructured":"I. H. Sloan and S. Joe. 1994. Lattice Methods for Multiple Integration. Clarendon Press Oxford. UK. I. H. Sloan and S. Joe. 1994. Lattice Methods for Multiple Integration. Clarendon Press Oxford. UK.","DOI":"10.1093\/oso\/9780198534723.001.0001"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0463"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(00)00270-6"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/060650714"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502418197"},{"key":"e_1_2_2_55_1","volume-title":"(Eds.)","author":"Wo\u017aniakowski H.","year":"2012","unstructured":"H. Wo\u017aniakowski and L. Plaskota , (Eds.) . 2012 . Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer-Verlag , Berlin. H. Wo\u017aniakowski and L. Plaskota, (Eds.). 2012. Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer-Verlag, Berlin."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2754929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2754929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:40Z","timestamp":1750227400000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2754929"}},"subtitle":["Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules"],"short-title":[],"issued":{"date-parts":[[2016,5,24]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6,3]]}},"alternative-id":["10.1145\/2754929"],"URL":"https:\/\/doi.org\/10.1145\/2754929","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,24]]},"assertion":[{"value":"2012-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}