The following pages link to Rafik Aguech (Q852007):
Displaying 15 items.
- Distances in random digital search trees (Q852009) (← links)
- New characterizations of completely monotone functions and Bernstein functions, a converse to Hausdorff's moment characterization theorem (Q1713872) (← links)
- On weighted depths in random binary search trees (Q1800490) (← links)
- (Q2959888) (← links)
- Limit Theorems for Random Triangular URN Schemes (Q3182434) (← links)
- Limit distribution of distances in biased random tries (Q3410921) (← links)
- On the asymptotic independent representations for sums of some weakly dependent random variables (Q3414132) (← links)
- EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES (Q3430661) (← links)
- On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms (Q4507483) (← links)
- Nonhomogenous bivariate fragmentation process: Asymptotic distribution via contraction method (Q4957849) (← links)
- (Q5485347) (← links)
- Moments of a non‐homogenous bi‐variate fragmentation process using integral equations tools (Q6091742) (← links)
- Gaussian fluctuations of the elephant random walk with gradually increasing memory (Q6121756) (← links)
- Corrigendum to: ``Gaussian fluctuations of the elephant random walk with gradually increasing memory'' (Q6592174) (← links)
- On the protected nodes in exponential recursive trees (Q6599805) (← links)
