Maxwell Young
Orcid: 0000-0002-5251-8595
According to our database1,
Maxwell Young
authored at least 54 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
2
2
3
1
2
3
3
2
1
1
2
1
3
1
1
4
3
1
1
2
2
2
1
2
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., 2024
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024
2023
2022
Theor. Comput. Sci., 2022
Softw. Impacts, 2022
Proceedings of the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2022
2021
Distributed Comput., 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
Proceedings of the Structural Information and Communication Complexity, 2020
2019
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.
J. ACM, 2019
CoRR, 2019
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2019
2018
SIAM J. Comput., 2018
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018
2017
CoRR, 2017
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014
2013
IEEE/ACM Trans. Netw., 2013
Discret. Appl. Math., 2013
2012
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Resource-competitive analysis: a new perspective on attack-resistant distributed computing.
Proceedings of the FOMC'12, 2012
2011
A note on improving the performance of approximation algorithms for radiation therapy.
Inf. Process. Lett., 2011
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference.
IEEE Commun. Surv. Tutorials, 2011
Algorithmica, 2011
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011
2010
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010
2009
CoRR, 2009
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009
2008
Inf. Process. Lett., 2008
2007
Inf. Process. Lett., 2007
Inf. Process. Lett., 2007
2005