暂无分享,去创建一个
[2] Michael Wallner,et al. A half-normal distribution scheme for generating functions , 2016, Eur. J. Comb..
[3] Marc Moreno Maza,et al. An equivalence theorem for regular differential chains , 2019, J. Symb. Comput..
[4] Delphin S'enizergues. Geometry of weighted recursive and affine preferential attachment trees , 2019, 1904.07115.
[5] Vladimir P. Gerdt,et al. The MAPLE package TDDS for computing Thomas decompositions of systems of nonlinear PDEs , 2018, Comput. Phys. Commun..
[6] V. Gorin,et al. Fourier transform on high-dimensional unitary groups with applications to random tilings , 2017, Duke Mathematical Journal.
[7] Greta Panova,et al. Hook formulas for skew shapes III. Multivariate and product formulas , 2017, Algebraic Combinatorics.
[8] Philippe Marchal,et al. Periodic Pólya Urns and an Application to Young Tableaux , 2018, AofA.
[9] Philippe Marchal,et al. Rectangular Young tableaux with local decreases and the density method for uniform random generation , 2018, GASCom.
[10] Svante Linusson,et al. On random shifted standard Young tableaux and 132-avoiding sorting networks , 2018, 1804.01795.
[11] Ronald L. Rivest,et al. Bayesian Tabulation Audits: Explained and Extended , 2018, ArXiv.
[12] V. Gorin,et al. Random sorting networks: local statistics via random matrix laws , 2017, Probability Theory and Related Fields.
[13] Cécile Mailler,et al. Multiple drawing multi-colour urns by stochastic approximation , 2018, J. Appl. Probab..
[14] Henning Sulzbach,et al. On martingale tail sums in affine two-color urn models with multiple drawings , 2015, J. Appl. Probab..
[15] Hosam M. Mahmoud,et al. Two-color balanced affine urn models with multiple drawings , 2017, Adv. Appl. Math..
[16] Pramod Viswanath,et al. Deanonymization in the Bitcoin P2P Network , 2017, NIPS.
[17] B. Salvy,et al. Algorithmes Efficaces en Calcul Formel , 2017 .
[18] G. Olshanski,et al. Representations of the Infinite Symmetric Group , 2016 .
[19] Alois Panholzer,et al. Combinatorial families of multilabelled increasing trees and hook-length formulas , 2014, Discret. Math..
[20] Nathan Ross,et al. Generalized gamma approximation with rates for urns, walks and trees , 2013, 1309.4183.
[21] Sarah Eichmann,et al. Mathematics And Computer Science Algorithms Trees Combinatorics And Probabilities , 2016 .
[22] P. Marchal. Rectangular Young tableaux and the Jacobi ensemble , 2015, Discrete Mathematics & Theoretical Computer Science.
[23] K. Johansson,et al. The Cusp-Airy Process , 2015, 1510.02057.
[24] J. Bouttier,et al. Dimers on Rail Yard Graphs , 2015, 1504.05176.
[25] Hosam M. Mahmoud,et al. Two-colour balanced affine urn models with multiple drawings I: central limit theorems , 2015 .
[26] D. Romik. The Surprising Mathematics of Longest Increasing Subsequences , 2015 .
[27] Elchanan Mossel,et al. On the Influence of the Seed Graph in the Preferential Attachment Model , 2014, IEEE Transactions on Network Science and Engineering.
[28] Michael Drmota,et al. Formulae and Asymptotics for Coefficients of Algebraic Functions , 2014, Combinatorics, Probability and Computing.
[29] C. Goldschmidt,et al. A line-breaking construction of the stable trees , 2014, 1407.5691.
[30] J. Bouttier,et al. From Aztec diamonds to pyramids: steep tilings , 2014, 1407.0665.
[31] Piotr Sniady,et al. Robinson-Schensted-Knuth Algorithm, Jeu de Taquin, and Kerov-Vershik Measures on Infinite Tableaux , 2013, SIAM J. Discret. Math..
[32] Nicolas Pouyanne,et al. Smoothing Equations for Large Pólya Urns , 2013, 1302.1412.
[33] L. Petrov. Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field , 2012, 1206.5123.
[34] Hosam M. Mahmoud,et al. Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology , 2012, ArXiv.
[35] D. Romik. Arctic circles, domino tilings and square Young tableaux , 2009, 0910.1636.
[36] Manuel Kauers,et al. The concrete tetrahedron , 2011, ISSAC '11.
[37] Manuel Kauers,et al. The Concrete Tetrahedron - Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates , 2011, Texts & Monographs in Symbolic Computation.
[38] Daniel Dufresne,et al. G distributions and the beta-gamma algebra , 2010 .
[39] Ronald F. Boisvert,et al. NIST Handbook of Mathematical Functions , 2010 .
[40] Svante Janson,et al. Moments of Gamma type and the Brownian supremum process area , 2010, 1002.4135.
[41] Guo-Niu Han,et al. New hook length formulas for binary trees , 2008, Comb..
[42] Khodabina Morteza,et al. SOME PROPERTIES OF GENERALIZED GAMMA DISTRIBUTION , 2010 .
[43] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[44] Mikko Alava,et al. Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.
[45] yuliy baryshnikov,et al. Enumeration formulas for young tableaux in a diagonal strip , 2007, 0709.0498.
[46] Hsien-Kuei Hwang,et al. Analysis of some exactly solvable diminishing urn models , 2007, 2212.05091.
[47] T. A. Springer. The Algebra of Invariants , 2007 .
[48] Svante Janson,et al. Brownian excursion area, Wright’s constants in graph enumeration, and other Brownian areas , 2007, 0704.2289.
[49] Dan Romik,et al. Limit shapes for random square Young tableaux , 2007, Adv. Appl. Math..
[50] B. Virág,et al. Random sorting networks , 2006, math/0609538.
[51] K. Johansson,et al. Eigenvalues of GUE Minors , 2006, math/0606760.
[52] Svante Janson,et al. Limit theorems for triangular urn schemes , 2006 .
[53] Philippe Flajolet,et al. Some exactly solvable models of urn process theory , 2006 .
[54] P. Campbell. How to Solve It: A New Aspect of Mathematical Method , 2005 .
[55] Svante Janson,et al. Asymptotic degree distribution in random recursive trees , 2005, Random Struct. Algorithms.
[56] C. W. Tate. Solve it. , 2005, Nursing standard (Royal College of Nursing (Great Britain) : 1987).
[57] Svante Janson,et al. Functional limit theorems for multitype branching processes and generalized Pólya urns , 2004 .
[58] D. Romik. Explicit formulas for hook walks on continual Young diagrams , 2003, Adv. Appl. Math..
[59] J. Gabarró,et al. Analytic urns , 2004, math/0407098.
[60] Noam D. Elkies. On the sums Σ∞k=-∞(4k + 1)-n , 2003 .
[61] Scott Sheffield,et al. Random Surfaces , 2003, math/0304049.
[62] H. Wilf,et al. The Distributions of the Entries of Young Tableaux , 2000, Journal of combinatorial theory. Series A.
[63] M. Yor,et al. On Subordinators, Self-Similar Markov Processes and Some Factorizations of the Exponential Variable , 2001 .
[64] A. Vershik. Randomization of Algebra and Algebraization of Probability , 2001 .
[65] Igor Pak,et al. Hook length formula and geometric combinatorics. , 2001 .
[66] H. Wall,et al. Analytic Theory of Continued Fractions , 2000 .
[67] R. Kenyon,et al. Dominos and the Gaussian Free Field , 2000, math-ph/0002027.
[68] P. Diaconis,et al. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem , 1999 .
[69] Philippe Biane,et al. Representations of Symmetric Groups and Free Probability , 1998 .
[70] Andrei Okounkov,et al. On representations of the infinite symmetric group , 1998, math/9803037.
[71] Philippe Flajolet,et al. Search costs in quadtrees and singularity perturbation asymptotics , 1994, Discret. Comput. Geom..
[72] Bruno Salvy,et al. GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable , 1994, TOMS.
[73] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .
[74] S. Kerov. Transition probabilities for continual young diagrams and the Markov moment problem , 1993 .
[75] A. P Prudnikov,et al. Direct Laplace transforms , 1992 .
[76] J. H. Lint. Concrete mathematics : a foundation for computer science / R.L. Graham, D.E. Knuth, O. Patashnik , 1990 .
[77] PROBABILISTIC ALGORITHMS FOR TREES , 1987 .
[78] L. Devroye. Non-Uniform Random Variate Generation , 1986 .
[79] Richard P. Stanley,et al. Two poset polytopes , 1986, Discret. Comput. Geom..
[80] Amitava Bagchi,et al. Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures , 1985 .
[81] Curtis Greene,et al. Another Probabilistic Method in the Theory of Young Tableaux , 1984, J. Comb. Theory, Ser. A.
[82] B. Logan,et al. A Variational Problem for Random Young Tableaux , 1977 .
[83] A. G. Greenhill,et al. Handbook of Mathematical Functions with Formulas, Graphs, , 1971 .
[84] K. Athreya,et al. Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems , 1968 .
[85] David M. Miller,et al. Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .
[86] Leon M. Hall,et al. Special Functions , 1998 .
[87] E. Stacy. A Generalization of the Gamma Distribution , 1962 .
[88] J. Kahane. Propriétés locales des fonctions à séries de Fourier aléatoires , 1960 .
[89] J. Riordan. Introduction to Combinatorial Analysis , 1958 .
[90] G. Pólya,et al. How to Solve It , 1945 .
[91] A proof of the generalized second-limit theorem in the theory of probability , 1931 .
[92] G. Pólya,et al. Sur quelques points de la théorie des probabilités , 1930 .
[93] G. Pólya,et al. Über die Statistik verketteter Vorgänge , 1923 .
[94] Sur les équations intégrales singulières a noyau réel et symétrique , 1923 .