Avery Miller

Profile

Curriculum Vitae

Select Publications

Name: Avery Miller

Position Title: Assistant Professor

Office Phone Number: (204) 474-8681

Research and Teaching Interests

My research interests lie in theoretical computer science and algorithms, with a focus on mathematically proving lower bounds on the complexity of problems. I tend to be attracted to problems that involve graph theory in some way, and so far have focused on questions about communication in networks (wired or wireless), and mobile agents in networks. I have also been intrigued on the role of information in algorithm design: what kind of knowledge enables us to solve difficult problems efficiently, or even at all?

Courses taught

COMP 7750/4060 – Lower Bounds and Impossibility
COMP 7750/4060 – Theory of Distributed Systems
COMP 3030 – Automata Theory and Formal Languages
COMP 2080 – Analysis of Algorithms
COMP 2130 – Discrete Mathematics for Computer Science

2019

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.

2016

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

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.

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.

2009

D. Krieger, A. Miller, N. Rampersad, B. Ravikumar, and J. Shallit, “Decimations of languages and state complexity.” Theoretical Computer Science 410, 24-25 (May. 2009), pp. 2401-2409.