Author:
d'Amore Fabrizio,Marchetti-Spaccamela Alberto,Nanni Umberto
Reference14 articles.
1. J. L. Bentley, and C. McGeogh, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Communications of the ACM 28, 4 (April 1985), 404–411.
2. J. R. Bitner, Heuristics that Dynamically Organize Data Structures, SIAM J. of Computing 8, 1 (February 1979), 82–110.
3. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms, in Proceedings of the 20th ACM Annual Symposium on Theory of Computing, May 1990, 379–386.
4. F. d'Amore, U. Nanni, and A. Marchetti-Spaccamela, Robust Algorithms for Diagnosis, Technical Report, Dipartimento di Informatica e Sistemistica, Univ. of Roma “La Sapienza”, 1991.
5. S. Gnesi, U. Montanari, and A. Martelli, Dynamic programming as graph searching: An algebraic approach, Journal of ACM 28, (1981), 737–751.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献