Technical Reports

The ICICS/CS Reading Room


UBC CS TR-92-14 Summary

Rearrangeable Circuit-Switching Networks, June 1992 Nicholas Pippenger, 11 pages

We present simple proofs of the basic results concerning the complexity of rearrangeable connectors and superconcentrators. We also define several types of networks whose connectivity properties interpolate between these extremes, and show that their complexities also interpolate.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.