( en | de | ru )

 

Disambiguation of "Akhavi, Ali"

Author of the publication

copydeleteadd this publication to your clipboard
On the Finiteness Problem for Automaton (Semi)groups

, , , , and . (2011)cite http://arxiv.org/abs/1105.4725arxiv:1105.4725.
DOI: 10.1142/S021819671250052X

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

ali

Ali Aassie Ali

Ali Yasen Ali

Ali Ramadan Ali

Ali Al-Ali

 

Other publications of authors with the same name

The optimal LLL algorithm is still polynomial in fixed dimension.. Theor. Comput. Sci., 297 (1-3): 3-23 (2003)On the Finiteness Problem for Automaton (Semi)groups, , , , and . (2011)cite http://arxiv.org/abs/1105.4725arxiv:1105.4725.Dichotomic Selection on Words: A Probabilistic Analysis., , , , and . CPM, volume 128 of LIPIcs, page 19:1-19:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Another View of the Gaussian Algorithm., and . LATIN, volume 2976 of Lecture Notes in Computer Science, page 474-487. Springer, (2004)Random lattices, threshold phenomena and efficient reduction algorithms.. Theor. Comput. Sci., 287 (2): 359-385 (2002)Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk)., , and . AofA, volume 225 of LIPIcs, page 1:1-1:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Finiteness Problem for Automaton (Semi)Groups., , , , and . Int. J. Algebra Comput., (2012)On the Reduction of a Random Basis., , and . ANALCO, page 265-270. SIAM, (2007)Worst-Case Complexity of the Optimal LLL Algorithm.. LATIN, volume 1776 of Lecture Notes in Computer Science, page 355-366. Springer, (2000)Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms.. ESA, volume 1643 of Lecture Notes in Computer Science, page 476-489. Springer, (1999)