Recursive construction for 3-regular expanders (Q1343165): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A note on time-space tradeoffs for computing continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel selection has complexity O(log log N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selecting in Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic properties in computational complexity / rank
 
Normal rank

Revision as of 10:38, 23 May 2024

scientific article
Language Label Description Also known as
English
Recursive construction for 3-regular expanders
scientific article

    Statements

    Identifiers