Probabilistic ?-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions....
We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends only (vn) bits, where n is the total number o...
We consider a fragment of XPath 1.0, where attribute and text values may be compared. We show that for any unary query ? in this fragment, the set of...
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts o...
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric datase...
