𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Superconcentrators of depth 2

✍ Scribed by Nicholas Pippenger

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
468 KB
Volume
24
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Superconcentrators of depths 2 and 3; od
Superconcentrators of depths 2 and 3; odd levels help (rarely)
✍ Noga Alon; Pavel Pudlak πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 401 KB

It is shown that the minimum possible number of edges in an n-superconcentrator of depth 3 is O(n log log n), whereas the minimum possible number of edges in an n-superconcentrator of depth 2 is Q(n(log n) 3/2) (and is O(n(log n)2)).

Self -Routing Superconcentrators
Self -Routing Superconcentrators
✍ Nicholas Pippenger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 293 KB

Superconcentrators are switching systems that solve the generic problem of interconnecting clients and servers during sessions, in situations where either the clients or the servers are interchangeable (so that it does not matter which client is connected to which server). Previous constructions of

Construction of expanders and superconce
Construction of expanders and superconcentrators using Kolmogorov complexity
✍ Uwe SchΓΆning πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the best known bounds on the size of expanders and superconcentrators can be attained based on this method. In the case of (