We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
Abstract. We propose and analyse a new countermeasure against Differential Power Analysis (DPA) for the AES encryption algorithm, based on permutation tables. As opposed to existin...