2638 search results - page 489 / 528 » Random Geometric Complexes |
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
With the current trend in integration of more complex systems on chip there is a need for better communication infrastructure on chip that will increase the available bandwidth an...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...