Grigorios Loukides

From MaRDI portal
Person:2140494

Available identifiers

zbMath Open loukides.grigoriosMaRDI QIDQ2140494

List of research outcomes





PublicationDate of PublicationType
Suffix-prefix queries on a dictionary2024-10-21Paper
Sparse suffix and LCP array: simple, direct, small, and fast2024-05-31Paper
Pattern masking for dictionary matching: theory and practice2024-05-30Paper
Frequency-constrained substring complexity2024-05-29Paper
Making de Bruijn graphs Eulerian2024-05-06Paper
On strings having the same length-\(k\) substrings2024-05-06Paper
https://portal.mardi4nfdi.de/entity/Q61878332024-01-15Paper
Bidirectional String Anchors: A New String Sampling Mechanism2023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q58744332023-02-07Paper
Reverse-Safe Text Indexing2022-09-06Paper
All-pairs suffix/prefix in optimal time using Aho-Corasick space2022-09-02Paper
Beyond the BEST theorem: fast assessment of Eulerian trails2022-05-20Paper
Reverse-Safe Data Structures for Text Indexing2021-01-27Paper
Influence maximization in the presence of vulnerable nodes: a ratio perspective2021-01-25Paper

Research outcomes over time

This page was built for person: Grigorios Loukides

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2140494&oldid=7387383"
Powered by MediaWiki