![]() | ![]() |
| 2011 | ||
|---|---|---|
| 10 | Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin: On the Finiteness Problem for Automaton (Semi)groups CoRR abs/1105.4725: (2011) | |
| 2008 | ||
| 9 | Ali Akhavi, Damien Stehlé: Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). LATIN 2008: 293-305 | |
| 2007 | ||
| 8 | Ali Akhavi, Céline Moreira Dos Moreira: Another view of the Gaussian algorithm CoRR abs/0707.0644: (2007) | |
| 2006 | ||
| 7 | Ali Akhavi, Jean-François Marckert, Alain Rouault: On the reduction of a random basis CoRR abs/math/0604331: (2006) | |
| 2004 | ||
| 6 | Ali Akhavi, Céline Moreira Dos Santos: Another View of the Gaussian Algorithm. LATIN 2004: 474-487 | |
| 2003 | ||
| 5 | Ali Akhavi: The optimal LLL algorithm is still polynomial in fixed dimension. Theor. Comput. Sci. 297(1-3): 3-23 (2003) | |
| 2002 | ||
| 4 | Ali Akhavi: Random lattices, threshold phenomena and efficient reduction algorithms. Theor. Comput. Sci. 287(2): 359-385 (2002) | |
| 2000 | ||
| 3 | Ali Akhavi, Brigitte Vallée: Average Bit-Complexity of Euclidean Algorithms. ICALP 2000: 373-387 | |
| 2 | Ali Akhavi: Worst-Case Complexity of the Optimal LLL Algorithm. LATIN 2000: 355-366 | |
| 1999 | ||
| 1 | Ali Akhavi: Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. ESA 1999: 476-489 | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page