Abstract-- The use of atomic commit protocols in mobile adhoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This ...
George Samaras, Martin Hett, Panos K. Chrysanthis,...
Abstract. In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological mo...
Abstract. We provide a dynamic systems interpretation of the coupling of internal states involved in speed-dependent automatic zooming, and test our implementation on a text browse...
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Abstract. In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster tha...