Maxwell Young

Orcid: 0000-0002-5251-8595

According to our database1, Maxwell Young authored at least 51 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Survey on Adversarial Contention Resolution.
CoRR, 2024

Defending Hash Tables from Subterfuge with Depth Charge.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Bankrupting Sybil despite churn.
J. Comput. Syst. Sci., August, 2023

Robust and Listening-Efficient Contention Resolution.
CoRR, 2023

2022
Singletons for simpletons revisiting windowed backoff with Chernoff bounds.
Theor. Comput. Sci., 2022

AI_Adaptive_POW: An AI assisted Proof Of Work (POW) framework for DDoS defense.
Softw. Impacts, 2022

Bankrupting DoS Attackers Despite Uncertainty.
CoRR, 2022

A Policy Driven AI-Assisted PoW Framework.
Proceedings of the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2022

2021
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals.
Distributed Comput., 2021

Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Resource Burning for Permissionless Systems.
CoRR, 2020

ToGCom: An Asymmetric Sybil Defense.
CoRR, 2020

Contention Resolution with Message Deadlines.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Resource Burning for Permissionless Systems (Invited Paper).
Proceedings of the Structural Information and Communication Complexity, 2020

2019
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.
J. ACM, 2019

Resource-Competitive Sybil Defenses.
CoRR, 2019

Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds.
CoRR, 2019

Peace Through Superior Puzzling: An Asymmetric Sybil Defense.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Towards Scalable Planning of Wireless Networks.
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2019

2018
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses.
SIAM J. Comput., 2018

Interactive communication with unknown noise rate.
Inf. Comput., 2018

A resource-competitive jamming defense.
Distributed Comput., 2018

Tiny Groups Tackle Byzantine Adversaries.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Proof of Work Without All the Work.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Good Things Come in LogLog(n)-Sized Packages: Robustness with Small Quorums.
CoRR, 2017

Is Our Model for Contention Resolution Wrong?
CoRR, 2017

Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Contention resolution with log-logstar channel accesses.
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
Resource-Competitive Algorithms.
SIGACT News, 2015

Interactive Communication with Unknown Noise Rate.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World.
CoRR, 2014

(Near) optimal resource-competitive broadcast with jamming.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Towards Practical Communication in Byzantine-Resistant DHTs.
IEEE/ACM Trans. Netw., 2013

Faster optimal algorithms for segment minimization with small maximal value.
Discret. Appl. Math., 2013

2012
Resource-Competitive Communication
CoRR, 2012

Making evildoers pay: resource-competitive broadcast in sensor networks.
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

Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks.
Algorithmica, 2011

Conflict on a communication channel.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009
Fixed-Parameter Tractability and Improved Approximations for Segment Minimization
CoRR, 2009

A Heuristic for Fair Correlation-Aware Resource Placement.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

2008
Reducing communication costs in robust peer-to-peer networks.
Inf. Process. Lett., 2008

2007
Approximation algorithms for minimizing segments in radiation therapy.
Inf. Process. Lett., 2007

Nonnegative integral subset representations of integer sets.
Inf. Process. Lett., 2007

Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks
CoRR, 2007

Choosing a Random Peer in Chord.
Algorithmica, 2007

2005
Making Chord Robust to Byzantine Attacks.
Proceedings of the Algorithms, 2005


  Loading...