Improved bounds for asymmetric communication protocols.

DOI10.1016/S0020-0190(01)00332-5zbMATH Open1043.68015MaRDI QIDQ1853071FDOQ1853071

Authors: Eduardo S. Laber, Leonardo Gomes Holanda 

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• On asymmetric communication protocols
• Protocols for asymmetric communication channels
• scientific article; zbMATH DE number 1263186
• Dynamic Asymmetric Communication
• Dynamic asymmetric communication

zbMATH Keywords

Analysis of algorithmsData compressionAsymmetric communicationWireless networking

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Network protocols (68M12)

Cites Work

• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• Protocols for asymmetric communication channels

Cited In (10)

• Dynamic asymmetric communication
• Asymmetric communication protocols via hotlink assignments
• On asymmetric communication protocols
• How to compress asymmetric communication
• Improved approximation algorithms for the average-case tree searching problem
• An approximation algorithm for binary searching in trees
• On the complexity of searching in trees and partially ordered structures
• Dynamic Asymmetric Communication
• Protocols for asymmetric communication channels
• Dynamic hotlinks

This page was built for publication: Improved bounds for asymmetric communication protocols.

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