{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:17Z","timestamp":1725487217308},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725831"},{"type":"electronic","value":"9783540725848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72584-8_96","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:58:59Z","timestamp":1184608739000},"page":"723-730","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Generation of Parallel Quasirandom Faure Sequences Via Scrambling"],"prefix":"10.1007","author":[{"given":"Hongmei","family":"Chi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mascagni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"96_CR1","unstructured":"Beerli, P., Chi, H.: Quasi-markov chain Monte Carlo to improve inference of population genetic parameters. Mathematics and Computers in Simulation, in press (2007)"},{"issue":"1","key":"96_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jpdc.1996.0132","volume":"38","author":"B.C. Bromley","year":"1996","unstructured":"Bromley, B.C.: Quasirandom number generators for parallel Monte Carlo algorithms. Journal of Parallel and Distributed Computing\u00a038(1), 101\u2013104 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"96_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.matcom.2005.03.004","volume":"70","author":"H. Chi","year":"2005","unstructured":"Chi, H., Mascagni, M., Warnock, T.: On the optimal Halton sequences. Mathematics and Computers in Simulation\u00a070(1), 9\u201321 (2005)","journal-title":"Mathematics and Computers in Simulation"},{"issue":"4","key":"96_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.4064\/aa-41-4-337-351","volume":"41","author":"H. Faure","year":"1982","unstructured":"Faure, H.: Discrepancy of sequences associated with a number system (in dimension s). Acta. Arith.\u00a041(4), 337\u2013351 (1982)","journal-title":"Acta. Arith."},{"issue":"4","key":"96_CR5","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1006\/jcom.2001.0590","volume":"17","author":"H. Faure","year":"2001","unstructured":"Faure, H.: Variations on (0,s)-sequences. Journal of Complexity\u00a017(4), 741\u2013753 (2001)","journal-title":"Journal of Complexity"},{"key":"96_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/22721.356187","volume":"12","author":"B. Fox","year":"1986","unstructured":"Fox, B.: Implementation and relative efficiency of quasirandom sequence generators. ACM Trans. on Mathematical Software\u00a012, 362\u2013376 (1986)","journal-title":"ACM Trans. on Mathematical Software"},{"key":"96_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11222-006-6890-9","volume":"16","author":"W. Jank","year":"2006","unstructured":"Jank, W.: Efficient simulated maximum likelihood with an application to online retailing. Statistics and Computing\u00a016, 111\u2013124 (2006)","journal-title":"Statistics and Computing"},{"key":"96_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/264029.264064","volume":"23","author":"L. Kocis","year":"1997","unstructured":"Kocis, L., Whiten, W.: Computational investigations of low discrepancy sequences. ACM Trans. Mathematical software\u00a023, 266\u2013294 (1997)","journal-title":"ACM Trans. Mathematical software"},{"issue":"4","key":"96_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1177\/10943420030174003","volume":"17","author":"Y. Li","year":"2003","unstructured":"Li, Y., Mascagni, M.: Analysis of large-scale grid-based Monte Carlo applications. International Journal of High Performance Computing Applications\u00a017(4), 369\u2013382 (2003)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"96_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-30566-8_31","volume-title":"Parallel and Distributed Processing and Applications","author":"K. Liu","year":"2004","unstructured":"Liu, K., Hickernell, F.J.: A scalable low discrepancy point generator for parallel computing. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol.\u00a03358, pp. 257\u2013262. Springer, Heidelberg (2004)"},{"key":"96_CR11","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1214\/aos\/1059655914","volume":"31","author":"W.L. Loh","year":"2003","unstructured":"Loh, W.L.: On the asymptotic distribution of scrambled net quadrature. Annals of Statistics\u00a031, 1282\u20131324 (2003)","journal-title":"Annals of Statistics"},{"key":"96_CR12","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.parco.2004.08.002","volume":"30","author":"M. Mascagni","year":"2004","unstructured":"Mascagni, M., Chi, H.: Parallel linear congruential generators with Sophie-Germain moduli. Parallel Computing\u00a030, 1217\u20131231 (2004)","journal-title":"Parallel Computing"},{"key":"96_CR13","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1145\/358407.358427","volume":"26","author":"M. Mascagni","year":"2000","unstructured":"Mascagni, M., Srinivasan, A.: Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM Transactions on Mathematical Software\u00a026, 436\u2013461 (2000)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"96_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970081","volume-title":"Random number generation and quasi-Monte Carlo methods","author":"H. Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random number generation and quasi-Monte Carlo methods. SIAM, Philadephia (1992)"},{"key":"96_CR15","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Randomly permuted (t,m,s)-nets and (t,s)-sequences. In: Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics, vol.\u00a0106, pp. 299\u2013317 (1995)","DOI":"10.1007\/978-1-4612-2552-2_19"},{"key":"96_CR16","doi-asserted-by":"publisher","first-page":"8844","DOI":"10.1073\/pnas.0409596102","volume":"102","author":"A.B. Owen","year":"2005","unstructured":"Owen, A.B., Tribble, S.: A quasi-Monte Carlo metroplis algorithm. Proceedings of the National Academy of Sciences of the United States of America\u00a0102, 8844\u20138849 (2005)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"96_CR17","first-page":"63","volume":"9","author":"A. Papageorgiou","year":"1997","unstructured":"Papageorgiou, A., Traub, J.: Beating Monte Carlo. RISK\u00a09, 63\u201365 (1997)","journal-title":"RISK"},{"issue":"1-3","key":"96_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0378-4754(00)00268-8","volume":"55","author":"W. Schmid","year":"2001","unstructured":"Schmid, W., Uhl, A.: Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Math. Comput. Simulat.\u00a055(1-3), 249\u2013257 (2001)","journal-title":"Math. Comput. Simulat."},{"key":"96_CR19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0041-5553(76)90154-3","volume":"16","author":"I.M. Sobo\u013a","year":"1976","unstructured":"Sobo\u013a, I.M.: Uniformly distributed sequences with additional uniformity properties. USSR Comput. Math. and Math. Phy.\u00a016, 236\u2013242 (1976)","journal-title":"USSR Comput. Math. and Math. Phy."},{"key":"96_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2317-8","volume-title":"Uniform Random Numbers, Theory and Practice","author":"S. Tezuka","year":"1995","unstructured":"Tezuka, S.: Uniform Random Numbers, Theory and Practice. Kluwer Academic Publishers, Dordrecht (1995)"},{"issue":"6","key":"96_CR21","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/S0885-064X(03)00035-9","volume":"19","author":"S. Tezuka","year":"2003","unstructured":"Tezuka, S., Faure, H.: I-binomial scrambling of digital nets and sequences. Journal of Complexity\u00a019(6), 744\u2013757 (2003)","journal-title":"Journal of Complexity"},{"key":"96_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/189443.189447","volume":"4","author":"S. Tezuka","year":"1994","unstructured":"Tezuka, S., Tokuyama, T.: A note on polynomial arithmetic analogue of Halton sequences. ACM Trans. on Modelling and Computer Simulation\u00a04, 279\u2013284 (1994)","journal-title":"ACM Trans. on Modelling and Computer Simulation"},{"issue":"2","key":"96_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0885-064X(03)00003-7","volume":"19","author":"X. Wang","year":"2003","unstructured":"Wang, X., Fang, K.T.: The effective dimension and quasi-monte carlo. Journal of Complexity\u00a019(2), 101\u2013124 (2003)","journal-title":"Journal of Complexity"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72584-8_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T02:24:00Z","timestamp":1550456640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72584-8_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725831","9783540725848"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72584-8_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}