معرفی
Avery Miller is an Associate Professor in the Department of Computer Science at the University of Manitoba. His research focuses on theoretical computer science, particularly distributed algorithms, graph theory, and algorithmic lower bounds. He holds a Ph.D. from the University of Toronto, supervised by Faith Ellen, and has held postdoctoral positions at Tel Aviv University and Université du Québec en Outaouais.
Education:
- Ph.D. in Computer Science, University of Toronto (Supervisor: Faith Ellen)
- M.Sc. in Computer Science, University of Toronto (Supervisor: Faith Ellen)
- B.Math. in Computer Science and Combinatorics & Optimization, University of Waterloo
Research interests include distributed computing in anonymous networks, wireless networks, and graph burning. His work explores deterministic protocols, fault-tolerant systems, and the role of information in distributed algorithms. Recent projects involve reconfiguration of multisets, fast rendezvous in labeled networks, and cop-and-robber games on planar graphs.
Publications highlight contributions to distributed algorithms, radio networks, and graph theory, including a best paper award at SPAA 2019. His work often bridges theoretical foundations with practical network challenges.
Awards:
- Best Paper Award at SPAA 2019
Academic service includes roles as Organizing Chair of PODC 2021, Treasurer of PODC 2020, and committee memberships in SPAA, DISC, and other conferences. He reviews for top journals like ACM Transactions on Algorithms and Theoretical Computer Science.
Teaching includes courses on automata theory, algorithms analysis, and distributed computing. He is part of the Geometric, Approximation, and Distributed Algorithms Lab at the University of Manitoba.
