Contact Me

Office: E2 - 406 EITC

About Me

My research interests lie in theoretical computer science and algorithms, with a focus on mathematically proving lower bounds on the complexity of problems. I have a strong background and keen interest in graph theory and distributed algorithms.

I received a Ph.D. in Computer Science from the University of Toronto in June 2014 under the supervision of Faith Ellen, and a Bachelor of Mathematics from the University of Waterloo in 2006. I've worked as a postdoc with Andrzej Pelc at the Université du Québec en Outaouais, and with Boaz Patt-Shamir at Tel Aviv University.

Research Opportunities

If you are passionate about algorithms and mathematics, and you are looking for a supervisor for graduate studies (or undergraduate research), then send me an e-mail!

Teaching

Winter 2021:Lower Bounds and Impossibility (COMP 7750/4060)
 Analysis of Algorithms (COMP 2080)
Fall 2020:Automata Theory and Formal Languages (COMP 3030)
Winter 2020:Theory of Distributed Computing (COMP 7750/4060)
 Analysis of Algorithms (COMP 2080)
Fall 2019:Automata Theory and Formal Languages (COMP 3030)
Winter 2019:Lower Bounds and Impossibility (COMP 7750/4060)
 Analysis of Algorithms (COMP 2080)
Fall 2018:Automata Theory and Formal Languages (COMP 3030)
Winter 2018:Lower Bounds and Impossibility (COMP 7750/4060)
 Discrete Mathematics for Computer Science (COMP 2130)
Fall 2017:Automata Theory and Formal Languages (COMP 3030)
Winter 2017:Theory of Distributed Systems (COMP 7810)
Fall 2016:Automata Theory and Formal Languages (COMP 3030)

Conference Papers

Fast Byzantine Gathering with Visibility in Graphs
(ALGOSENSORS 2020)

Avery Miller, Ullash Saha: "Fast Byzantine Gathering with Visibility in Graphs", International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2020), pp. 140-153.

Deterministic Leader Election in Anonymous Radio Networks
(SPAA 2020)

Avery Miller, Andrzej Pelc, Ram Narayan Yadav: "Deterministic Leader Election in Anonymous Radio Networks", ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), pp. 407-417.

Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs
(SOFSEM 2020)

Shahin Kamali, Avery Miller, Kenny Zhang: "Burning Two Worlds", SOFSEM 2020: Theory and Practice of Computer Science, pp. 113-124.

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
(PODC 2019)

Avery Miller, Boaz Patt-Shamir, Will Rosenbaum: "With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing", Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC '19), pp. 117-126.

Constant-Length Labeling Schemes for Deterministic Radio Broadcast
(SPAA 2019 - Best Paper Award)

Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc: "Constant-Length Labeling Schemes for Deterministic Radio Broadcast", ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), pp. 171-178.

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks
(ALGOSENSORS 2018)

A. Miller, "Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks", Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2018), pp. 1-14.

Buffer Size for Routing Limited-Rate Adversarial Traffic
(DISC 2016)

A. Miller, B. Patt-Shamir, "Buffer Size for Routing Limited-Rate Adversarial Traffic", International Symposium on Distributed Computing (DISC 2016), pp. 328-341.

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
(ALGOSENSORS 2016)

K. Hounkanli, A. Miller, A. Pelc: Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2016), pp. 16-28

Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
(SPAA 2016)

A. Miller, A. Pelc, "Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?", ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 377-386.

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
(SODA 2016)

C. Glacet, A. Miller, A. Pelc, "Time vs. Information Tradeoffs for Leader Election in Anonymous Trees", ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 600-609.

Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt
(OPODIS 2014)

A. Miller, A. Pelc, Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt, Proc. 18th International Conference on Principles of Distributed Systems (OPODIS 2014), pp. 263-276.

Fast Rendezvous with Advice
(ALGOSENSORS 2014)

A. Miller, A. Pelc, "Fast rendezvous with advice", Proc. 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2014), pp. 75-87.

Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks
(PODC 2014)

A. Miller, A. Pelc, "Time versus cost tradeoffs for deterministic rendezvous in networks", Proc. 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014), pp. 282-290.

On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks
(ALGOSENSORS 2013)

A. Miller, "On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks", Proc. 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013), pp. 244-259.

Gossiping in one-dimensional synchronous ad hoc wireless radio networks
(TADDS 2012)

A. Miller, "Gossiping in one-dimensional synchronous ad hoc wireless radio networks", Proc. 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012), pp. 32-43.

Meeting your Neighbours
(ICALP2011GT)

A. Miller, "Meeting Your Neigbours", Proc. ICALP2011GT Algorithms and Data Structures for selection, identification and encoding: proceedings of the ICALP 2011 Group Testing Workshop, pp. 1-19.

Gossiping in Jail
(ALGOSENSORS 2009)

A. Miller, "Gossiping in Jail." Proc. 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2009), LNCS 5804, pp. 242-251.

Journal Publications

Kokouvi Hounkanli, Avery Miller, Andrzej Pelc. "Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel", Theoretical Computer Science, Volume 806, pp. 567-576.                                                                   Avery Miller, Andrzej Pelc. "Deterministic distributed construction of T-dominating sets in time T", Discrete Applied Mathematics, Volume 222, 11 May 2017, Pages 172-178.                                                                   Christian Glacet, Avery Miller, and Andrzej Pelc. Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. ACM Trans. Algorithms 13, 3, Article 31 (March 2017)                                                                   Avery Miller, Andrzej Pelc. "Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks", Distributed Computing 29(1): pp. 51-64 (2016).                                                                    Avery Miller, Andrzej Pelc. "Fast rendezvous with advice", Theoretical Computer Science, Volume 608, Part 2, December 2015, pp. 190-198.                                                  Avery Miller. "On the complexity of neighbourhood learning in radio networks", Theoretical Computer Science, Volume 608, Part 2, December 2015, pp. 135-145.                                                                    Avery Miller, Andrzej Pelc. "Tradeoffs between cost and information for rendezvous and treasure hunt", Journal of Parallel and Distributed Computing, Volume 83, September 2015, pp. 159-167. Krieger, D., Miller, A., Rampersad, N., Ravikumar, B., and Shallit, J. 2009. "Decimations of languages and state complexity." Theoretical Computer Science 410, 24-25 (May. 2009), pp. 2401-2409.