Author:
Naor Joseph (Seffi),Orda Ariel,Petruschka Yael
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. B. Awerbuch, Y. Azar, S. Plotkin, Throughput-competitive of on-line routing, in: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, October 1993, pp. 32–40.
2. On-line load balancing of temporary tasks;Azar;Journal of Algorithms,1997
3. A 5/4 algorithm for two-dimensional packing;Baker;J. Algorithms,1981
4. Orthogonal packings in two dimensions;Baker;SIAM J. Comput.,1980
5. Shelf algorithms for two-dimensional packing problems;Baker;SIAM J. Comput.,1983
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cost-Oblivious Storage Reallocation;ACM Transactions on Algorithms;2017-07-31
2. Cost-oblivious storage reallocation;Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems;2014-06-18
3. Single and multiple device DSA problems, complexities and online algorithms;Theoretical Computer Science;2012-02
4. Single and Multiple Device DSA Problem, Complexities and Online Algorithms;Algorithms and Computation;2010
5. Maintaining Arrays of Contiguous Objects;Fundamentals of Computation Theory;2009