We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
In a ubiquitous computing environment, users continuously access computing services and interact with smart spaces, while moving from one place to another. Application migration, t...
Pauline P. L. Siu, Nalini Moti Belaramani, Cho-Li ...
Abstract— Gate leakage (direct tunneling current for sub65nm CMOS) can severely affect both the transient and steady state behaviors of CMOS circuits. In this paper we quantify t...
State Machines: An Overview of the Project Yuri Gurevich Microsoft Research, One Microsoft Way, Redmond, WA 98052 November 2003 This is an extended abstract of an invited talk at ...