An Improved Worst-Case to Average-Case Connection for Lattice Problems. - Jin-yi Cai; Ajay Nerurkar (FOCS, 1997)

Approximating the SVP to within a factor (1 + 1/dimepsilon) is NP-hard under randomized reductions - Jin-yi Cai; Ajay Nerurkar (Electron. Colloquium Comput. Complex., 1997)

Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. - Jin-yi Cai; Ajay Nerurkar (CCC, 1998)

On Routing in Circulant Graphs. - Jin-yi Cai; George Havas; Bernard Mans; Ajay Nerurkar; Jean-Pierre Seifert; Igor E. Shparlinski (COCOON, 1999)

Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. - Jin-yi Cai; Ajay Nerurkar; D. Sivakumar (STOC, 1999)

Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions. - Jin-yi Cai; Ajay Nerurkar (J. Comput. Syst. Sci., 1999)

A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. - Jin-yi Cai; Ajay Nerurkar (Inf. Process. Lett., 2000)