Author:
Mans Bernard,Shparlinski Igor
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Ádám, A.: Research problem 2-10. J. Combinatorial Theory 3, 393 (1967)
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM STOC, Crete, Greece, July 6-8, pp. 601–610 (2001)
3. Ahmadi, A., Belk, R., Tamon, C., Wendler, C.: Mixing in Continuous Quantum Walks on Graphs (April 2003),
xxx.arxiv.cornell.edu/pdf/quant-ph/0209106
4. Annexstein, F., Baumslag, M.: On the diameter and bisector size of Cayley graphs. Mathematical Systems Theory 26, 271–291 (1993)
5. Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6, 11–13 (1986)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献