Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. - Ali Akhavi (ESA, 1999)

Average Bit-Complexity of Euclidean Algorithms. - Ali Akhavi; Brigitte Vallée (ICALP, 2000)

Worst-Case Complexity of the Optimal LLL Algorithm. - Ali Akhavi (LATIN, 2000)

Random lattices, threshold phenomena and efficient reduction algorithms. - Ali Akhavi (Theor. Comput. Sci., 2002)

The optimal LLL algorithm is still polynomial in fixed dimension. - Ali Akhavi (Theor. Comput. Sci., 2003)

Another View of the Gaussian Algorithm. - Ali Akhavi; Céline Moreira Dos Santos (LATIN, 2004)

On the Reduction of a Random Basis. - Ali Akhavi; Jean-François Marckert; Alain Rouault (ANALCO, 2007)

Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). - Ali Akhavi; Damien Stehlé (LATIN, 2008)

On the Finiteness Problem for Automaton (Semi)Groups. - Ali Akhavi; Ines Klimann; Sylvain Lombardy; Jean Mairesse; Matthieu Picantin (Int. J. Algebra Comput., 2012)

Dichotomic Selection on Words: A Probabilistic Analysis. - Ali Akhavi; Julien Clément 001; Dimitri Darthenay; Loïck Lhote; Brigitte Vallée (CPM, 2019)

Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk). - Ali Akhavi; Frédéric Paccaut; Brigitte Vallée (AofA, 2022)

Shannon Weights for binary dynamical recurrent sources of zero entropy. - Ali Akhavi; Eda Cesaratto; Frédéric Paccaut; Pablo Rotondo; Brigitte Vallée (CoRR, 2025)