Ali Akhavi

15 papers A* 1A 1B 4C 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Shannon Weights for binary dynamical recurrent sources of zero entropy.
CoRR
Ali Akhavi, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Brigitte Vallée
2022 C conf
Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk).
AofA
Ali Akhavi, Frédéric Paccaut, Brigitte Vallée
2019 B conf
Dichotomic Selection on Words: A Probabilistic Analysis.
CPM
Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée
2012 J jnl
On the Finiteness Problem for Automaton (Semi)Groups.
Int. J. Algebra Comput.
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
2011 J jnl
On the Finiteness Problem for Automaton (Semi)groups
CoRR
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
2008 B conf
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract).
LATIN
Ali Akhavi, Damien Stehlé
2007 J jnl
Another view of the Gaussian algorithm
CoRR
Ali Akhavi, Céline Moreira Dos Santos
2007 — conf
On the Reduction of a Random Basis.
ANALCO
Ali Akhavi, Jean-François Marckert, Alain Rouault
2006 J jnl
On the reduction of a random basis
CoRR
Ali Akhavi, Jean-François Marckert, Alain Rouault
2004 B conf
Another View of the Gaussian Algorithm.
LATIN
Ali Akhavi, Céline Moreira Dos Santos
2003 J jnl
The optimal LLL algorithm is still polynomial in fixed dimension.
Theor. Comput. Sci.
Ali Akhavi
2002 J jnl
Random lattices, threshold phenomena and efficient reduction algorithms.
Theor. Comput. Sci.
Ali Akhavi
2000 A* conf
Average Bit-Complexity of Euclidean Algorithms.
ICALP
Ali Akhavi, Brigitte Vallée
2000 B conf
Worst-Case Complexity of the Optimal LLL Algorithm.
LATIN
Ali Akhavi
1999 A conf
Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms.
ESA
Ali Akhavi