| Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs | 0 | 0.34 | 2022 |
| A Bayesian Network Approach for the Interpretation of Cyber Attacks to Power Systems. | 0 | 0.34 | 2019 |
| Lightweight merging of compressed indices based on BWT variants. | 1 | 0.36 | 2019 |
| Space-efficient merging of succinct de Bruijn graphs. | 0 | 0.34 | 2019 |
| External memory BWT and LCP computation for sequence collections with applications. | 3 | 0.41 | 2018 |
| Lightweight BWT and LCP Merging via the Gap Algorithm. | 5 | 0.45 | 2017 |
| Design and analysis of periodic multiple seeds | 4 | 0.41 | 2014 |
| Better spaced seeds using Quadratic Residues. | 8 | 0.49 | 2013 |
| Spaced seeds design using perfect rulers | 4 | 0.41 | 2011 |
| Double-exponential inseparability of Robinson subsystem Q | 0 | 0.34 | 2011 |
| A modular approach to user-defined symbolic periodicities | 4 | 0.39 | 2008 |
| A Mathematical Framework for the Semantics of Symbolic Languages Representing Periodic Time | 10 | 0.54 | 2006 |
| From digital audiobook to secure digital multimedia-book | 1 | 0.35 | 2006 |
| Modelling a Secure Agent with Team Automata | 5 | 0.42 | 2006 |
| A flexible approach to user-defined symbolic granularities in temporal databases | 5 | 0.40 | 2005 |
| Anonymity and certification: e-mail, a case study | 0 | 0.34 | 2004 |
| A Lattice of Classes of User-Defined Symbolic Periodicities | 10 | 0.54 | 2004 |
| Authentication and access delegation with user-released certificates | 0 | 0.34 | 2003 |
| Minimal Information Disclosure in a Centralized Authorization System | 1 | 0.40 | 2003 |
| Hilbert function and complexity lower bounds for symmetric Boolean functions | 3 | 0.42 | 1999 |
| A quantifier elimination for the theory of p-adic numbers | 0 | 0.34 | 1998 |
| Operational, denotational and logical descriptions: a case study | 27 | 1.53 | 1992 |
| The Lazy Call-By-Value Lambda-Calculus | 0 | 0.34 | 1991 |
