Search the dblp DataBase

Publications of Author

1. Ali Akhavi
   Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. [Citation Graph (0, 0)][DBLP]
   ESA, 1999, pp:476-489 [Conf]
   
2. Ali Akhavi, Brigitte Vallée
   Average Bit-Complexity of Euclidean Algorithms. [Citation Graph (0, 0)][DBLP]
   ICALP, 2000, pp:373-387 [Conf]
   
3. Ali Akhavi
   Worst-Case Complexity of the Optimal LLL Algorithm. [Citation Graph (0, 0)][DBLP]
   LATIN, 2000, pp:355-366 [Conf]
   
4. Ali Akhavi, Céline Moreira Dos Santos
   Another View of the Gaussian Algorithm. [Citation Graph (0, 0)][DBLP]
   LATIN, 2004, pp:474-487 [Conf]
   
5. Ali Akhavi
   Random lattices, threshold phenomena and efficient reduction algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:359-385 [Journal]
   
6. Ali Akhavi
   The optimal LLL algorithm is still polynomial in fixed dimension. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:297, pp:3-23 [Journal]
   
7. Ali Akhavi, Jean-François Marckert, Alain Rouault
   On the reduction of a random basis [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
8. Ali Akhavi, Céline Moreira Dos Moreira
   Another view of the Gaussian algorithm [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
9. 
   Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). [Citation Graph (, )][DBLP]