ACM SIGACT News, vol. 33,no. 2,2002
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous ...
A lambda calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and function symbols and thus is an abstraction of programming languages such as LISP which permit functions to be passed to or returned from other ...
ACM SIGACT News, vol. 33,no. 2,2002
An ad hoc wireless network, or simply an ad hoc network, consists of a collection of geographically distributed nodes that communicate with one other over a wireless medium. An ad hoc network differs from cellular networks in that there is no wired ...
ACM SIGACT News, vol. 36,no. 2,2005
We survey recent research that has appeared in the theoretical computer science literature on algorithmic problems related to power management. We will try to highlight some open problem that we feel are interesting. This survey places more ...
ACM SIGACT News, vol. 23,no. 2,1992
Algorithm animation is the process of abstracting a program 's data, operations, and semantics, and then creating a dynamic visualization of those abstractions[3] . Algorithm animations can be helpful for teaching algorithms and as a research ...
The proof that a program verifies some property is carried out by the valuation of the program in a model characterizing that property. Specific models are given for sufficient conditions of the correctness of types, locations and asynchronous ...
ACM SIGACT News, vol. 32,no. 1,2001
redundant computation by processing each transaction only once and delivering the result with group communication primitives. The proceedings of the conference were published by Springer in LNCS number 1914. They were edited by Maurice Herlihy who ...
The basis for this paper is a logic designed by Dana Scott [1] in 1969 for formalizing arguments about computable functions of higher type. This logic uses typed combinators, and we give a more or less direct translation into typed ...
ACM SIGACT News, vol. 15,no. 1,1983
This paper treats a class of codes made possible by restrictions on measurement related to the uncertainty principal. Two concrete examples and some general results are given