31 citations · 62 across the 15 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
Holger Dell, John Lapinskas, Kitty Meeks
We study a query model of computation in which an n-vertex k-hypergraph can be accessed only via its independence oracle or via its colourful independence oracle, and each oracle q…
cs.DS2022★ 1 cited
Instability of backoff protocols with arbitrary arrival rates
Leslie Ann Goldberg, John Lapinskas
In contention resolution, multiple processors are trying to coordinate to send discrete messages through a shared channel with limited communication. If two processors send at the…