Dylan M. McKay

According to our database, Dylan M. McKay authored at least 4 papers between 2017 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes.

Dylan M. McKay, Cody D. Murray, R. Ryan Williams

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle.

Dylan M. McKay, Richard Ryan Williams

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems.

Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams

Proceedings of the 34th Computational Complexity Conference, 2019

2017

Theoretical Foundations of Team Matchmaking.

Josh Alman, Dylan M. McKay

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017