Sciweavers

8196 search results - page 471 / 1640
» Computational Modeling and Complexity Science
Sort
View
FOCS
1993
IEEE
15 years 11 months ago
A Tight Lower Bound for k-Set Agreement
: 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...
ERSHOV
2006
Springer
15 years 10 months ago
Information-Flow Attacks Based on Limited Observations
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 ...
Damas P. Gruska
FOCS
2008
IEEE
15 years 8 months ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
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...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
WSC
1997
15 years 8 months ago
Model-Driven Simulation of World-Wide-Web Cache Policies
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 ...
Ying Shi, Edward Watson, Ye-Sho Chen
HIPC
2005
Springer
16 years 12 days ago
Application of Reduce Order Modeling to Time Parallelization
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...
Ashok Srinivasan, Yanan Yu, Namas Chandra