Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
1
0
0
2
A single randomized algorithm simultaneously achieves near-optimal $(2+\varepsilon)$-competitiveness and sublinear regret for TCP acknowledgment, proving $\varepsilon>0$ is essential for the latter.