Calum MacRury

University of Toronto, Dalhousie University, McGill University

Papers

Total Citations

H-Index

About

Calum MacRury is a researcher whose work lies at the intersection of theoretical computer science and graph theory, with a particular focus on search algorithms and dynamic graph processes. His most-cited paper, "Algorithms for p-Faulty Search on a Half-Line" (2022, 7 citations), addresses a fundamental problem in search theory: how to efficiently locate a target when the searcher’s sensors may fail with a known probability. This contribution is significant for its algorithmic insights into fault-tolerant search, a critical area for robotics and autonomous systems. MacRury also introduced the concept of the "robot crawler number" of a graph (2015), defining a new graph invariant that measures the minimum number of robots needed to traverse all edges of a graph in a coordinated crawl. This work was extended in "The robot crawler graph process" (2018), which models the dynamic evolution of such traversals. Though his citation counts are modest, MacRury’s research is notable for its originality in blending combinatorial optimization with real-world constraints, offering foundational models that inspire further study in distributed computing and network exploration.