Complexity results and algorithms for {

Authors:
Bonnie Berger;Lenore Cowen
Affiliations:
Laboratory for Computer Science and Department of Applied Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Computer Science and Department of Applied Mathematics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Two processor scheduling is in NC

Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Towards an architecture-independent analysis of parallel algorithms

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The horizon supercomputing system: architecture and software

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
A processor architecture for horizon

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Performance prediction for the horizon super computer

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Compiling on horizon

Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Low overhead parallel schedules for task graphs

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An Almost-Linear Algorithm for Two-Processor Scheduling

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
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

Hi-index	0.00