Avery Miller

Orcid: 0000-0002-8231-3697

Affiliations:
  • University of Manitoba, Winnipeg, Manitoba, Canada


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reconfiguration of Multisets with Applications to Bin Packing.
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Four shades of deterministic leader election in anonymous networks.
Distributed Comput., December, 2023

Fast Deterministic Rendezvous in Labeled Lines.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Cops and Robbers on 1-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
Deterministic Leader Election in Anonymous Radio Networks.
ACM Trans. Algorithms, 2022

2021
Constant-Length Labeling Schemes for Deterministic Radio Broadcast.
ACM Trans. Parallel Comput., 2021

Labeling Schemes for Deterministic Radio Multi-broadcast.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel.
Theor. Comput. Sci., 2020

Burning Two Worlds.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Efficient Privacy-Preserving Approaches for Trajectory Datasets.
Proceedings of the IEEE Intl Conf on Dependable, 2020

Fast Byzantine Gathering with Visibility in Graphs.
Proceedings of the Algorithms for Sensor Systems, 2020

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

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
SIROCCO 2018 Review.
SIGACT News, 2018

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks.
Proceedings of the Algorithms for Sensor Systems, 2018

2017
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees.
ACM Trans. Algorithms, 2017

Deterministic distributed construction of T-dominating sets in time T.
Discret. Appl. Math., 2017

2016
Time versus cost tradeoffs for deterministic rendezvous in networks.
Distributed Comput., 2016

Buffer Size for Routing Limited-Rate Adversarial Traffic.
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?
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Deterministic Neighbourhood Learning in Ad Hoc Wireless Radio Networks.
PhD thesis, 2015

Fast rendezvous with advice.
Theor. Comput. Sci., 2015

On the complexity of neighbourhood learning in radio networks.
Theor. Comput. Sci., 2015

Tradeoffs between cost and information for rendezvous and treasure hunt.
J. Parallel Distributed Comput., 2015

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

2013
On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Gossiping in one-dimensional synchronous ad hoc wireless radio networks.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

2009
Decimations of languages and state complexity.
Theor. Comput. Sci., 2009

Gossiping in Jail.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009


  Loading...