John Kuszmaul

activity

20212026

most citedBamboo Trimming Revisited: Simple Algorithms Can Do Well Too

4 citations · 7 across the 8 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.DS2022

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

Nikhil Bansal, John Kuszmaul, William Kuszmaul

In the $d$ -dimensional cow-path problem, a cow living in $R^{d}$ must locate a $(d - 1)$ -dimensional hyperplane $H$ whose location is unknown. The only way that the cow can…

cs.DS2022★ 2 cited

Contention Resolution for Coded Radio Networks

Michael A. Bender, Seth Gilbert, Fabian Kuhn +2

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a w…

cs.DS2022★ 4 cited

Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too

John Kuszmaul

The bamboo trimming problem considers $n$ bamboo with growth rates $h_{1}, h_{2}, \dots, h_{n}$ satisfying $\sum_{i} h_{i} = 1$ . During a given unit of time, each bamboo grows by $h_{i}$ , and…

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

Contention Resolution for Coded Radio Networks

Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too

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