Multi-Processor Scheduling and Expanders

@article{Kuzjurin1994MultiProcessorSA,
  title={Multi-Processor Scheduling and Expanders},
  author={Nikolai N. Kuzjurin},
  journal={Inf. Process. Lett.},
  year={1994},
  volume={51},
  pages={315-319}
}
We prove that the non-existence of expanders with high expansion implies the existence of an ideal p-processor scheduling for directed acyclic graphs (dags) with maximum in-degree d and all levels of size greater than (1 + (2 In In d)/ln dXd/ln d)p for sufficiently large d and p.