204 search results - page 11 / 41 » A Half-Million Strong at Least |
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
APAL
2006
14 years 12 months ago
2006
We prove a number of consistency results complementary to the ZFC results from our paper [4]. We produce examples of non-tightly stationary mutually stationary sequences, sequences...
ENDM
2006
14 years 12 months ago
2006
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
SIAMDM
2008
14 years 11 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
ASIACRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We point out that the seemingly strong pseudorandom oracle preserving (PRO-Pr) property of hash function domain-extension transforms defined and implemented by Coron et. al. [12] ...