Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
One-sided crossbar switches allow for a simple implementation of complete K<sub>n</sub> graphs. However, designing these circuits is a cumbersome process and can be automated. We present an algorithm that allows designing automatic one-sided binary tree - crossbar switches which do not exceed ⌊n/2⌋ columns, and achieves K<sub>n</sub> graph… (More)