Smaller superconcentrators of density 28

DOI10.1016/J.IPL.2006.01.006zbMATH Open1185.68496OpenAlexW2083431088MaRDI QIDQ844173FDOQ844173

Authors: Uwe Schöning 

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.006

Recommendations

• Superconcentrators of density 25.3.
• Tradeoffs in Depth-Two Superconcentrators
• Smaller Explicit Superconcentrators
• scientific article; zbMATH DE number 3864514
• scientific article; zbMATH DE number 3974994

zbMATH Keywords

computational complexitycombinatorial problemsuperconcentrator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Hard examples for resolution
• Superconcentrators
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• Space bounds for a game on graphs
• Asymptotically optimal switching circuits
• Title not available (Why is that?)
• Construction of expanders and superconcentrators using Kolmogorov complexity
• Smaller Explicit Superconcentrators
• Title not available (Why is that?)

Cited In (12)

• Superconcentrators of depths 2 and 3; odd levels help (rarely)
• Minimal selectors and fault tolerant networks
• Tradeoffs in Depth-Two Superconcentrators
• Superconcentrators of density 25.3.
• Proof of space from stacked expanders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Better expanders and superconcentrators
• Note on ``Smaller explicit superconcentrators
• A geometric construction of a superconcentrator of depth 2
• Title not available (Why is that?)
• Smaller Explicit Superconcentrators

This page was built for publication: Smaller superconcentrators of density 28

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844173)