226 search results - page 44 / 46 » Lower bounds on the obstacle number of graphs |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
DSN
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
STOC
2010
ACM
14 years 19 hour ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
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...