乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T21:30:47Z","timestamp":1675459847200},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0304-3975(03)00218-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T19:58:54Z","timestamp":1053374334000},"page":"241-256","source":"Crossref","is-referenced-by-count":16,"title":["Watermelon uniform random generation with applications"],"prefix":"10.1016","volume":"307","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00218-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB2","doi-asserted-by":"crossref","unstructured":"Laurent Alonso, Ren\u00e9 Schott, Random Generation of Trees. Kluwer Academic Publishers, Dordrecht, 1995.","DOI":"10.1007\/978-1-4757-6353-9"},{"issue":"1","key":"10.1016\/S0304-3975(03)00218-4_BIB3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/357084.357091","article-title":"Uniform random generation of balanced parenthesis strings","volume":"2","author":"Arnold","year":"1980","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"11","key":"10.1016\/S0304-3975(03)00218-4_BIB4","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1002\/1097-0312(200011)53:11<1385::AID-CPA3>3.0.CO;2-T","article-title":"Random vicious walks and random matrices","volume":"53","author":"Baik","year":"2000","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB5","unstructured":"N. Bonichon, A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths, in: Proc. FPSAC\u201902, Melbourne, Australia, 2002, pp. 123\u2013132."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB6","doi-asserted-by":"crossref","unstructured":"N. Bonichon, B. Le Sa\u00ebc, M. Mosbah, Optimal area algorithm for planar polyline drawings, in: Graph-Theoretic Concepts in Computer Science (WG 2002), Lecture Notes in Computer Science, Vol. 2573, 2002, pp. 35\u201346.","DOI":"10.1007\/3-540-36379-3_4"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB7","doi-asserted-by":"crossref","unstructured":"N. Bonichon, B. Le Sa\u00ebc, M. Mosbah, Wagner's theorem on realizers, in: Internat. Coll. Automata, Languages and Programming 2002 (ICALP\u201902), Lecture Notes in Computer Science, Vol. 2380, 2002, pp. 1043\u20131053.","DOI":"10.1007\/3-540-45465-9_89"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB8","doi-asserted-by":"crossref","first-page":"10763","DOI":"10.1088\/0305-4470\/34\/49\/303","article-title":"Return polynomials for non-intersecting paths above a surface on a directed square lattice","volume":"34","author":"Brak","year":"2001","journal-title":"J. Phys. A\u2014Math. Gen."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB9","unstructured":"E. Brehm, 3-Orientations and Schnyder 3-tree-decompositions, Ph.D. Thesis, FB Mathematik und Informatik, Freie Universit\u00e4t Berlin, 2000."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB10","series-title":"Graph Theory and Computing","first-page":"15","article-title":"The average height of planted plane trees","author":"De Bruijn","year":"1972"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB11","unstructured":"Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I LU, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proc. 12th Symp. Discrete Algorithms, ACM and SIAM, 2001, pp. 506\u2013515."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(84)90116-6","article-title":"Algebraic languages and polyominoes enumeration","volume":"34","author":"Delest","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB13","unstructured":"A. Denise, G\u00e9n\u00e9ration al\u00e9atoire et uniforme de mots, in: Proc. FPSAC\u201993, Florence, Italy, 1993, pp. 153\u2013164."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB14","unstructured":"A. Denise, Enum\u00e9ration et g\u00e9n\u00e9ration al\u00e9atoire de chemins, in: Proc. FPSAC\u201994, 1994, pp. 91\u201397."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(95)00129-K","article-title":"G\u00e9n\u00e9ration al\u00e9atoire et uniforme de mots","volume":"153","author":"Denise","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(95)00200-6","article-title":"G\u00e9n\u00e9ration al\u00e9atoire uniforme de mots de langages rationnels","volume":"159","author":"Denise","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01165559","article-title":"A honeycomb graph perfect matchings enumeration","volume":"13","author":"Desainte-Catherine","year":"1993","journal-title":"J. Math. Chem."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB18","doi-asserted-by":"crossref","unstructured":"M. Desainte-Catherine, G. Viennot, Enumeration of certain Young tableaux with bounded height, in: G. Labelle, P. Leroux (Eds.), Combinatoire \u00c9num\u00e9rative, Montreal, Springer, 1986, pp. 58\u201367.","DOI":"10.1007\/BFb0072509"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB19","series-title":"Non-uniform Random Variate Generation","author":"Devroye","year":"1986"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0012-365X(96)83009-3","article-title":"Stack words, standard tableaux and Baxter permutations","volume":"157","author":"Dulucq","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(97)00112-X","article-title":"Baxter permutations","volume":"180","author":"Dulucq","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB22","doi-asserted-by":"crossref","first-page":"5849","DOI":"10.1103\/PhysRevE.52.5849","article-title":"Vicious walkers and directed polymer networks in general dimensions","volume":"52","author":"Essam","year":"1995","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB23","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/BF01009436","article-title":"Walks, walls, wetting, and melting","volume":"34","author":"Fisher","year":"1984","journal-title":"J. Statist. Phys."},{"issue":"1\u20133","key":"10.1016\/S0304-3975(03)00218-4_BIB24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","article-title":"On topological aspects of orientations","volume":"229","author":"de Fraysseix","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB25","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","article-title":"Gray codes and paths on the n-cube","volume":"37","author":"Gilbert","year":"1958","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB26","doi-asserted-by":"crossref","unstructured":"D. Gouyou-Beauchamps, Chemins sous-diagonaux et tableaux de Young, in: Colloque de Combinatoire Enum\u00e9rative, Montr\u00e9al, UQAM 1985, Lecture Notes in Mathematics, Vol. 1234, 1986, pp. 112\u2013125.","DOI":"10.1007\/BFb0072513"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(89)80034-4","article-title":"Standard Young tableaux of height 4 and 5","volume":"10","author":"Gouyou-Beauchamps","year":"1989","journal-title":"European J. Combin."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB28","unstructured":"T. Granlund, The GNU Multiple Precision arithmetic library, http:\/\/www.gnu.org\/manual\/gmp\/ps\/gmp.ps.gz, 1996."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB29","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jcta.1999.2979","article-title":"Another involution principle-free bijective proof of stanley's hook-content formula","volume":"88","author":"Krattenthaler","year":"1999","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB30","doi-asserted-by":"crossref","first-page":"8123","DOI":"10.1088\/0305-4470\/33\/48\/318","article-title":"Vicious walkers, friendly walkers and Young tableaux ii","volume":"33","author":"Krattenthaler","year":"2000","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB31","unstructured":"Chien-Chi Lioa, Ching-Chi Lin, Hsu-Chun Yen, Floor-planning via orderly spanning trees, in: Proc. 9th Internat. Symp. on Graph Drawing (GD 2001), September 23\u201326 2001, Vienna, Austria, Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2002, pp. 367\u2013377."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB32","unstructured":"P.O. Mendez, Orientations bipolaires, Ph.D. Thesis, Ecole des Hautes Etudes en Sciences Sociales, 1994."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB33","unstructured":"J.G. Penaud, O. Roques, Tirage \u00e0 pile ou face de mots de Fibonacci, Publications du LaCIM, 27, 2000."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB34","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","article-title":"Planar graphs and poset dimension","volume":"5","author":"Schnyder","year":"1989","journal-title":"Order"},{"key":"10.1016\/S0304-3975(03)00218-4_BIB35","unstructured":"G. Viennot, A bijective proof for the number of Baxter permutations, in: S\u00e9minaire Lotharingien de Combinatoire, Le Klebach (1981), 1981."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB36","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0001-8708(77)90059-7","article-title":"A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects","volume":"24","author":"Wilf","year":"1977","journal-title":"Adv. in Math."},{"key":"10.1016\/S0304-3975(03)00218-4_BIB37","unstructured":"D. Wilson, Determinant algorithms for random planar structures, in: Proc. 18th Symp., Discrete Algorithms, ACM and SIAM, 1997, pp. 258\u2013267."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T09:22:20Z","timestamp":1553160140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0304397503002184"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00218-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}