In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...