2924 search results - page 309 / 585 » Lower Bounds in Distributed Computing |
145
click to vote
ASPLOS
2004
ACM
15 years 10 months ago
2004
ACM
This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterpr...
147
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
140
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
123
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
150
click to vote
CG
2008
Springer
15 years 4 months ago
2008
Springer
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...