:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chang, Yi-Jun, Chen, Lyuting, Zhou, Haoran
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	https://arxiv.org/abs/2511.23297
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
by: Chalopin, Jérémie, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

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

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

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

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

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

Different Perspectives on FLP Impossibility
by: Klianev, Ivan
Published: (2022)

Pending Conflicts Make Progress Impossible
by: Kuznetsov, Petr, et al.
Published: (2026)

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

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

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

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

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

Circumventing the FLP Impossibility Result with Open Atomic Ethernet
by: Borrill, Paul
Published: (2026)

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

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
by: Parzych, Garrett, et al.
Published: (2024)

Quantum Communication Advantage for Leader Election and Agreement
by: Dufoulon, Fabien, et al.
Published: (2025)

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

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Are Bus-Mounted Edge Servers Feasible?
by: Li, Xuezhi, et al.
Published: (2025)

CoEdge-RAG: Optimizing Hierarchical Scheduling for Retrieval-Augmented LLMs in Collaborative Edge Computing
by: Hong, Guihang, et al.
Published: (2025)

GRNND: A GPU-Parallel Relative NN-Descent Algorithm for Efficient Approximate Nearest Neighbor Graph Construction
by: Li, Xiang, et al.
Published: (2025)

Distributed Renaming with Subquadratic Bits via Scalable Committee Election
by: Bai, Sirui, et al.
Published: (2026)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
by: Brandt, Sebastian, et al.
Published: (2022)

Beyond End-to-End: Dynamic Chain Optimization for Private LLM Adaptation on the Edge
by: Wu, Yebo, et al.
Published: (2026)

A Thorough Investigation of Content-Defined Chunking Algorithms for Data Deduplication
by: Gregoriadis, Marcel, et al.
Published: (2024)

MSAO: Adaptive Modality Sparsity-Aware Offloading with Edge-Cloud Collaboration for Efficient Multimodal LLM Inference
by: Yang, Zheming, et al.
Published: (2026)