14 search results - page 2 / 3 » A Near-Tight Lower Bound on the Time Complexity of Distribut... |
DCOSS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
CONCUR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
JOC
2007
13 years 6 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...