The Expected Capacity of Concentrators

DOI10.1137/0404012zbMATH Open0714.68059OpenAlexW2062531405MaRDI QIDQ3200547FDOQ3200547

Nicholas Pippenger

Publication date: 1991

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1115&context=hmc_fac_pub

Recommendations

• On the Expected Capacity of Binomial and Random Concentrators
• Asymptotic results for partial concentrators
• [[:Publication:4515743|Title not available (Why is that?)]]
• Natural bounded concentrators
• The capacity of the subarray partial concentrators

zbMATH Keywords

branching processcommunication networkrandom packingmaximum matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (2)

• Convergence in capacity
• Asymptotic results for partial concentrators

This page was built for publication: The Expected Capacity of Concentrators

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