Broadcast Transmission to Prioritizing Receivers

DOI10.1137/16M1098243zbMath1420.94004MaRDI QIDQ4591231

Guy Rutenberg, Noga Alon

Publication date: 13 November 2017

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

zbMATH Keywords

Erdős-Szekeres theoremradio networksdigital convex polygonbroadcast transmissiondilworth theorem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Communication theory (94A05) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twins in words and long common subsequences in permutations
• A lower bound for radio broadcast
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• An exact construction of digital convex polygons with minimal diameter
• Faster communication in known topology radio networks
• A decomposition theorem for partially ordered sets
• Generalizations of broadcasting and gossiping
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
• On the distribution of the length of the longest increasing subsequence of random permutations
• Network information flow
• Broadcast Throughput in Radio Networks: Routing vs. Network Coding
• Nearly complete graphs decomposable into large induced matchings and their applications
• Lower Bounds for Approximation by Nonlinear Manifolds

This page was built for publication: Broadcast Transmission to Prioritizing Receivers