Cover Image

2-Coloring Cycles in One Round

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Flin, Maxime, Raevskaya, Alesya, Stimpert, Ronja, Suomela, Jukka, Yang, Qingxin
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Classification of Local Optimization Problems in Directed Cycles
by: Boudier, Thomas, et al.
Published: (2026)

A Forward Simulation-Based Hierarchy of Linearizable Concurrent Objects
by: Wang, Chao, et al.
Published: (2026)

Population Protocols over Ordered Agents
by: Blondin, Michael, et al.
Published: (2026)

Verifying Randomized Consensus Protocols with Common Coins
by: Gao, Song, et al.
Published: (2024)

State machines for large scale computer software and systems
by: Yodaiken, Victor
Published: (2016)

The Black Ninjas and the Sniper: On Robustness of Population Protocols
by: Lossin, Benno, et al.
Published: (2024)

Logical Synchrony Networks: A formal model for deterministic distribution
by: Kenwright, Logan, et al.
Published: (2024)

Synchronizability of Communicating Finite State Machines is not Decidable
by: Finkel, Alain, et al.
Published: (2017)

Implementability of Global Distributed Protocols modulo Network Architectures
by: Li, Elaine, et al.
Published: (2026)

Complete Multiparty Session Type Projection with Automata
by: Li, Elaine, et al.
Published: (2023)

On defining and modeling context-awareness
by: Rodis, Panteleimon
Published: (2026)

Smart Casual Verification of the Confidential Consortium Framework
by: Howard, Heidi, et al.
Published: (2024)

HistMSO: A Logic for Reasoning about Consistency Models with MONA
by: Coget, Isabelle, et al.
Published: (2026)

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
by: Guillou, Lucie, et al.
Published: (2023)

It does not matter how you define locally checkable labelings
by: Cruciani, Antonio, et al.
Published: (2026)

Pushing the Limit: Verified Performance-Optimal Causally-Consistent Database Transactions
by: Ghasemirad, Shabnam, et al.
Published: (2024)

Deciding Serializability in Network Systems
by: Amir, Guy, et al.
Published: (2026)

Promoting Simple Agents: Ensemble Methods for Event-Log Prediction
by: Bollig, Benedikt, et al.
Published: (2026)

Mixed Choice in Asynchronous Multiparty Session Types
by: Bocchi, Laura, et al.
Published: (2026)

Types for Grassroots Logic Programs
by: Shapiro, Ehud
Published: (2026)

Decidability Issues for Petri Nets -- a survey
by: Esparza, Javier, et al.
Published: (2024)

LLM-based policy generation for intent-based management of applications
by: Dzeparoska, Kristina, et al.
Published: (2024)

Computing Inductive Invariants of Regular Abstraction Frameworks
by: Czerner, Philipp, et al.
Published: (2024)

On the Universality of Round Elimination Fixed Points
by: Balliu, Alkida, et al.
Published: (2025)

Practical Livelock Analysis in Parameterized Unidirectional Rings
by: Farahat, Aly
Published: (2026)

Simulation by Rounds of Letter-to-Letter Transducers
by: Nassar, Antonio Abu, et al.
Published: (2021)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
by: Yang, Andy, et al.
Published: (2025)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
by: Flin, Maxime, et al.
Published: (2024)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

Random Deterministic Automata With One Added Transition
by: Carayol, Arnaud, et al.
Published: (2024)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)