: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
The World Wide Web (WWW) has experienced a dramatic increase in popularity since 1993. Many reports indicate that its growth will continue at an exponential rate. This growth has ...
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...