Sumi Acharjee

Papers

Total Citations

H-Index

About

Sumi Acharjee is a theoretical computer scientist whose work pushes the boundaries of algorithmic robotics and online search theory. Her research centers on the fundamental problem of shoreline searching—a classic online challenge where robots must locate a hidden line on the plane with minimal time. In her most cited work (2020, 8 citations), Acharjee achieved a striking breakthrough: she improved the lower bound for two-robot shoreline search from 1.5993 to 3, nearly doubling the previously known limit. This result, which addresses a problem dating back to the 1950s, provides a significantly tighter understanding of the inherent difficulty of cooperative search under uncertainty. Her contributions are essential for researchers studying competitive analysis, multi-agent coordination, and geometric searching. By establishing stronger impossibility results, Acharjee’s work helps clarify the boundaries of what can be achieved with limited robots and incomplete information—a cornerstone question in online algorithms. Her research continues to inspire new directions in distributed search and adversarial analysis.