7 citations · 9 across the 7 of their papers we have counts for
8 papers
Privacy Guard & Token Parsimony by Prompt and Context Handling and LLM Routing
Alessio Langiu
The large-scale adoption of Large Language Models (LLMs) forces a trade-off between operational cost (OpEx) and data privacy. Current routing frameworks reduce costs but ignore pro…
Abelian Powers and Repetitions in Sturmian Words
Gabriele Fici, Alessio Langiu, Thierry Lecroq +4
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent for every . We imp…
Algorithms for Longest Common Abelian Factors
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu +1
In this paper we consider the problem of computing the longest common abelian factor (LCAF) between two given strings. We present a simple time algorithm, where is…
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
For a partial word the longest common compatible prefix of two positions , denoted , is the largest such that , where $\uparr…
Order-Preserving Suffix Trees and Their Algorithmic Applications
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for c…
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
Dynamic dictionary-based compression schemes are the most daily used data compression schemes since they appeared in the foundational papers of Ziv and Lempel in 1977, commonly ref…