Search In
/g>
  • A-Z Index
  • Faculty & Staff Resources
  • Jump
  • Make a Gift
  • UM Learn
  • Webmail
  • Search
Search
Search In
  • Welcome
  • Undergraduate
    • Undergraduate Programs
    • Courses
    • Help Centre
    • Research Opportunities
    • Science Co-op
  • Graduate
    • Graduate Programs
    • Applying
    • Tuition and funding
    • Courses
    • Policies and Forms
  • People
    • Faculty Staff
    • Support Staff
  • Events
  • Research
    • Covid19 – Building Access Log
  • Co-op
  • Resources
Home>profiles>milleravery

Avery Miller

Profile
Curriculum Vitae
Select Publications
Avery Miller
Associate Professor
(204) 474-8681
amiller@cs.umanitoba.ca

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

Links

http://www.cs.umanitoba.ca/~amiller/
  • Postdoctoral Researcher at Tel Aviv University (supervised by Boaz Patt-Shamir)
  • Postdoctoral Researcher at Université du Québec en Outaouais (supervised by Andrzej Pelc)
  • Ph.D. and M.Sc. in Computer Science from the University of Toronto (supervised by Faith Ellen)
  • B.Math. in Computer Science, Combinatorics and Optimization from the University of Waterloo

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.

Contact & Social Media
Asset 5
Asset 8
MAKE
A GIFT
General
Welcome
Resources
Twitter
Undergraduate
Undergraduate Programs
Courses
Help Centre
Research Opportunities
Graduate Programs
Programs
Applying
Courses
Tuition and funding
Policies and Forms
People
Faculty
Support Staff
Co-op

DEPARTMENT OF COMPUTER SCIENCE
E2-445 EITC, University of Manitoba,
Winnipeg, MB CANADA R3T 2N2
PHONE: 204-474-8313 PHONE: 204-474-7609 EMAIL: queries@cs.umanitoba.ca
@ 2018 UNIVERSITY OF MANITOBA

For technical issues, or comments related to any information presented on this site please email us.

  • Privacy Policy