Pages that link to "Item:Q3205169"
From MaRDI portal
The following pages link to On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks (Q3205169):
Displaying 17 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Smaller superconcentrators of density 28 (Q844173) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Explicit constructions of linear-sized superconcentrators (Q1165257) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Three-regular path pairable graphs (Q1187948) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- Pseudo-random hypergraphs (Q1812585) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
