Hilde Verbeek
From MaRDI portal
Person:6547926
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| When is string reconstruction using de Bruijn graphs hard? | 2026-08-31 | Paper |
| Minimizing the minimizers via alphabet reordering Theoretical Computer Science | 2026-06-15 | Paper |
| Minimizing the minimizers via alphabet reordering | 2025-12-02 | Paper |
| Sparse suffix and LCP array: simple, direct, small, and fast | 2024-05-31 | Paper |
Research outcomes over time
This page was built for person: Hilde Verbeek
