A provably efficient algorithm for dynamic storage allocation

Authors:
E G Coffman, Jr.;F T Leighton
Affiliations:
AT&T Bell Laboratories, Murray Hill, New Jersey;Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Venue:
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Year:
1986

Citing 5
Cited 3

Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics

Management Science
Algorithms for resolving conflicts in dynamic storage allocation

Journal of the ACM (JACM)
Data Structure Techniques

Data Structure Techniques
A probabilistic analysis of multidimensional bin packing problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
First-fit storage of linear lists: tight probabilistic bounds on wasted space

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computer storage fragmentation: pioneering work of brian randell

Dependable and Historic Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract