Fully Lattice Linear Algorithms

09/29/2022
by   Arya Tanmay Gupta, et al.
0

This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called (fully) lattice linear algorithms. A property of these algorithms is that they induce a partial order among all states and form multiple lattices. An initial state locks in one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2022

Lattice Linear Problems vs Algorithms

Modelling problems using predicates that induce a partial order among gl...
research
05/14/2022

Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture

We consider minimal-perimeter lattice animals, providing a set of condit...
research
02/14/2023

Multiplication and Modulo are Lattice Linear

In this paper, we analyze lattice linearity of multiplication and modulo...
research
07/10/2019

Evolutionary techniques in lattice sieving algorithms

Lattice-based cryptography has recently emerged as a prominent candidate...
research
09/12/2022

On the Utility of Buffers in Pick-n-Swap Based Lattice Rearrangement

We investigate the utility of employing multiple buffers in solving a cl...
research
09/27/2021

Extending Lattice linearity for Self-Stabilizing Algorithms

In this article, we focus on extending the notion of lattice linearity t...
research
07/16/2022

The pure spectrum of a residuated lattice

This paper studies a fascinating type of filter in residuated lattices, ...

Please sign up or login with your details

Forgot password? Click here to reset