489 search results - page 20 / 98 » Communication Complexity of Permutation-Invariant Functions |
84
Voted
PCI
2001
Springer
15 years 2 months ago
2001
Springer
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes...
WAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Internet is facing ever-increasing complexity in the construction, configuration and management of heterogeneous networks. New communication paradigms are underminin...
CRYPTO
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— Complex, autonomous robots integrate a large set of sometimes very diverse algorithms across at least three levels of system organization: the agent architecture, the implement...
104
click to vote
MPC
1995
Springer
15 years 2 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...