Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
Domain specific languages (DSLs) play a cornerstone Model-Driven Software Development. The abstract syntax of a DSL is usually defined by a metamodel, while inplace model transf...
Abstract—It is well known that the suitability of many cryptographic algorithms decreases with time. Hence, it is a challenging task to maintain the integrity, authenticity, con...
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...