The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Scheduling Tasks with Nonuniform Deadlines on Two Processors
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 Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The two-processor scheduling problem is in R-NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Scheduling expressions on a pipelined processor with a maximal delay of one cycle
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity results and algorithms for {
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Scheduling In and Out Forests in the Presence of Communication Delays
IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules
IEEE Transactions on Parallel and Distributed Systems
An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Theoretical Computer Science - Algorithms,automata, complexity and games
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An efficient parallel algorithm for scheduling interval ordered tasks
Journal of Complexity
Scheduling interval orders with communication delays in parallel
Journal of Parallel and Distributed Computing
Scheduling trees onto hypercubes and grids is NP-complete
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.01 |