{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T11:14:42Z","timestamp":1789470882422,"version":"build-2803163510"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T00:00:00Z","timestamp":1377907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00224-013-9496-6","type":"journal-article","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T04:32:13Z","timestamp":1377837133000},"page":"659-688","source":"Crossref","is-referenced-by-count":2,"title":["Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set"],"prefix":"10.1007","volume":"54","author":[{"given":"Kevin J.","family":"Lang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,31]]},"reference":[{"issue":"2","key":"9496_CR1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1214\/aoap\/1177005705","volume":"2","author":"D. Bayer","year":"1992","unstructured":"Bayer, D., Diaconis, P.: Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2(2), 294\u2013313 (1992)","journal-title":"Ann. Appl. Probab."},{"key":"9496_CR2","first-page":"36","volume-title":"Contemporary Combinatorics","author":"B. Bela","year":"2002","unstructured":"Bela, B.: Contemporary Combinatorics p. 36. Springer, Budapest (2002)"},{"key":"9496_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8724-2","volume-title":"A Guide to Simulation","author":"P. Bratley","year":"1987","unstructured":"Bratley, P., Fox, B.L., Schrage, L.: A Guide to Simulation, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"key":"9496_CR4","first-page":"374","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"P.B. Callahan","year":"1998","unstructured":"Callahan, P.B.: Output-sensitive generation of random events. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 374\u2013383 (1998)"},{"key":"9496_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9496_CR6","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)","edition":"2"},{"key":"9496_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: Non-Uniform Random Variate Generation. Springer, Berlin (1986)"},{"issue":"4","key":"9496_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0196-6774(86)90014-3","volume":"7","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Saheb, N.: The complexity of generating an exponentially distributed variate. J. Algorithms 7(4), 463\u2013488 (1986)","journal-title":"J. Algorithms"},{"issue":"1","key":"9496_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/ijoc.3.1.3","volume":"3","author":"B.L. Fox","year":"1991","unstructured":"Fox, B.L., Young, A.R.: Generating Markov\u2013Chain transitions quickly: II. INFORMS J. Comput. 3(1), 3\u201311 (1991)","journal-title":"INFORMS J. Comput."},{"key":"9496_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-56939-1_77","volume-title":"International Colloquium on Automata, Languages and Programming (ICALP)","author":"T. Hagerup","year":"1993","unstructured":"Hagerup, T., Mehlhorn, K., Munro, J.I.: Maintaining discrete probability distributions optimally. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 253\u2013264 (1993)"},{"key":"9496_CR11","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a0II, 2nd edn. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"9496_CR12","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming. In: Sorting and Searching, vol. 3, 2nd edn. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"9496_CR13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-642-30347-0_27","volume-title":"Fun with Algorithms\u20146th International Conference","author":"K.J. Lang","year":"2012","unstructured":"Lang, K.J.: Practical algorithms for generating a random ordering of the elements of a weighted set. In: Fun with Algorithms\u20146th International Conference, pp. 270\u2013281 (2012)"},{"key":"9496_CR14","first-page":"382","volume-title":"International Colloquium on Automata, Languages and Programming (ICALP)","author":"J. Leeuwen van","year":"1976","unstructured":"van Leeuwen, J.: On the construction of Huffman trees. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 382\u2013410 (1976)"},{"issue":"6","key":"9496_CR15","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1109\/18.641571","volume":"43","author":"T. Linder","year":"1997","unstructured":"Linder, T., Tarokh, V., Zeger, K.: Existence of optimal prefix codes for infinite source alphabets. IEEE Trans. Inf. Theory 43(6), 2026\u20132028 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9496_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00224-003-1078-6","volume":"36","author":"Y. Matias","year":"2003","unstructured":"Matias, Y., Vitter, J.S., Ni, W.-C.: Dynamic generation of discrete random variates. Theory Comput. Syst. 36(4), 329\u2013358 (2003)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9496_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/151527.151529","volume":"3","author":"S. Rajasekaran","year":"1993","unstructured":"Rajasekaran, S., Ross, K.W.: Fast algorithms for generating discrete random variates with changing distributions. ACM Trans. Model. Comput. Simul. 3(1), 1\u201319 (1993)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9496_CR18","volume-title":"Algorithms in Java, Third Edition, Parts 1\u20134: Fundamentals, Data Structures, Sorting, Searching","author":"R. Sedgewick","year":"1998","unstructured":"Sedgewick, R., Schidlowsky, M.: Algorithms in Java, Third Edition, Parts 1\u20134: Fundamentals, Data Structures, Sorting, Searching. Addison-Wesley, Reading (1998)"},{"issue":"3","key":"9496_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/355744.355749","volume":"3","author":"A.J. Walker","year":"1977","unstructured":"Walker, A.J.: An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3(3), 253\u2013256 (1977)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"9496_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0209009","volume":"9","author":"C.K. Wong","year":"1980","unstructured":"Wong, C.K., Easton, M.C.: An efficient method for weighted sampling without replacement. SIAM J. Comput. 9(1), 111\u2013113 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9496-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9496-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9496-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:25Z","timestamp":1558698865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9496-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,31]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9496"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9496-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,31]]}}}