Sciweavers

SIGACT
2010
76views more  SIGACT 2010»
13 years 5 months ago
Reconfiguring a state machine
Reconfiguration means changing the set of processes executing a distributed system. We explain several methods for reconfiguring a system implemented using the state-machine appro...
Leslie Lamport, Dahlia Malkhi, Lidong Zhou
SIGACT
2010
68views more  SIGACT 2010»
13 years 5 months ago
A survey of buffer management policies for packet switches
Over the past decade, there has been great interest in the study of buffer management policies in the context of packet transmission for network switches. In a typical model, a sw...
Michael H. Goldwasser
SIGACT
2010
74views more  SIGACT 2010»
13 years 9 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
SIGACT
2010
44views more  SIGACT 2010»
13 years 9 months ago
SIGACT News Complexity Theory Column 67
Lane A. Hemaspaandra