Confidential information protection method of commercial information physical system based on edge computing

X Zhang, J Lu, D Li - Neural Computing and Applications, 2021 - Springer
With the rapid integration and wide application of the enterprise Internet of Things, big data
and 5G-class large networks, traditional enterprise cloud computing systems cannot timely …

Local certification of local properties: tight bounds, trade-offs and new parameters

N Bousquet, L Feuilloley, S Zeitoun - arXiv preprint arXiv:2312.13702, 2023 - arxiv.org
Local certification is a distributed mechanism enabling the nodes of a network to check the
correctness of the current configuration, thanks to small pieces of information called …

Making randomized algorithms self-stabilizing

V Turau - International Colloquium on Structural Information and …, 2019 - Springer
It is well known that the areas of self-stabilizing algorithms and local algorithms are closely
related. Using program transformation techniques local algorithms can be made self …

Self-Stabilizing Fully Adaptive Maximal Matching

S Bitton, Y Emek, T Izumi, S Kutten - … International Conference on …, 2025 - drops.dagstuhl.de
A self-stabilizing randomized algorithm for mending maximal matching (MM) in synchronous
networks is presented. Starting from a legal MM configuration and assuming that the network …

Self-stabilizing domination algorithms

ST Hedetniemi - Structures of Domination in Graphs, 2021 - Springer
In this chapter, we introduce the self-stabilizing algorithm model and present several
definitive examples that illustrate the simplicity and elegance of this algorithmic paradigm …

Fully adaptive self-stabilizing transformer for lcl problems

S Bitton, Y Emek, T Izumi, S Kutten - arXiv preprint arXiv:2105.09756, 2021 - arxiv.org
The first generic self-stabilizing transformer for local problems in a constrained bandwidth
model is introduced. This transformer can be applied to a wide class of locally checkable …

Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach

Y Emek, Y Gil, N Harlev - 26th International Conference on …, 2023 - drops.dagstuhl.de
Self-stabilization is an important concept in the realm of fault-tolerant distributed computing.
In this paper, we propose a new approach that relies on the properties of linear …

Self-stabilization and byzantine tolerance for maximal matching

S Kunne, J Cohen, L Pilard - … on Stabilizing, Safety, and Security of …, 2018 - Springer
We analyse the impact of transient and Byzantine faults on the construction of a maximal
matching in a general network. We consider the self-stabilizing algorithm called AnonyMatch …

[HTML][HTML] A self-stabilizing algorithm for b-matching

CU Ileri, O Dagdeviren - Theoretical Computer Science, 2019 - Elsevier
We present the first self-stabilizing algorithm for finding a maximal b-matching in arbitrary
networks and under distributed unfair (adversarial) schedulers. The previous self-stabilizing …

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs

J Cohen, J Lefèvre, K Maamra, G Manoussakis… - Theoretical Computer …, 2019 - Elsevier
We present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in
a general graph. The previous best known algorithm has been presented by Manne et …