| Time vs. information tradeoffs for leader election in anonymous trees C Glacet, A Miller, A Pelc ACM Transactions on Algorithms (TALG) 13 (3), 31, 2017 | 34 | 2017 |
| Time versus cost tradeoffs for deterministic rendezvous in networks A Miller, A Pelc Distributed Computing 29 (1), 51-64, 2016 | 25 | 2016 |
| Tradeoffs between cost and information for rendezvous and treasure hunt A Miller, A Pelc Journal of Parallel and Distributed Computing 83, 159-167, 2015 | 24 | 2015 |
| Burning Two Worlds S Kamali, A Miller, K Zhang International Conference on Current Trends in Theory and Practice of …, 2020 | 23 | 2020 |
| Decimations of languages and state complexity D Krieger, A Miller, N Rampersad, B Ravikumar, J Shallit Theoretical Computer Science 410 (24-25), 2401-2409, 2009 | 20 | 2009 |
| Constant-length labeling schemes for deterministic radio broadcast F Ellen, B Gorain, A Miller, A Pelc ACM Transactions on Parallel Computing 8 (3), 1-17, 2021 | 19 | 2021 |
| Fast rendezvous with advice A Miller, A Pelc Theoretical Computer Science 608, 190-198, 2015 | 17 | 2015 |
| Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel K Hounkanli, A Miller, A Pelc Theoretical Computer Science 806, 567-576, 2020 | 15* | 2020 |
| Online graph colouring A Miller Canadian Undergraduate Mathematics Conference, 2004 | 12 | 2004 |
| Buffer size for routing limited-rate adversarial traffic A Miller, B Patt-Shamir Distributed Computing: 30th International Symposium, DISC 2016, Paris …, 2016 | 9 | 2016 |
| Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? A Miller, A Pelc Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016 | 7* | 2016 |
| With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing A Miller, B Patt-Shamir, W Rosenbaum Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 5 | 2019 |
| Gossiping in one-dimensional synchronous ad hoc radio networks A Miller Master’s thesis, University of Toronto, 2009. http://www. cs. toronto. edu …, 2010 | 5 | 2010 |
| Fast Byzantine Gathering with Visibility in Graphs A Miller, U Saha International Symposium on Algorithms and Experiments for Sensor Systems …, 2020 | 4 | 2020 |
| On the complexity of neighbourhood learning in radio networks A Miller Theoretical Computer Science 608, 135-145, 2015 | 4 | 2015 |
| Gossiping in jail A Miller Algorithmic Aspects of Wireless Sensor Networks: 5th International Workshop …, 2009 | 3 | 2009 |
| Gossiping in one-dimensional synchronous ad hoc wireless radio networks A Miller Proceedings of the 4th International Workshop on Theoretical Aspects of …, 2012 | 2 | 2012 |
| Deterministic leader election in anonymous radio networks A Miller, A Pelc, RN Yadav ACM Transactions on Algorithms (TALG) 18 (3), 1-33, 2022 | 1 | 2022 |
| Four Shades of Deterministic Leader Election in Anonymous Networks B Gorain, A Miller, A Pelc Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 1 | 2021 |
| Efficient Privacy-Preserving Approaches for Trajectory Datasets MY Hassan, U Saha, N Mohammed, S Durocher, A Miller 2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf …, 2020 | 1 | 2020 |
Andrzej PelcProfessor of Computer Science, Universite du Quebec en OutaouaisVerified email at uqo.ca
