On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms. - Rafik Aguech; Eric Moulines; Pierre Priouret (SIAM J. Control. Optim., 2000)

Distances in random digital search trees. - Rafik Aguech; Nabil Lasmar; Hosam M. Mahmoud (Acta Informatica, 2006)

On weighted depths in random binary search trees. - Rafik Aguech; Anis Amri; Henning Sulzbach (CoRR, 2017)

Some properties of exponential trees. - Rafik Aguech; Sudip Bose; Hosam M. Mahmoud; Yi Zhang (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Height of walks with resets, the Moran model, and the discrete Gumbel distribution. - Rafik Aguech; Asma Althagafi; Cyril Banderier (CoRR, 2023)

On the protected nodes in exponential recursive trees. - Mehri Javanian; Rafik Aguech (Discret. Math. Theor. Comput. Sci., 2023)

Unbalanced multi-drawing urn with random addition matrix II. - Rafik Aguech; Wissem Jedidi; Olfa Selmi (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

Elephant Random Walk with a Random Step Size and Gradually Increasing Memory and Delays. - Rafik Aguech (Axioms, 2024)

Exponentially preferential trees. - Rafik Aguech; Hosam M. Mahmoud; Hanene Mohamed; Zhou Yang (Netw. Sci., 2025)