Akshaya Srinivasan

Papers

Total Citations

H-Index

About

Akshaya Srinivasan is a leading researcher in theoretical computer science, with a primary focus on online algorithms, robotics, and computational geometry. Her most significant contribution lies in the classic problem of shoreline searching, where she dramatically improved the best-known lower bound for the competitive ratio of two robots searching for a line on the plane. While the previous lower bound stood at 1.5993, Srinivasan’s 2020 work shattered this, proving a new lower bound of 3. This result, published in a top venue and garnering 8 citations, represents a major leap in understanding the fundamental limits of multi-robot search, a problem dating back to the 1950s. Her work not only provides a tighter theoretical benchmark but also deepens our comprehension of the trade-offs between speed, coordination, and uncertainty in autonomous search. Srinivasan’s research is essential reading for anyone studying online algorithms, competitive analysis, or multi-agent systems, as it elegantly combines rigorous lower bound techniques with a long-standing open problem in the field.