Author:
de Panafieu Élie,Gardy Danièle,Gittenberger Bernhard,Kuba Markus
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference37 articles.
1. Andrews, G.E.: The theory of partitions. In: Encyclopedia of Mathematics and its Applications, vol. 2, Addison-Wesley Publishing Co., Reading (1976)
2. Banderier, C., Flajolet, P., Schaeffer, G., Soria, M.: Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Struct. Algorithms 19(3–4), 194–246 (2001)
3. Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Struct. Algorithms 1(2), 127–170 (1990)
4. Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory. Oxford University Press, Oxford (1974)
5. Brodsky, A., Pippenger, N.: The Boolean functions computed by random Boolean formulas or how to grow the right function. Random Struct. Algorithms 27, 490–519 (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献