2924 search results - page 83 / 585 » Lower Bounds in Distributed Computing |
MOBIHOC
2001
ACM
14 years 8 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
IPMU
2010
Springer
14 years 28 days ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...