Grigorios Loukides

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
Minimizing the minimizers via alphabet reordering Theoretical Computer Science	2026-06-15	Paper
Approximate suffix-prefix dictionary queries	2026-05-12	Paper
On strings having the same length-k substrings Theory of Computing Systems	2026-04-27	Paper
Minimizing the minimizers via alphabet reordering	2025-12-02	Paper
Connecting de Bruijn graphs	2025-12-02	Paper
Missing value replacement in strings and applications Data Mining and Knowledge Discovery	2025-03-24	Paper
Suffix-prefix queries on a dictionary	2024-10-21	Paper
Sparse suffix and LCP array: simple, direct, small, and fast	2024-05-31	Paper
Pattern masking for dictionary matching: theory and practice Algorithmica	2024-05-30	Paper
Frequency-constrained substring complexity	2024-05-29	Paper
Making de Bruijn graphs Eulerian	2024-05-06	Paper
On strings having the same length-\(k\) substrings	2024-05-06	Paper
Pattern masking for dictionary matching (available as arXiv preprint)	2024-01-15	Paper
Bidirectional String Anchors: A New String Sampling Mechanism	2023-09-20	Paper
scientific article; zbMATH DE number 7651098 (Why is no real title available?)	2023-02-07	Paper
Reverse-safe text indexing ACM Journal of Experimental Algorithmics	2022-09-06	Paper
All-pairs suffix/prefix in optimal time using Aho-Corasick space Information Processing Letters	2022-09-02	Paper
Beyond the BEST theorem: fast assessment of Eulerian trails	2022-05-20	Paper
Reverse-safe data structures for text indexing 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX)	2021-01-27	Paper
Influence maximization in the presence of vulnerable nodes: a ratio perspective Theoretical Computer Science	2021-01-25	Paper

Research outcomes over time

This page was built for person: Grigorios Loukides