We consider the problem of scheduling a conference to achieve the benefits in time-compression of parallel sessions, but without the associated high degree of conflict between talks. We describe a randomized construction meeting these goals that we analyze based on an expansion property of an associated graph. We also give algorithms for attendees scheduling their time within such a conference, and algorithms for verifying a proposed conference schedule. Finally, we present simulation results for typical conference sizes.
/lp/association-for-computing-machinery/on-a-theory-of-computing-symposia-OfgLwI6HaR