Janna Burman

Papers

Total Citations

H-Index

About

Janna Burman is a theoretical computer scientist whose research focuses on the design and analysis of distributed algorithms, with a particular emphasis on fault-tolerance, mobile agents, and resource-constrained networks. Her work addresses fundamental challenges in distributed computing, such as exclusive and perpetual tree searching, where mobile agents must coordinate to explore a network without collisions and with guaranteed coverage. In her 2012 brief announcement on this topic, which has garnered 5 citations, Burman introduced novel algorithmic strategies for ensuring that agents can traverse and search a tree structure indefinitely while maintaining exclusivity—a critical property for applications in network maintenance and data retrieval. This contribution, though concise, reflects her broader impact on the field of distributed computing, where her research has been cited over 100 times. Burman's work is notable for its rigorous theoretical foundations and its practical implications for systems that must operate reliably in dynamic and unpredictable environments. Her achievements include advancing the understanding of how to achieve efficient, fault-tolerant coordination among distributed entities, making her a respected voice in the distributed algorithms community.