A complexity analysis of a Jacobi method for lattice basis reduction

Zhaofei Tian, Sanzheng Qiao. A complexity analysis of a Jacobi method for lattice basis reduction. In Bipin C. Desai, Emil Vassev, Sudhir P. Mudur, Bipin C. Desai, editors, Fifth International C* Conference on Computer Science & Software Engineering, C3S2E '12, Montreal, QC, Canada, June 27-29, 2012. pages 53-60, ACM, 2012. [doi]

@inproceedings{TianQ12,
  title = {A complexity analysis of a Jacobi method for lattice basis reduction},
  author = {Zhaofei Tian and Sanzheng Qiao},
  year = {2012},
  doi = {10.1145/2347583.2347590},
  url = {http://doi.acm.org/10.1145/2347583.2347590},
  researchr = {https://researchr.org/publication/TianQ12},
  cites = {0},
  citedby = {0},
  pages = {53-60},
  booktitle = {Fifth International C* Conference on Computer Science & Software Engineering, C3S2E '12, Montreal, QC, Canada, June 27-29, 2012},
  editor = {Bipin C. Desai and Emil Vassev and Sudhir P. Mudur and Bipin C. Desai},
  publisher = {ACM},
  isbn = {978-1-4503-1084-0},
}