cs.DC · 2026-10-10 · No. 139

Distributed, Parallel, and Cluster Computing, 2026-10-10.

4 new papers in cs.DC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

4 entries
  1. 01

    Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents

    Khaled Jawhar, Evangelos Kranakis

    cs.DC

    We study a problem of searching for a mobile target in an $m$-ray star graph, a natural generalization of linear search to multiple directions. The target is placed adversarially on one of the rays and may move with constant speed. We investigate a two-robot setting, where cooperation and communication play a central role. We study two communication models: the Face-to-Face (F2F) model, where robots communicate only upon meeting, and the...

    arxiv.org/abs/2610.11955 · PDF

  2. 02

    NosRacer: Dynamic Detection of Race Conditions in On-Device Network Operating Systems

    Runze Wu, Jingbo Zhai, Shanming Ping, Lingzhi Ouyang, Hua Duan, Qin Zou, Chengcheng Huang, Bingshe Liu, Xudong Lang,...

    cs.DC · cs.SE

    Commercial on-device network operating systems (NOSes) run complex control planes in production routers and switches, where configuration update tasks are executed by multiple loosely coupled components through asynchronous message passing. Such executions are prone to race conditions: the same ordered input commands may produce different outcomes when messages are delivered in different orders. The race conditions are difficult to expose...

    arxiv.org/abs/2610.11875 · PDF

  3. 03

    Federated Zeroth-Order Optimization with Direction Aggregation and Variance Reduction

    Qianlong Dang, Baosheng Li

    cs.DC

    We study constrained nonsmooth nonconvex stochastic optimization in federated settings, where clients access only stochastic function evaluations. Existing federated zeroth-order methods primarily combine local zeroth-order updates with model averaging. However, they struggle with client drift induced by local projected updates and sampling variance in stochastic zeroth-order estimates. In this paper, we propose a federated zeroth-order...

    arxiv.org/abs/2610.11821 · PDF

  4. 04

    New Contraction Bounds for Multidimensional Asymptotic Consensus in Dynamic Networks

    Zeremonienmeister Berber Aab, Darya Melnyk, Stefan Schmid

    cs.DC

    This work studies the multidimensional asymptotic agreement problem in dynamic networks. We assume that nodes have $d$-dimensional inputs and need to converge arbitrarily close to each other's inputs while their vectors stay inside the convex hull of all inputs. We present a new upper bound of $\sqrt{2d/(3d+1)}$ on the contraction rate of asymptotic agreement in the non-split network model, where $d$ is the dimension of the input and...

    arxiv.org/abs/2610.11805 · PDF

This edition is part of The Daily Abstract — cs.DC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.