![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Grigoriev D. Vorobjov N.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 185-214
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)