Tolerance to asynchrony in algorithms for multiplication and modulo

DOI10.1016/J.TCS.2024.114914MaRDI QIDQ6652457zbMATH OpenFDO

Authors Arya Tanmay Gupta, Sandeep S. Kulkarni

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114914

zbMATH Keywords

asynchronylattice-linearitymodulomultiplicationself-stabilization

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Extending Lattice Linearity for Self-stabilizing Algorithms
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• Asynchronous Fault-Tolerant Total Ordering Algorithms
• Dynamic FTSS in asynchronous systems: the case of unison
• Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems

Cites work

• A Lattice Linear Predicate Parallel Algorithm for the Housing Market Problem
• A method for obtaining digital signatures and public-key cryptosystems
• Brief announcement: Fully lattice linear algorithms
• Efficient detection of restricted classes of global predicates
• Extending Lattice Linearity for Self-stabilizing Algorithms
• Highly parallel computations modulo a number having only small prime factors
• Performance analysis of the parallel Karatsuba multiplication algorithm for distributed memory architectures

This page was built for publication: Tolerance to asynchrony in algorithms for multiplication and modulo

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652457)