Multi-processor scheduling and expanders
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3437452 (Why is no real title available?)
- Asymptotically optimal switching circuits
- Better expanders and superconcentrators
- Graph-theoretic properties in computational complexity
- Optimal scheduling for two-processor systems
- Ramanujan graphs
- Sorting in \(c \log n\) parallel steps
- Superconcentrators
- The complexity of testing whether a graph is a superconcentrator
This page was built for publication: Multi-processor scheduling and expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336770)