Expanders, sorting in rounds and superconcentrators of limited depth
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Rearrangeable and nonblocking [w, f] -distributors
IEEE/ACM Transactions on Networking (TON)
Lower bounds for depth-2 and depth-3 Boolean circuits with arbitrary gates
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Min-rank conjecture for log-depth circuits
Journal of Computer and System Sciences
Tradeoffs in depth-two superconcentrators
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
It is shown that the minimum possible number of edges in an n-superconcentrator of depth 3 is @Q(n log log n), whereas the minimum possible number of edges in an n-superconcentrator of depth 2 is @W(n(log n)^3^/^2) (and is O(n(log n)^2)).