Ashley Farrugia

University of Liverpool, Capgemini (United Kingdom)

Papers

Total Citations

H-Index

About

Ashley Farrugia is a theoretical computer scientist whose work focuses on the fundamental problem of deterministic rendezvous—how two or more mobile agents can meet in a network without relying on randomness. Her research explores the limits of what can be achieved when agents have limited knowledge of their environment, particularly in restricted graph topologies. In her most-cited work, "Deterministic Rendezvous in Restricted Graphs" (2015, 7 citations), Farrugia established key algorithmic bounds for agents operating with identical maps, while her follow-up paper "Deterministic Rendezvous with Different Maps" (2019, 3 citations) extended these results to the more challenging scenario where agents possess distinct information about the network. Though her citation counts are modest, her contributions are notable for their rigorous theoretical framing and for addressing open questions in distributed computing. Farrugia’s work is particularly valuable for researchers studying mobile agent coordination, network exploration, and the power of deterministic algorithms in resource-constrained settings. Her results provide foundational insights that continue to inform the design of efficient rendezvous protocols in both theoretical and applied contexts.