{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:12Z","timestamp":1740123792957,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Spanish Government","award":["MTM-2015-67057"],"award-info":[{"award-number":["MTM-2015-67057"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11083-018-9476-1","type":"journal-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T01:37:39Z","timestamp":1540431459000},"page":"437-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bottom-Up: a New Algorithm to Generate Random Linear Extensions of a Poset"],"prefix":"10.1007","volume":"36","author":[{"given":"P.","family":"Garc\u00eda-Segador","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4931-3636","authenticated-orcid":false,"given":"P.","family":"Miranda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"issue":"4","key":"9476_CR1","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10801-013-0470-9","volume":"39","author":"A Ayyer","year":"2014","unstructured":"Ayyer, A., Klee, S., Shilling, A.: Combinatorial Markov chains on linear extensions. J. Algebr. Comb. 39(4), 853\u2013881 (2014)","journal-title":"J. Algebr. Comb."},{"key":"9476_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/eujc.1999.0299","volume":"20","author":"B Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B., Brightwell, G., Sidorenko, A.: Geometrical techniques for estimating numbers of linear extensions. Eur. J. Comb. 20, 329\u2013335 (1999)","journal-title":"Eur. J. Comb."},{"key":"9476_CR3","doi-asserted-by":"crossref","unstructured":"Brightwell, G: The number of linear extensions of ranked posets. CDAM Research Report (2003)","DOI":"10.1023\/B:ORDE.0000034596.50352.f7"},{"issue":"3","key":"9476_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:ORDE.0000034596.50352.f7","volume":"20","author":"G Brightwell","year":"2003","unstructured":"Brightwell, G., Tetali, P.: The number of linear extensions of the Boolean Lattice. Order 20(3), 333\u2013345 (2003)","journal-title":"Order"},{"issue":"3","key":"9476_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"key":"9476_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(98)00333-1","volume":"20","author":"R Bubley","year":"1999","unstructured":"Bubley, R., Dyer, M.: Faster random generation of linear extensions. Discret. Math. 20, 81\u201388 (1999)","journal-title":"Discret. Math."},{"key":"9476_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.5802\/aif.53","volume":"5","author":"G Choquet","year":"1953","unstructured":"Choquet, G: Theory of capacities. Ann. Inst. Fourier 5, 131\u2013295 (1953)","journal-title":"Ann. Inst. Fourier"},{"key":"9476_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"9476_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2434-0","volume-title":"Non-additive Measures and Integral","author":"D Denneberg","year":"1994","unstructured":"Denneberg, D.: Non-additive Measures and Integral. Kluwer Academic, Dordrecht (1994)"},{"key":"9476_CR10","doi-asserted-by":"publisher","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, New York (1986)"},{"issue":"1","key":"9476_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00341632","volume":"6","author":"P Edelman","year":"1989","unstructured":"Edelman, P., Hibi, T., Stanley, R.: A recurrence for linear extensions. Order 6(1), 15\u201318 (1989)","journal-title":"Order"},{"issue":"1","key":"9476_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11083-016-9420-1","volume":"35","author":"Kimmo Eriksson","year":"2017","unstructured":"Eriksson, K., Jonsson, M., Sj\u00f6strand, J.: Markov chains on graded posets: compatibility of up-directed and down-directed transition probabilities. Order, Online Open Access. https:\/\/doi.org\/10.1007\/s11083-016-9420-1 (2016)","journal-title":"Order"},{"key":"9476_CR13","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0001-8708(79)90023-9","volume":"31","author":"C Greene","year":"1979","unstructured":"Greene, C., Nijenhuis, A., Wilf, H.: A probabilistic proof of a formula for the number of Young Tableaux of a given shape. Adv. Math. 31, 104\u2013109 (1979)","journal-title":"Adv. Math."},{"key":"9476_CR14","unstructured":"Grabisch, M., Murofushi, T., Sugeno, M. (eds.): Fuzzy Measures and Integrals- Theory and Applications. Number 40 in Studies in Fuzziness and Soft Computing. Physica\u2013Verlag, Heidelberg (2000)"},{"key":"9476_CR15","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.disc.2006.01.003","volume":"306","author":"M Huber","year":"2006","unstructured":"Huber, M.: Fast perfect sampling from linear extensions. Discret. Math. 306, 420\u2013428 (2006)","journal-title":"Discret. Math."},{"key":"9476_CR16","first-page":"1","volume":"03","author":"M Huber","year":"2014","unstructured":"Huber, M.: Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction. Chic. J. Theor. Comput. Sci. 03, 1\u201316 (2014)","journal-title":"Chic. J. Theor. Comput. Sci."},{"issue":"2","key":"9476_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0196-6774(83)90042-1","volume":"4","author":"AD Kalvin","year":"1983","unstructured":"Kalvin, A.D., Varol, Y.L.: On the generation of all topological sortings. J. Algorithms 4(2), 150\u2013162 (1983)","journal-title":"J. Algorithms"},{"issue":"1","key":"9476_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00385809","volume":"8","author":"A Karzanov","year":"1995","unstructured":"Karzanov, A., Khachiyan, L.: On the conductance of order Markov chains. Order 8(1), 7\u201315 (1995)","journal-title":"Order"},{"issue":"6","key":"9476_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(74)90001-5","volume":"2","author":"DE Knuth","year":"1974","unstructured":"Knuth, D.E., Szwarcfiter, J.: A structured program to generate all topological sorting arrangements. Inform. Process. Lett. 2(6), 153\u2013157 (1974)","journal-title":"Inform. Process. Lett."},{"key":"9476_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1016548222238","volume":"19","author":"JF Korsh","year":"2002","unstructured":"Korsh, J.F., Lafollette, P.S.: Loopless generation of linear extensions of a poset. Order 19, 115\u2013126 (2002)","journal-title":"Order"},{"key":"9476_CR21","doi-asserted-by":"crossref","unstructured":"Levin, D., Peres, Y., Wilmer, E.: Markov Mixing and Mixing Times. American Mathematical Society (2008)","DOI":"10.1090\/mbk\/058"},{"issue":"224","key":"9476_CR22","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1090\/S0025-5718-98-01004-7","volume":"67","author":"J Leydold","year":"1998","unstructured":"Leydold, J., H\u00f6rmann, W.: A sweep-plane algorithm for generating random tuples in simple polytopes. J. Math. Comput. 67(224), 1617\u20131635 (1998)","journal-title":"J. Math. Comput."},{"key":"9476_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matousek","year":"2002","unstructured":"Matousek, J: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"9476_CR24","doi-asserted-by":"crossref","unstructured":"Nakada, K., Okamura, S.: An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. DMTCS, proc. AN, pp. 801\u2013808 (2010)","DOI":"10.46298\/dmtcs.2843"},{"key":"9476_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/3890","volume-title":"Basic Posets","author":"J Neggers","year":"1998","unstructured":"Neggers, J., Kim, H. S.: Basic Posets. World Scientific, Singapore (1998)"},{"issue":"2","key":"9476_CR26","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G Pruesse","year":"1994","unstructured":"Pruesse, G., Ruskey, F.: Generating linear extensions fast. SIAM J. Comput. 23(2), 373\u2013386 (1994)","journal-title":"SIAM J. Comput."},{"key":"9476_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0095-8956(92)90067-8","volume":"54","author":"F Ruskey","year":"1992","unstructured":"Ruskey, F.: Generating linear extensions of posets by transpositions. J. Comb. Theory, Ser. B 54, 77\u2013101 (1992)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"9476_CR28","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02187680","volume":"1","author":"R Stanley","year":"1986","unstructured":"Stanley, R.: Two poset polytopes. Discrete Comput. Geom. 1(1), 9\u201323 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9476_CR29","volume-title":"Enumerative Combinatorics","author":"R Stanley","year":"2012","unstructured":"Stanley, R.: Enumerative Combinatorics. Cambridge University Press, Cambridge (2012)"},{"key":"9476_CR30","unstructured":"Sugeno, M.: Theory of fuzzy integrals and its applications. PhD thesis, Tokyo Institute of Technology (1974)"},{"issue":"1","key":"9476_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/comjnl\/24.1.83","volume":"24","author":"YL Varol","year":"1981","unstructured":"Varol, Y.L., Rotem, D.: An algorithm to generate all topological sorting arrangements. Comput. J. 24(1), 83\u201384 (1981)","journal-title":"Comput. J."},{"issue":"9","key":"9476_CR32","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/32.92917","volume":"17","author":"MD Vose","year":"1991","unstructured":"Vose, M.D.: A linear algorithm for generating random numbers with a given distribution. IEEE Trans. Softw. Eng. 17(9), 972\u2013975 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9476_CR33","volume-title":"Generating Functionology","author":"HS Wilf","year":"1994","unstructured":"Wilf, H.S.: Generating Functionology. Academic, New York (1994)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-018-9476-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-018-9476-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-018-9476-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T16:20:25Z","timestamp":1662308425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-018-9476-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["9476"],"URL":"https:\/\/doi.org\/10.1007\/s11083-018-9476-1","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"11 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}