| On the frequency of severe terrorist events A Clauset, M Young, KS Gleditsch Journal of Conflict Resolution 51 (1), 58-87, 2007 | 493 | 2007 |
| Making chord robust to byzantine attacks A Fiat, J Saia, M Young Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 152 | 2005 |
| The strategic calculus of terrorism: Substitution and competition in the Israel—Palestine conflict A Clauset, L Heger, M Young, KS Gleditsch Cooperation and Conflict 45 (1), 6-33, 2010 | 74 | 2010 |
| Proof of work without all the work D Gupta, J Saia, M Young Proceedings of the 19th international conference on distributed computing …, 2018 | 56 | 2018 |
| Overcoming adversaries in sensor networks: A survey of theoretical models and algorithmic approaches for tolerating malicious interference M Young, R Boutaba IEEE Communications Surveys & Tutorials 13 (4), 617-641, 2011 | 53 | 2011 |
| How to scale exponential backoff: Constant throughput, polylog access attempts, and robustness MA Bender, JT Fineman, S Gilbert, M Young Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 51 | 2016 |
| Practical robust communication in dhts tolerating a byzantine adversary M Young, A Kate, I Goldberg, M Karsten 2010 IEEE 30th International Conference on Distributed Computing Systems …, 2010 | 50 | 2010 |
| Contention resolution with log-logstar channel accesses MA Bender, T Kopelowitz, S Pettie, M Young Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 47 | 2016 |
| Conflict on a communication channel V King, J Saia, M Young Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 41 | 2011 |
| Nonnegative integral subset representations of integer sets MJ Collins, D Kempe, J Saia, M Young Information Processing Letters 101 (3), 129-133, 2007 | 31 | 2007 |
| Towards practical communication in Byzantine-resistant DHTs M Young, A Kate, I Goldberg, M Karsten IEEE/ACM Transactions on Networking 21 (1), 190-203, 2012 | 30 | 2012 |
| Reducing communication costs in robust peer-to-peer networks J Saia, M Young Information Processing Letters 106 (4), 152-158, 2008 | 28 | 2008 |
| Interactive communication with unknown noise rate V Dani, TP Hayes, M Movahedi, J Saia, M Young Information and computation 261, 464-486, 2018 | 27 | 2018 |
| Resource-competitive algorithms MA Bender, JT Fineman, M Movahedi, J Saia, V Dani, S Gilbert, S Pettie, ... ACM SIGACT News 46 (3), 57-71, 2015 | 27 | 2015 |
| Making evildoers pay: resource-competitive broadcast in sensor networks S Gilbert, M Young Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 26 | 2012 |
| Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness MA Bender, JT Fineman, S Gilbert, M Young Journal of the ACM (JACM) 66 (1), 1-33, 2018 | 24 | 2018 |
| Resource-competitive analysis: A new perspective on attack-resistant distributed computing S Gilbert, J Saia, V King, M Young Proceedings of the 8th international Workshop on Foundations of Mobile …, 2012 | 23 | 2012 |
| Approximation algorithms for minimizing segments in radiation therapy S Luan, J Saia, M Young Information processing letters 101 (6), 239-244, 2007 | 23 | 2007 |
| (Near) optimal resource-competitive broadcast with jamming S Gilbert, V King, S Pettie, E Porat, J Saia, M Young Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and …, 2014 | 22* | 2014 |
| Sleeping on the job: energy-efficient and robust broadcast for radio networks V King, C Phillips, J Saia, M Young Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 19 | 2008 |
