Cover Image

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Padalkin, Andreas, Scheideler, Christian
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
by: Hillebrandt, Henning, et al.
Published: (2026)

On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits
by: Artmann, Matthias, et al.
Published: (2025)

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
by: Almalki, Nada, et al.
Published: (2025)

A Heuristic Algorithm for Shortest Path Search
by: Yu, Huashan, et al.
Published: (2025)

Towards Learning-Augmented Peer-to-Peer Networks: Self-Stabilizing Graph Linearization with Untrusted Advice
by: Aradhya, Vijeth, et al.
Published: (2025)

DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
by: Feng, Yelai, et al.
Published: (2022)

SSSP-Del: Fully Dynamic Distributed Algorithm for Single-Source Shortest Path
by: Javanrood, Parshan, et al.
Published: (2025)

Supervised Distributed Computing
by: Augustine, John, et al.
Published: (2025)

Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on x86 Architectures
by: Calderón, Sergio, et al.
Published: (2024)

A Lightweight Approach for State Machine Replication
by: Cachin, Christian, et al.
Published: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)

Distributed And Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs
by: Dou, Jinfeng, et al.
Published: (2024)

Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
by: Augustine, John, et al.
Published: (2026)

Distributed Q-learning-based Shortest-Path Tree Construction in IoT Sensor Networks
by: Vo, Van-Vi, et al.
Published: (2025)

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

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
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)

Fast Reconfiguration for Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2022)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Parallel Point-to-Point Shortest Paths and Batch Queries
by: Dong, Xiaojun, et al.
Published: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

Distributed Rhombus Formation of Sliding Squares
by: Kostitsyna, Irina, et al.
Published: (2025)

Minimize Your Critical Path with Combine-and-Exchange Locks
by: König, Simon, et al.
Published: (2025)

RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs
by: Chen, Yanru, et al.
Published: (2025)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
by: Chang, Yi-Jun, et al.
Published: (2023)

Exploiting the Uncertainty of the Longest Paths: Response Time Analysis for Probabilistic DAG Tasks
by: Gao, Yiyang, et al.
Published: (2025)

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

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

RASC: Enhancing Observability & Programmability in Smart Spaces
by: Karanika, Anna, et al.
Published: (2026)

A Flexible Programmable Pipeline Parallelism Framework for Efficient DNN Training
by: Jiang, Lijuan, et al.
Published: (2025)

Why Atomicity Matters to AI/ML Infrastructure: Snapshots, Firmware Updates, and the Cost of the Forward-In-Time-Only Category Mistake
by: Borrill, Paul
Published: (2026)

Multi-Path Bound for DAG Tasks
by: He, Qingqiang, et al.
Published: (2023)

A Discussion about Computational Challenges of Programmable Money in Blockchain-based CBDCs
by: da Conceição, Arlindo F., et al.
Published: (2024)

DynaFlow: Transparent and Flexible Intra-Device Parallelism via Programmable Operator Scheduling
by: Pan, Yi, et al.
Published: (2026)

AeroDaaS: A Programmable Drones-as-a-Service Platform for Intelligent Aerial Systems
by: Astu, Kautuk, et al.
Published: (2026)

Lessons Learned on the Path to Guaranteeing the Error Bound in Lossy Quantizers
by: Fallin, Alex, et al.
Published: (2024)

WOC: Dual-Path Weighted Object Consensus Made Efficient
by: Fonseca, Tanisha, et al.
Published: (2025)

Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
by: Saxena, Ashish, et al.
Published: (2025)

Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components
by: Coleman, Jared, et al.
Published: (2024)

Persistent HyTM via Fast Path Fine-Grained Locking
by: Coccimiglio, Gaetano, et al.
Published: (2025)