Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Nodes of large degree in random trees and forests
Random Structures & Algorithms
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Random mappings with restricted preimages
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
| Hi-index | 0.00 |
We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total predecessors.