Imagen de Portada

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chalopin, Jérémie, Chang, Yi-Jun, Chen, Lyuting, Di Luna, Giuseppe A., Zhou, Haoran
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Content-Oblivious Leader Election in 2-Edge-Connected Networks
por: Chalopin, Jérémie, et al.
Publicado: (2025)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
por: Chang, Yi-Jun, et al.
Publicado: (2025)

Efficient Counting and Simulation in Content-Oblivious Rings
por: Chalopin, Jérémie, et al.
Publicado: (2026)

Leader Election via Unique Sink Orientation
por: Chalopin, Jérémie, et al.
Publicado: (2025)

Content-Oblivious Leader Election on Rings
por: Frei, Fabian, et al.
Publicado: (2024)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
por: Chalopin, Jérémie, et al.
Publicado: (2024)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
por: Chalopin, Jérémie, et al.
Publicado: (2025)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
por: Chalopin, Jérémie, et al.
Publicado: (2024)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
por: Chalopin, Jérémie, et al.
Publicado: (2026)

PALE: Partially Asynchronous Agile Leader Election
por: Sidik, Bronislav, et al.
Publicado: (2018)

Black Hole Search by Scattered Agents in Dynamic Rings
por: Di Luna, Giuseppe Antonio, et al.
Publicado: (2024)

Oblivious Robots Under Round Robin: Gathering on Rings
por: Navarra, Alfredo, et al.
Publicado: (2025)

Minimalist Leader Election Under Weak Communication
por: Vacus, Robin, et al.
Publicado: (2025)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
por: Chalopin, Jérémie, et al.
Publicado: (2026)

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
por: Di Luna, Giuseppe A., et al.
Publicado: (2020)

Optimizing Streamlined Blockchain Consensus with Generalized Weighted Voting and Enhanced Leader Rotation
por: Micloiu, Diana, et al.
Publicado: (2024)

Optimal Uniform Circle Formation by Asynchronous Luminous Robots
por: Feletti, Caterina, et al.
Publicado: (2024)

Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency
por: Gao, Yingzi, et al.
Publicado: (2022)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
por: Kaur, Tanvir, et al.
Publicado: (2024)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
por: Austin, Henry, et al.
Publicado: (2025)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
por: Sadhukhan, Abhijit, et al.
Publicado: (2026)

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
por: Di Luna, Giuseppe A., et al.
Publicado: (2024)

Asymptotic Analysis of a Leader Election Algorithm
por: Lavault, Christian, et al.
Publicado: (2006)

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
por: Sudo, Yuichi
Publicado: (2025)

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
por: Kanaya, Haruki, et al.
Publicado: (2024)

Reputation-Based Leader Election under Partial Synchrony: Towards a Protocol-Independent Abstraction with Enhanced Guarantees
por: Liu, Xuyang, et al.
Publicado: (2025)

Ordered Momentum for Asynchronous SGD
por: Shi, Chang-Wei, et al.
Publicado: (2024)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
por: Takahashi, Shota, et al.
Publicado: (2025)

Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers
por: Flocchini, Paola, et al.
Publicado: (2024)

AGILE: Lightweight and Efficient Asynchronous GPU-SSD Integration
por: Yang, Zhuoping, et al.
Publicado: (2025)

Linear Search for Capturing an Oblivious Mobile Target in the Sender/Receiver Model
por: Jawhar, Khaled, et al.
Publicado: (2025)

Oblivious Robots Performing Different Tasks on Grid Without Knowing their Team Members
por: Ghosh, Satakshi, et al.
Publicado: (2022)

Asynchronous Federated Learning Using Outdated Local Updates Over TDMA Channel
por: Song, Jaeyoung, et al.
Publicado: (2024)

Efficient Computation in Congested Anonymous Dynamic Networks
por: Di Luna, Giuseppe A., et al.
Publicado: (2023)

Optimal Computation in Anonymous Dynamic Networks
por: Di Luna, Giuseppe A., et al.
Publicado: (2022)

DGRO: Diameter-Guided Ring Optimization for Integrated Research Infrastructure Membership
por: Wu, Shixun, et al.
Publicado: (2024)

Space and Move-optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm
por: Sharma, Avisek, et al.
Publicado: (2023)

Enabling Scientific Workflow Scheduling Research in Non-Uniform Memory Access Architectures
por: Vivas, Aurelio, et al.
Publicado: (2025)

Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus
por: Putnik, Marko, et al.
Publicado: (2026)

Boosting Blockchain Throughput: Parallel EVM Execution with Asynchronous Storage for Reddio
por: Qi, Xiaodong, et al.
Publicado: (2025)