Avery Miller

According to our database, Avery Miller authored at least 30 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Reconfiguration of Multisets with Applications to Bin Packing.

Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Fast Deterministic Rendezvous in Labeled Lines.

Avery Miller, Andrzej Pelc

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Cops and Robbers on 1-Planar Graphs.

Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2021

Labeling Schemes for Deterministic Radio Multi-broadcast.

Colin Krisko, Avery Miller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Four Shades of Deterministic Leader Election in Anonymous Networks.

Barun Gorain, Avery Miller, Andrzej Pelc

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020

Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel.

Kokouvi Hounkanli, Avery Miller, Andrzej Pelc

Theor. Comput. Sci., 2020

Deterministic Leader Election in Anonymous Radio Networks.

Avery Miller, Andrzej Pelc, Ram Narayan Yadav

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Burning Two Worlds.

Shahin Kamali, Avery Miller, Kenny Zhang

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Efficient Privacy-Preserving Approaches for Trajectory Datasets.

Md Yeakub Hassan, Ullash Saha, Noman Mohammed, Stephane Durocher, Avery Miller

Proceedings of the IEEE Intl Conf on Dependable, 2020

Fast Byzantine Gathering with Visibility in Graphs.

Avery Miller, Ullash Saha

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs.

Shahin Kamali, Avery Miller, Kenny Zhang

CoRR, 2019

Constant-Length Labeling Schemes for Deterministic Radio Broadcast.

Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing.

Avery Miller, Boaz Patt-Shamir, Will Rosenbaum

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

SIROCCO 2018 Review.

Avery Miller

SIGACT News, 2018

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks.

Avery Miller

Proceedings of the Algorithms for Sensor Systems, 2018

2017

Deterministic distributed construction of T-dominating sets in time T.

Avery Miller, Andrzej Pelc

Discret. Appl. Math., 2017

2016

Buffer Size for Routing Limited-Rate Adversarial Traffic.

Avery Miller, Boaz Patt-Shamir

Proceedings of the Distributed Computing - 30th International Symposium, 2016

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

Avery Miller, Andrzej Pelc

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees.

Christian Glacet, Avery Miller, Andrzej Pelc

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC.

Kokouvi Hounkanli, Avery Miller, Andrzej Pelc

Proceedings of the Algorithms for Sensor Systems, 2016

2015

Deterministic Neighbourhood Learning in Ad Hoc Wireless Radio Networks.

Avery Miller

PhD thesis, 2015

On the complexity of neighbourhood learning in radio networks.

Avery Miller

Theor. Comput. Sci., 2015

2014

Election vs. Selection: Two Ways of Finding the Largest Node in a Graph.

Avery Miller, Andrzej Pelc

CoRR, 2014

Time versus cost tradeoffs for deterministic rendezvous in networks.

Avery Miller, Andrzej Pelc

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt.

Avery Miller, Andrzej Pelc

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Fast Rendezvous with Advice.

Avery Miller, Andrzej Pelc

Proceedings of the Algorithms for Sensor Systems, 2014

2013

On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks.

Avery Miller

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Gossiping in one-dimensional synchronous ad hoc wireless radio networks.

Avery Miller

Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

2009

Decimations of languages and state complexity.

Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey O. Shallit

Theor. Comput. Sci., 2009

Gossiping in Jail.

Avery Miller

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009