We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...