383 search results - page 51 / 77 » A Bound on the Total Chromatic Number |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
PIMRC
2008
IEEE
14 years 4 months ago
2008
IEEE
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
ESORICS
2007
Springer
14 years 4 months ago
2007
Springer
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
CONEXT
2006
ACM
14 years 4 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
WG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...