5 citations · 5 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Probing to Minimize
Weina Wang, Anupam Gupta, Jalani Williams
We develop approximation algorithms for set-selection problems with deterministic constraints, but random objective values, i.e., stochastic probing problems. When the goal is to m…
cs.DS2020★ 5 cited
Lower Bounds for Caching with Delayed Hits
Peter Manohar, Jalani Williams
Caches are a fundamental component of latency-sensitive computer systems. Recent work of [ASWB20] has initiated the study of delayed hits: a phenomenon in caches that occurs when t…