Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal dynamic scheduling of task tree on constant-dimensional architectures
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal online scheduling of parallel jobs with dependencies
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Modeling the benefits of mixed data and task parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Parallel image thinning through topological operators on shared memory parallel machines
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Hi-index | 0.00 |
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.