STOC
2001
ACM
14 years 10 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM