Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Operating Systems Theory
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Bounds on scheduling with limited resources
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
A task-scheduling algorithm for a multiprogramming computer system
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Analysis of computer scheduling with memory constraints.
Analysis of computer scheduling with memory constraints.
Memory-constrained task scheduling on a network of dual processors
Journal of the ACM (JACM)
An Algorithm to Design the Memory Configuration of a Computer Network
Journal of the ACM (JACM)
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-Line Algorithms for Cardinality Constrained Bin Packing Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Schemes for Ordered Vector Packing Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Survey of recent operating systems research, designs and implementations
ACM SIGOPS Operating Systems Review
Theoretical Computer Science
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
Scheduling tasks with critical sections
ACM '77 Proceedings of the 1977 annual conference
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Multiprocessor Scheduling with Memory Allocation A Deterministic Approach
IEEE Transactions on Computers
A classification scheme for bin packing theory
Acta Cybernetica
Online interval coloring with packing constraints
Theoretical Computer Science
Computers and Operations Research
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Approximation schemes for packing splittable items with cardinality constraints
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Class constrained bin packing revisited
Theoretical Computer Science
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A linear time algorithm for restricted bin packing and scheduling problems
Operations Research Letters
Probabilistic analysis of a bin covering algorithm
Operations Research Letters
Improved results for a memory allocation problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Bin covering with cardinality constraints
Discrete Applied Mathematics
| Hi-index | 0.01 |