7106 search results - page 359 / 1422 » Restricted Complexity, General Complexity |
130
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
161
Voted
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
114
click to vote
IANDC
2007
15 years 5 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
135
Voted
ALGOSENSORS
2009
Springer
15 years 11 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
158
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...