The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
Optimal routing in double loop networks
Theoretical Computer Science
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms (TALG)
Efficient lattice width computation in arbitrary dimension
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Computing efficiently the lattice width in any dimension
Theoretical Computer Science
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The exact lattice width of planar sets and minimal arithmetical thickness
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Operations Research Letters
| Hi-index | 0.00 |