A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Does randomization help in on-line bin packing?
Information Processing Letters
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
On line bin packing with items of random size
Mathematics of Operations Research
Discrete Applied Mathematics
Markov chains, computer proofs, and average-case analysis of best fit bin packing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New Algorithms for Bin Packing
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
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Hippodrome: Running Circles Around Storage Administration
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Selecting RAID Levels for Disk Arrays
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
SIGACT news online algorithms column 8
ACM SIGACT News
Quickly finding near-optimal storage designs
ACM Transactions on Computer Systems (TOCS)
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Journal of Systems and Software
Proceedings of the 9th annual conference on Genetic and evolutionary computation
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
List's worst-average-case or WAC ratio
Journal of Scheduling
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms (TALG)
Note: Random-order bin packing
Discrete Applied Mathematics
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the relative dominance of paging algorithms
Theoretical Computer Science
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Comparing First-Fit and Next-Fit for online edge coloring
Theoretical Computer Science
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Online ranking for tournament graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Hippodrome: running circles around storage administration
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Selecting RAID levels for disk arrays
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Competitive search in symmetric trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
AMF configurations: checking for service protection using heuristics
Proceedings of the 7th International Conference on Network and Services Management
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
Comparing online algorithms for bin packing problems
Journal of Scheduling
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
An online algorithm optimally self-tuning to congestion for power management problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A new variable-sized bin packing problem
Journal of Scheduling
A comparison of performance measures via online search
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Paging and list update under bijective analysis
Journal of the ACM (JACM)
| Hi-index | 0.00 |