# Avery Miller

Assistant Professor

Department of Computer Science

University of Manitoba

Assistant Professor

Department of Computer Science

University of Manitoba

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.

If you are interested in graduate studies and you think that I would be a suitable supervisor, don't hesitate to contact me!

- Winter 2017: Introduction to the Theory of Distributed Systems (COMP 7810)
- Fall 2016: Automata Theory and Formal Languages (COMP 3030)

Avery Miller, Andrzej Pelc. “Deterministic Distributed Construction of T-Dominating Sets in Time T”, *Discrete Applied Mathematics*, to appear.
Christian Glacet, Avery Miller, Andrzej Pelc. “Time vs. information tradeoffs for leader election in anonymous trees”, *ACM Transactions on Algorithms*, to appear.
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.

(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.

(ALGOSENSORS 2016, to appear)

(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.

(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.

(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.

(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.

(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.

(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.

(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.

(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.

(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.