Gossiping in Jail. - Avery Miller (ALGOSENSORS, 2009)

Decimations of languages and state complexity. - Dalia Krieger; Avery Miller; Narad Rampersad; Bala Ravikumar; Jeffrey O. Shallit (Theor. Comput. Sci., 2009)

Gossiping in one-dimensional synchronous ad hoc wireless radio networks. - Avery Miller (TADDS, 2012)

On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks. - Avery Miller (ALGOSENSORS, 2013)

Election vs. Selection: Two Ways of Finding the Largest Node in a Graph. - Avery Miller; Andrzej Pelc (CoRR, 2014)

Tradeoffs between cost and information for rendezvous and treasure hunt. - Avery Miller; Andrzej Pelc (J. Parallel Distributed Comput., 2015)

On the complexity of neighbourhood learning in radio networks. - Avery Miller (Theor. Comput. Sci., 2015)

Fast rendezvous with advice. - Avery Miller; Andrzej Pelc (Theor. Comput. Sci., 2015)

Deterministic Neighbourhood Learning in Ad Hoc Wireless Radio Networks. - Avery Miller (2015)

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. - Kokouvi Hounkanli; Avery Miller; Andrzej Pelc (ALGOSENSORS, 2016)

Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? - Avery Miller; Andrzej Pelc (SPAA, 2016)

Buffer Size for Routing Limited-Rate Adversarial Traffic. - Avery Miller; Boaz Patt-Shamir (DISC, 2016)

Time versus cost tradeoffs for deterministic rendezvous in networks. - Avery Miller; Andrzej Pelc (Distributed Comput., 2016)

Deterministic distributed construction of T-dominating sets in time T. - Avery Miller; Andrzej Pelc (Discret. Appl. Math., 2017)

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. - Christian Glacet; Avery Miller; Andrzej Pelc (ACM Trans. Algorithms, 2017)

Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks. - Avery Miller (ALGOSENSORS, 2018)

SIROCCO 2018 Review. - Avery Miller (SIGACT News, 2018)

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. - Avery Miller; Boaz Patt-Shamir; Will Rosenbaum (PODC, 2019)

Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs. - Shahin Kamali; Avery Miller; Kenny Zhang (CoRR, 2019)

Fast Byzantine Gathering with Visibility in Graphs. - Avery Miller; Ullash Saha (ALGOSENSORS, 2020)

Efficient Privacy-Preserving Approaches for Trajectory Datasets. - Md Yeakub Hassan; Ullash Saha; Noman Mohammed; Stephane Durocher; Avery Miller (DASC/PiCom/CBDCom/CyberSciTech, 2020)

Burning Two Worlds. - Shahin Kamali; Avery Miller; Kenny Zhang (SOFSEM, 2020)

Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel. - Kokouvi Hounkanli; Avery Miller; Andrzej Pelc (Theor. Comput. Sci., 2020)

Labeling Schemes for Deterministic Radio Multi-broadcast. - Colin Krisko; Avery Miller (WG, 2021)

Constant-Length Labeling Schemes for Deterministic Radio Broadcast. - Faith Ellen; Barun Gorain; Avery Miller; Andrzej Pelc (ACM Trans. Parallel Comput., 2021)

Deterministic Leader Election in Anonymous Radio Networks. - Avery Miller; Andrzej Pelc; Ram Narayan Yadav (ACM Trans. Algorithms, 2022)

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 (GD (2), 2023)

Fast Deterministic Rendezvous in Labeled Lines. - Avery Miller; Andrzej Pelc (DISC, 2023)

Four shades of deterministic leader election in anonymous networks. - Barun Gorain; Avery Miller; Andrzej Pelc (Distributed Comput., 2023)

Reconfiguration of Multisets with Applications to Bin Packing. - Jeffrey Kam; Shahin Kamali; Avery Miller; Naomi Nishimura (WALCOM, 2024)