5 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.FL2021★ 5 cited
The Complexity of Learning Linear Temporal Formulas from Examples
Nathanaël Fijalkow, Guillaume Lagarde
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragme…
cs.DS2020★ 3 cited
On Efficient Low Distortion Ultrametric Embedding
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
A classic problem in unsupervised learning and data analysis is to find simpler and easy-to-visualize representations of the data that preserve its essential properties. A widely-u…
cs.DS2017
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
Guillaume Lagarde, Sylvain Perifel
The so-called "one-bit catastrophe" for the compression algorithm LZ'78 asks whether the compression ratio of an infinite word can change when a single bit is added in front of it.…