On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels

DOI10.1109/18.179355zbMATH Open0825.94164OpenAlexW2086670230MaRDI QIDQ4034446FDOQ4034446

Authors: Yitzhak Birk, Nathan Linial, Roy Meshulam 

Publication date: 16 May 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.179355

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited In (8)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Multitasking capacity: hardness results and improved constructions
• On the communication complexity of high-dimensional permutations
• On regularity lemma and barriers in streaming and dynamic matching
• Nearly complete graphs decomposable into large induced matchings and their applications
• Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
• Broadcast transmission to prioritizing receivers
• Colorings with only rainbow arithmetic progressions

This page was built for publication: On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels

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