The following pages link to (Q3915690):
Displaying 40 items.
- The probability of successful allocation of particles in cells (the general case) (Q267595) (← links)
- Images of a finite set under iterations of two random dependent mappings (Q314215) (← links)
- Large cliques in sparse random intersection graphs (Q528977) (← links)
- From local interactions to population dynamics in site-based models of ecology (Q851327) (← links)
- On the average complexity of some bucketing algorithms (Q1157091) (← links)
- On numbers related to partitions of unlike objects and occupancy problems (Q1170195) (← links)
- Estimates of the mean size of the subset image under composition of random mappings (Q1741464) (← links)
- Optimal estimation of variance in nonparametric regression with random design (Q1996785) (← links)
- On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme (Q1996836) (← links)
- On the number of empty cells in a non-homogeneous allocation scheme (Q2019647) (← links)
- Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings (Q2032148) (← links)
- Computation of distributions of statistics by means of Markov chains (Q2081009) (← links)
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks (Q2099818) (← links)
- Poisson limit theorems in an allocation scheme with an even number of particles in each cell (Q2207030) (← links)
- On the minimum value of a cell from a pointed set of cells (Q2314450) (← links)
- On the maximal value of a cell from a pointed set of cells (Q2314504) (← links)
- Poisson limit theorems for number of given value cells in non-homogeneous generalized allocation scheme (Q2319678) (← links)
- Limit theorems for number of particles from a fixed set of cells (Q2319679) (← links)
- On the asymptotic distribution of the multinomial maximum with an increasing number of classes (Q2352974) (← links)
- Limit theorems for empirical Rényi entropy and divergence with applications to molecular diversity analysis (Q2397985) (← links)
- Hopf algebras and Markov chains: two examples and a theory (Q2454080) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations (Q2688838) (← links)
- In Memory of B. A. Sevast'yanov (29.09.1923--30.08.2013) (Q2790688) (← links)
- Beating the Birthday Paradox in Dining Cryptographer Networks (Q2946474) (← links)
- How much data may be safely processed on one key in different modes? (Q3383073) (← links)
- The probability generating function of empty cell variable in a randomized occupancy problem (Q3703007) (← links)
- Mixing Rates for a Random Walk on the Cube (Q3777197) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- On the number of empty cells in the allocation scheme of indistinguishable particles (Q5129934) (← links)
- Poisson limit theorems in allocation schemes of distinguishable particles (Q5138428) (← links)
- Weak Convergence of Finite-Dimensional Distributions of the Number of Empty Boxes in the Bernoulli Sieve (Q5252474) (← links)
- Improved Side-Channel Collision Attacks on AES (Q5452248) (← links)
- Asymptotics of the overflow in urn models (Q5868529) (← links)
- Balanced Allocation: Patience Is Not a Virtue (Q5885582) (← links)
- Limit theorem for stationary distribution of a critical controlled branching process with immigration (Q6067839) (← links)
- On a functional of the number of nonoverlapping chains appearing in the polynomial scheme and its connection with entropy (Q6084895) (← links)
- Approaching the coupon collector’s problem with group drawings via Stein’s method (Q6148880) (← links)
- On a number of particles in a marked set of cells in a general allocation scheme (Q6169629) (← links)
- Classical and almost sure local limit theorems (Q6190569) (← links)
