222 search results - page 37 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
PODS
2012
ACM
11 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
LFCS
2007
Springer
14 years 25 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...