Ali Akhavi

According to our database, Ali Akhavi authored at least 11 papers between 1999 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk).

Ali Akhavi, Frédéric Paccaut, Brigitte Vallée

Proceedings of the 33rd International Conference on Probabilistic, 2022

2019

Dichotomic Selection on Words: A Probabilistic Analysis.

Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2012

On the Finiteness Problem for Automaton (Semi)Groups.

Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin

Int. J. Algebra Comput., 2012

2008

Speeding-Up Lattice Reduction with Random Projections (Extended Abstract).

Ali Akhavi, Damien Stehlé

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

On the Reduction of a Random Basis.

Ali Akhavi, Jean-François Marckert, Alain Rouault

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2004

Another View of the Gaussian Algorithm.

Ali Akhavi, Céline Moreira Dos Santos

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

The optimal LLL algorithm is still polynomial in fixed dimension.

Ali Akhavi

Theor. Comput. Sci., 2003

2002

Random lattices, threshold phenomena and efficient reduction algorithms.

Ali Akhavi

Theor. Comput. Sci., 2002

2000

Worst-Case Complexity of the Optimal LLL Algorithm.

Ali Akhavi

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Average Bit-Complexity of Euclidean Algorithms.

Ali Akhavi, Brigitte Vallée

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms.

Ali Akhavi

Proceedings of the Algorithms, 1999