Sciweavers

FOCS
1997
IEEE
13 years 9 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
FOCS
1997
IEEE
13 years 9 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
FOCS
1997
IEEE
13 years 9 months ago
A Concrete Security Treatment of Symmetric Encryption
Mihir Bellare, Anand Desai, E. Jokipii, Phillip Ro...
FOCS
1997
IEEE
13 years 9 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
FOCS
1997
IEEE
13 years 9 months ago
Pattern Matching with Swaps
Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe...