We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
In this paper we extend our results (as given in [PHE+07]) concerning the layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher ord...
We do not interact with systems without first performing some physical action on a physical device. This paper shows how formal notations and formal models can be developed to acc...
Alan J. Dix, Masitah Ghazali, Devina Ramduny-Ellis
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
SASC (Server-Aided Secret Computation) protocols enable a client (a smart card) to borrow computing power from a server (e.g., an untrustworthy auxiliary device like an ATM) witho...
Heeyoul Kim, Younho Lee, Seong-Min Hong, Hyunsoo Y...