✦ LIBER ✦

Better expanders and superconcentrators

✍ Scribed by N Alon; Z Galil; V.D Milman

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 548 KB
Volume: 8
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90014-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 (

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

Superconcentrators of depth 2

✍ Nicholas Pippenger 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 468 KB

λ1, Isoperimetric inequalities for graph

λ1, Isoperimetric inequalities for graphs, and superconcentrators

✍ N Alon; V.D Milman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 856 KB

Multi-processor scheduling and expanders

✍ Nikolai N. Kuzjurin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Highly Symmetric Expanders

✍ Yeow Meng Chee; San Ling 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and ana