Amortized efficiency of list update and paging rules
Communications of the ACM
An efficient algorithm for heap storage allocation
ACM SIGPLAN Notices
The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
Journal of Algorithms
An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Journal of the ACM (JACM)
Bounds for Some Functions Concerning Dynamic Storage Allocation
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Schemes for slot reuse in CRMA
IEEE/ACM Transactions on Networking (TON)
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
An empirical evaluation of extendible arrays
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Single and multiple device DSA problems, complexities and online algorithms
Theoretical Computer Science
| Hi-index | 0.00 |