Prof. Liam Roditty

Algorithms, Data Structures, and Dynamic Networks

When a navigation app recalculates a route due to traffic, an accident, or a road closure, it must quickly update the best path to your destination. Behind this simple action lies a complex computational challenge: how do you update a massive network of connections and paths without recalculating everything from scratch every time something changes? Prof. Liam Roditi develops the exact algorithms that manage this information and update it in real-time.

A central focus of his research is Dynamic Algorithms: algorithms designed to handle real-time changes, such as when connections in a network are added, deleted, or modified. His work also encompasses Computational Geometry and Wireless Networking Algorithms, seamlessly bridging the gap between deep theory and practical applications.

Key Research Areas:

• Dynamic Graph Algorithms: Real-time updates for complex networks.

• Shortest Paths & Approximations: Finding optimal routes efficiently.

• Computational Geometry: Solving geometric problems through algorithmic efficiency.

• Wireless Networking Algorithms: Optimization of communication in wireless environments.

Research Nature:

 Theoretical-Applied: Developing rigorous mathematical proofs alongside testing applications in real-world environments, such as road networks and the internet.

Career Paths:

Graduates of the lab successfully integrate into various high-impact roles:

• Industry: Algorithm Developers and Infrastructure Engineers at leading technology companies.

• Academia: Researchers and lecturers in Algorithmics and Graph Theory.