Asymmetric communication protocols via hotlink assignments

DOI10.1007/S00224-003-1126-2zbMATH Open1101.68368OpenAlexW1974704934MaRDI QIDQ1762995FDOQ1762995

Stefan Langerman, Prosenjit Bose, D. Krizanc, Pat Morin

Publication date: 11 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1126-2

Recommendations

• On asymmetric communication protocols
• Dynamic Asymmetric Communication
• Improved bounds for asymmetric communication protocols.
• Dynamic asymmetric communication
• How to compress asymmetric communication

Mathematics Subject Classification ID

Network protocols (68M12)

Cited In (6)

• Dynamic asymmetric communication
• Near-entropy hotlink assignments
• Approximation algorithm for hotlink assignment in the greedy model
• On the complexity of optimal hotlink assignment
• Approximate hotlink assignment
• Dynamic hotlinks

This page was built for publication: Asymmetric communication protocols via hotlink assignments

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