John Kuszmaul

According to our database, John Kuszmaul authored at least 8 papers between 2022 and 2024.

Collaborative distances:

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

2024

Modern Hashing Made Simple.

Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution.

Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

A nearly tight lower bound for the <i>d</i>-dimensional cow-path problem.

Nikhil Bansal, John Kuszmaul, William Kuszmaul

Inf. Process. Lett., August, 2023

Robust and Listening-Efficient Contention Resolution.

Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young

CoRR, 2023

2022

A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem.

Nikhil Bansal, John Kuszmaul, William Kuszmaul

CoRR, 2022

On the optimal time/space tradeoff for hash tables.

Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too.

John Kuszmaul

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Contention Resolution for Coded Radio Networks.

Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022