Image de couverture de livre

The consensus number of a shift register equals its width

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Aspnes, James
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Obfuscated Consensus
par: Aspnes, James, et autres
Publié: (2025)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
par: Lingas, Andrzej
Publié: (2024)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
par: Attiya, Hagit, et autres
Publié: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
par: Gąsieniec, Leszek, et autres
Publié: (2025)

Sublinear-Time Sampling of Spanning Trees in the Congested Clique
par: Pemmaraju, Sriram V., et autres
Publié: (2024)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
par: Gąsieniec, Leszek, et autres
Publié: (2024)

An Analysis of Avalanche Consensus
par: Amores-Sesar, Ignacio, et autres
Publié: (2024)

Clock Synchronization Is Almost Impossible with Bounded Memory
par: Charron-Bost, Bernadette, et autres
Publié: (2024)

Near-Optimal Wafer-Scale Reduce
par: Luczynski, Piotr, et autres
Publié: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
par: Gupta, Chetan, et autres
Publié: (2024)

Distributed Rhombus Formation of Sliding Squares
par: Kostitsyna, Irina, et autres
Publié: (2025)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
par: Kowalski, Dariusz R., et autres
Publié: (2025)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
par: Lingas, Andrzej
Publié: (2024)

FedMon: Federated eBPF Monitoring for Distributed Anomaly Detection in Multi-Cluster Cloud Environments
par: Zehra, Sehar, et autres
Publié: (2025)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
par: Lingas, Andrzej
Publié: (2026)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
par: Faour, Salwa, et autres
Publié: (2025)

Data Scheduling Algorithm for Scalable and Efficient IoT Sensing in Cloud Computing
par: Mohammad, Noor Islam S.
Publié: (2025)

RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection
par: Li, Yifei, et autres
Publié: (2025)

Decentralized Distributed Graph Coloring: Cluster Graphs
par: Flin, Maxime, et autres
Publié: (2024)

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
par: Maas, Nikolai
Publié: (2026)

Gathering Semi-Synchronously Scheduled Two-State Robots
par: Otaka, Kohei, et autres
Publié: (2024)

Low-Depth Spatial Tree Algorithms
par: Baumann, Yves, et autres
Publié: (2024)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
par: Balliu, Alkida, et autres
Publié: (2023)

Notes on Theory of Distributed Systems
par: Aspnes, James
Publié: (2020)

Stably computable relations and predicates
par: Aspnes, James
Publié: (2024)

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
par: Bok, Jan, et autres
Publié: (2025)

Scalable overset computation between a forest-of-octrees- and an arbitrary distributed parallel mesh
par: Brandt, Hannes, et autres
Publié: (2026)

Scalability Optimization in Cloud-Based AI Inference Services: Strategies for Real-Time Load Balancing and Automated Scaling
par: Jin, Yihong, et autres
Publié: (2025)

AAFLOW: Scalable Patterns for Agentic AI Workflows
par: Sarker, Arup Kumar, et autres
Publié: (2026)

CooperLLM: Cloud-Edge-End Cooperative Federated Fine-tuning for LLMs via ZOO-based Gradient Correction
par: Sun, He, et autres
Publié: (2026)

Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
par: Felber, Stephan, et autres
Publié: (2024)

Stochastic well-structured transition systems
par: Aspnes, James
Publié: (2025)

Towards Communication-Efficient Peer-to-Peer Networks
par: Hourani, Khalid, et autres
Publié: (2024)

Restless reachability problems in temporal graphs
par: Thejaswi, Suhas, et autres
Publié: (2020)

Fast Gossip-based Rumor Spreading using Small Messages
par: Dufoulon, Fabien, et autres
Publié: (2026)

Augmenting the FedProx Algorithm by Minimizing Convergence
par: Sarkar, Anomitra, et autres
Publié: (2024)

Conflict-Freedom as a Progress Condition
par: Kuznetsov, Petr, et autres
Publié: (2026)

On Reduction and Synthesis of Petri's Cycloids
par: Valk, Rüdiger, et autres
Publié: (2025)

Modelling cooperating failure-resilient Processes
par: Valk, Rüdiger
Publié: (2024)

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
par: Hirose, Jion, et autres
Publié: (2025)