K. B. Ajitha Shenoy

Papers

Total Citations

H-Index

About

K. B. Ajitha Shenoy is a researcher whose work bridges computational complexity and practical algorithmic design, with a particular focus on lattice-based problems. Her most notable contribution lies in applying the Metropolis Algorithm—a staple of statistical mechanics—to the notoriously difficult Shortest Lattice Vector Problem (SVP), a challenge with far-reaching applications from robotics to polynomial factorization. Her 2011 paper on this approach, which has garnered 6 citations, demonstrates an innovative cross-disciplinary strategy that reimagines classical optimization techniques for hard computational tasks. By exploring both the standard Metropolis method and its generalizations, Shenoy has provided a fresh perspective on solving SVP, a problem central to fields like cryptography and number theory. Her work exemplifies how borrowing principles from physics can yield novel solutions in computer science, making her research particularly valuable for students and researchers interested in algorithmic design, computational number theory, and the intersection of randomized algorithms with lattice-based problems.