489 search results - page 29 / 98 » Communication Complexity of Permutation-Invariant Functions |
DEDS
2008
14 years 10 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
105
click to vote
RTCSA
2003
IEEE
15 years 3 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by c...
101
click to vote
ISORC
2003
IEEE
15 years 3 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
STOC
2010
ACM
15 years 3 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
DC
2007
14 years 10 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...