Pages that link to "Item:Q5176008"
From MaRDI portal
The following pages link to Dynamic TCP acknowledgement and other stories about e/(e-1) (Q5176008):
Displaying 12 items.
- Dynamic TCP acknowledgment with sliding window (Q1006072) (← links)
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\) (Q1400893) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Online scheduling with partial job values: does timesharing or randomization help? (Q1879362) (← links)
- On-line analysis of the TCP acknowledgment delay problem (Q3196616) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- Dynamic TCP Acknowledgment with Sliding Window (Q3603565) (← links)
- EVA: a better TCP version for resource-insufficient networks (Q4790691) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925533) (← links)
- On the Bahncard problem (Q5958720) (← links)
- On the best possible competitive ratio for the multislope ski-rental problem (Q5963633) (← links)