output
20002025
most citedA Dichotomy Theorem for Polynomial Evaluation

124 citations

62 papers

cs.DM2025

Making Graphs Irregular through Irregularising Walks

Julien Bensmail, Romain Bourneuf, Paul Colinot +2

The 1-2-3 Conjecture, introduced by Karoński, Łuczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph different from , we c…

cs.LO2025

Distributed Transition System with Tags and Value-wise Metric, for Privacy Analysis

Siva Anantharaman, Sabine Frittella, Benjamin Nguyen

We introduce a logical framework named Distributed Labeled Tagged Transition System (DLTTS), using concepts from Probabilistic Automata, Probabilistic Concurrent Systems, and Proba…

cs.DB2024

From Text to Databases: attribute grammar as database meta-model

Jacques Chabin, Mirian Halfeld-Ferrari, Nicolas Hiot

We present a general methodology for structuring textual data, represented as syntax trees enriched with semantic information, guided by a meta-model G defined as an attribute gram…

cs.DM2024

Strict Self-Assembly of Discrete Self-Similar Fractal Shapes

Florent Becker

This paper gives a (polynomial time) algorithm to decide whether a given Discrete Self-Similar Fractal Shape can be assembled in the aTAM model.In the positive case, the constructi…

cs.DB2023

Incremental Consistent Updating of Incomplete Databases

Jacques Chabin, Mirian Halfeld Ferrari, Nicolas Hiot +1

Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of datab…

math.LO2022★ 7 cited

Qualitative reasoning in a two-layered framework

Marta Bilkova, Sabine Frittella, Daniil Kozhemiachenko +1

The reasoning with qualitative uncertainty measures involves comparative statements about events in terms of their likeliness without necessarily assigning an exact numerical value…