2252 search results - page 337 / 451 » Lower Bounds for Dynamic Algorithms |
135
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
121
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
108
click to vote
CCS
2003
ACM
15 years 8 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
133
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
129
click to vote
PERVASIVE
2008
Springer
15 years 3 months ago
2008
Springer
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...