Publisher
Springer Berlin Heidelberg
Reference68 articles.
1. D. Achlioptas, M. Chrobak, J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.
2. S. Albers. Improved randomized on-line algorithms for the list update problem. SIAM J. Computing 27:670–681, 1998.
3. S. Albers, H. Bals. Dynamic TCP acknowledgement: Penalizing long delays. Proc. 14th ACM-SIAM Symp. on Theory of Computing, 47–55, 2003.
4. S. Albers, L. M. Favrholdt, O. Giel On paging with locality of reference. Proc. 34th ACM Symp. on Theory of Computing, 258–268, 2002.
5. S. Albers, M. Mitzenmacher. Average case analyses of list update algorithms, with applications to data compression. Algorithmica 21:312–329, 1998.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Searching for Applicable Versions of Computable Structures;Lecture Notes in Computer Science;2021
2. Prediction Capabilities for Cyber Physical Vehicles;International Journal of Cyber-Physical Systems;2019-01
3. Ubiquitous IoT in the Automotive Domain;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2018
4. A Game Theory Model for Self-adapting Traffic Flows with Autonomous Navigation;Autonomic Road Transport Support Systems;2016
5. Turing machines, transition systems, and interaction;Information and Computation;2004-11