Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
In this paper, we defined the concept of the grouped distributed objects[10-14], as a logical unit of distributed application service, and developed a distributed programming deve...
A component revolution is underway, bringing developers improved productivity and opportunities for code reuse. However, whereas existing tools work well for builders of desktop ap...
Krzysztof Ostrowski, Ken Birman, Danny Dolev, Jong...
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...