Protocols for asymmetric communication channels

DOI10.1006/jcss.2001.1779zbMath1006.68008OpenAlexW2066209652MaRDI QIDQ1604209

Micah Adler, Bruce M. Maggs

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/98b3cbce886c8aa2d8449922b0998327bc927854

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (8)

Unnamed Item ⋮ An approximation algorithm for binary searching in trees ⋮ On realization of left and right products of rational functions ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Dynamic asymmetric communication ⋮ Compressing probability distributions ⋮ Improved bounds for asymmetric communication protocols.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Universal classes of hash functions
• Lower bounds for union-split-find related problems on random access machines
• Recent Developments in Nonparametric Density Estimation
• Worst-case interactive communication. II. Two messages are not optimal
• Worst-case interactive communication. I. Two messages are almost optimal
• Average-case interactive communication
• Interactive Communication of Balanced Distributions and of Correlated Files
• Three results on interactive communication
• Communication Complexity
• A Method for the Construction of Minimum-Redundancy Codes
• Noiseless coding of correlated information sources

This page was built for publication: Protocols for asymmetric communication channels