Improved bounds for asymmetric communication protocols.
From MaRDI portal
Publication:1853071
DOI10.1016/S0020-0190(01)00332-5zbMath1043.68015MaRDI QIDQ1853071
Leonardo Gomes Holanda, Eduardo Sany Laber
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
An approximation algorithm for binary searching in trees ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Dynamic hotlinks ⋮ Dynamic asymmetric communication
Cites Work