In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
—The Operational Complexity Model (OCM) has been used to derive the complexities of the five most prevalent cyber-crimes occurring in southeast Asia, namely peer-to-peer (P2P) mu...
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...