Maxwell Young
Cited by
Cited by
On the frequency of severe terrorist events
A Clauset, M Young, KS Gleditsch
Journal of Conflict Resolution 51 (1), 58-87, 2007
Making chord robust to byzantine attacks
A Fiat, J Saia, M Young
European Symposium on Algorithms, 803-814, 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
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
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
Conflict on a communication channel
V King, J Saia, M Young
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
Nonnegative integral subset representations of integer sets
MJ Collins, D Kempe, J Saia, M Young
Information Processing Letters 101 (3), 129-133, 2007
Reducing communication costs in robust peer-to-peer networks
J Saia, M Young
Information Processing Letters 106 (4), 152-158, 2008
Approximation algorithms for minimizing segments in radiation therapy
S Luan, J Saia, M Young
Information Processing Letters 101 (6), 239-244, 2007
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
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
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
Proof of work without all the work
D Gupta, J Saia, M Young
Proceedings of the 19th International Conference on Distributed Computing …, 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
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
Interactive communication with unknown noise rate
V Dani, TP Hayes, M Movahedi, J Saia, M Young
Information and computation 261, 464-486, 2018
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
Choosing a random peer in chord
V King, S Lewis, J Saia, M Young
Algorithmica 49 (2), 147-169, 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
Characterization of transverse channel concentration profiles obtainable with a class of microfluidic networks
J Sager, M Young, D Stefanovic
Langmuir 22 (9), 4452-4455, 2006
The system can't perform the operation now. Try again later.
Articles 1–20