Skip to main content

Research Repository

Advanced Search

Outputs (63)

Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape (2025)
Presentation / Conference Contribution
Austin, H., Gadouleau, M., Mertzios, G. B., & Trehan, A. (2025, June). Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape. Presented at ACM Principles of Distributed Computing (PODC) 2025, Huatulco, Mexico

Broadcast is a central problem in distributed computing. Recently, Hussak and Trehan [PODC'19/DC'23] proposed a stateless broadcasting protocol (Amnesiac Flooding), which was surprisingly proven to terminate in asymptotically optimal time (linear in... Read More about Brief Announcement: Amnesiac Flooding: Easy to Break, Hard to Escape.

Generalising the maximum independent set algorithm via Boolean networks (2025)
Journal Article
Gadouleau, M., & Kutner, D. C. (2025). Generalising the maximum independent set algorithm via Boolean networks. Information and Computation, 303, Article 105266. https://doi.org/10.1016/j.ic.2025.105266

A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider the generali... Read More about Generalising the maximum independent set algorithm via Boolean networks.

Graphs with minimum degree-entropy (2024)
Journal Article
Dong, Y., Gadouleau, M., Wan, P., & Zhang, S. (2024). Graphs with minimum degree-entropy. Information Sciences, 671, 120629. https://doi.org/10.1016/j.ins.2024.120629

We continue studying extremal values of the degree-entropy, which is an information-theoretic measure defined as the Shannon entropy based on the information functional involving vertex degrees. For a graph with a given number of vertices and edges a... Read More about Graphs with minimum degree-entropy.

Factorisation in the semiring of finite dynamical systems (2024)
Journal Article
Naquin, É., & Gadouleau, M. (2024). Factorisation in the semiring of finite dynamical systems. Theoretical Computer Science, 998, Article 114509. https://doi.org/10.1016/j.tcs.2024.114509

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs have a sum... Read More about Factorisation in the semiring of finite dynamical systems.

The MacWilliams Identity for the Skew Rank Metric (2023)
Journal Article
Friedlander, I., Bouganis, A., & Gadouleau, M. (2025). The MacWilliams Identity for the Skew Rank Metric. Advances in Mathematics of Communications, 19(1), 140-179. https://doi.org/10.3934/amc.2023045

The weight distribution of an error correcting code is a crucial statistic in determining its performance. One key tool for relating the weight of a code to that of it's dual is the MacWilliams Identity, first developed for the Hamming metric. This i... Read More about The MacWilliams Identity for the Skew Rank Metric.

Graphs with minimum fractional domatic number (2023)
Journal Article
Gadouleau, M., Harms, N., Mertzios, G. B., & Zamaraev, V. (2024). Graphs with minimum fractional domatic number. Discrete Applied Mathematics, 343, 140-148. https://doi.org/10.1016/j.dam.2023.10.020

The domatic number of a graph is the maximum number of vertex disjoint dominating sets that partition the vertex set of the graph. In this paper we consider the fractional variant of this notion. Graphs with fractional domatic number 1 are exactly th... Read More about Graphs with minimum fractional domatic number.

Bent functions in the partial spread class generated by linear recurring sequences (2022)
Journal Article
Gadouleau, M., Mariot, L., & Picek, S. (2023). Bent functions in the partial spread class generated by linear recurring sequences. Designs, Codes and Cryptography, 91(1), 63-82. https://doi.org/10.1007/s10623-022-01097-1

We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if their feedba... Read More about Bent functions in the partial spread class generated by linear recurring sequences.

Expansive automata networks (2020)
Journal Article
Bridoux, F., Gadouleau, M., & Theyssier, G. (2020). Expansive automata networks. Theoretical Computer Science, 843, 25-44. https://doi.org/10.1016/j.tcs.2020.06.019

An Automata Network is a map where Q is a finite alphabet. It can be viewed as a network of n entities, each holding a state from Q, and evolving according to a deterministic synchronous update rule in such a way that each entity only depends on its... Read More about Expansive automata networks.