:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sudo, Yuichi, Ooshita, Fukuhito, Kamei, Sayaka
Format:	Preprint
Publié:	2020
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	https://arxiv.org/abs/2010.08929
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
par: Kakugawa, Hirotsugu, et autres
Publié: (2025)

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
par: Bramas, Quentin, et autres
Publié: (2023)

Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols
par: Kanaya, Haruki, et autres
Publié: (2025)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
par: Takahashi, Shota, et autres
Publié: (2025)

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

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
par: Sudo, Yuichi, et autres
Publié: (2026)

Complete Graph Identification in Population Protocols
par: Kanaya, Haruki, et autres
Publié: (2024)

Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
par: Araya, Takumi, et autres
Publié: (2024)

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
par: Hirose, Jion, et autres
Publié: (2025)

Stand-Up Indulgent Gathering on Rings
par: Bramas, Quentin, et autres
Publié: (2024)

Near-linear Time Dispersion of Mobile Agents
par: Sudo, Yuichi, et autres
Publié: (2023)

Exploration on Highly Dynamic Graphs
par: Saxena, Ashish, et autres
Publié: (2026)

Semi-Synchronous Exploration in Dynamic Graphs
par: Saxena, Ashish, et autres
Publié: (2026)

Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
par: Saxena, Ashish, et autres
Publié: (2025)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
par: Bhagat, Subhash, et autres
Publié: (2024)

Self-stabilization and byzantine tolerance for maximal independent
par: Cohen, Johanne, et autres
Publié: (2022)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
par: Akker, Erik van den, et autres
Publié: (2024)

Stochastic Distance in Property Testing
par: Meir, Uri, et autres
Publié: (2024)

Parallel Online Directed Acyclic Graph Exploration for Atlasing Soft-Matter Assembly Configuration Spaces
par: Prabhu, Rahul, et autres
Publié: (2024)

Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
par: Bar, Rajashree, et autres
Publié: (2025)

Decentralized and Self-adaptive Core Maintenance on Temporal Graphs
par: Rucci, Davide, et autres
Publié: (2025)

Stream-K Optimization and Exploration
par: Rackley, Nick, et autres
Publié: (2024)

Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
par: Goswami, Pritam, et autres
Publié: (2024)

When Agents are Powerful: Black Hole Search with Verification in Time-Varying Graphs
par: Kaur, Tanvir, et autres
Publié: (2025)

Exploration of Energy and Throughput Tradeoffs for Dataflow Networks
par: Karim, Abrarul, et autres
Publié: (2026)

Towards Learning-Augmented Peer-to-Peer Networks: Self-Stabilizing Graph Linearization with Untrusted Advice
par: Aradhya, Vijeth, et autres
Publié: (2025)

Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots
par: Nakajima, Keita, et autres
Publié: (2024)

Generating Dynamic Graph Algorithms for Multiple Backends for a Graph DSL
par: Behera, Nibedita, et autres
Publié: (2025)

Flint: Compiler Enabled Cluster-Free Design Space Exploration for Distributed ML
par: Yoo, Jinsun, et autres
Publié: (2026)

An Explorative Study on Distributed Computing Techniques in Training and Inference of Large Language Models
par: Hakim, Sheikh Azizul, et autres
Publié: (2025)

OpenDC-STEAM: Realistic Modeling and Systematic Exploration of Composable Techniques for Sustainable Datacenters
par: Niewenhuis, Dante, et autres
Publié: (2026)

TokenSim: Enabling Hardware and Software Exploration for Large Language Model Inference Systems
par: Wu, Feiyang, et autres
Publié: (2025)

Skipper: Maximal Matching with a Single Pass over Edges
par: Esfahani, Mohsen Koohi
Publié: (2025)

A Survey of Distributed Graph Algorithms on Massive Graphs
par: Meng, Lingkai, et autres
Publié: (2024)

Kairos: Efficient Temporal Graph Analytics on a Single Machine
par: da Trindade, Joana M. F., et autres
Publié: (2024)

Code Generation for a Variety of Accelerators for a Graph DSL
par: Kumar, Ashwina, et autres
Publié: (2024)

Gathering Teams of Bounded Memory Agents on a Line
par: Gao, Younan, et autres
Publié: (2025)

Performance Comparison of Graph Representations Which Support Dynamic Graph Updates
par: Sahu, Subhajit
Publié: (2025)

AgentFlow: Resilient Adaptive Cloud-Edge Framework for Multi-Agent Coordination
par: Chen, Ching Han, et autres
Publié: (2025)

BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU
par: V., Karthik, et autres
Publié: (2024)