- Home
- Publications
- Publication Search
- Publication Details
Title
Gathering Over Heterogeneous Meeting Nodes
Authors
Keywords
-
Journal
COMPUTER JOURNAL
Volume -, Issue -, Pages -
Publisher
Oxford University Press (OUP)
Online
2023-09-19
DOI
10.1093/comjnl/bxad101
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Time-Optimal Gathering under Limited Visibility with One-Axis Agreement
- (2021) Pavan Poudel et al. Information (Switzerland)
- Gathering Anonymous, Oblivious Robots on a Grid
- (2020) Jannik Castenow et al. THEORETICAL COMPUTER SCIENCE
- Gathering robots in graphs: The central role of synchronicity
- (2020) Serafino Cicerone et al. THEORETICAL COMPUTER SCIENCE
- Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach
- (2018) Serafino Cicerone et al. DISTRIBUTED COMPUTING
- Embedded pattern formation by asynchronous robots without chirality
- (2018) Serafino Cicerone et al. DISTRIBUTED COMPUTING
- Team assembling problem for asynchronous heterogeneous mobile robots
- (2018) Zhiqiang Liu et al. THEORETICAL COMPUTER SCIENCE
- Gathering of mobile robots with weak multiplicity detection in presence of crash-faults
- (2018) Debasish Pattanayak et al. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- (2017) Gabriele Di Stefano et al. INFORMATION AND COMPUTATION
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- (2016) Gianlorenzo D’Angelo et al. DISTRIBUTED COMPUTING
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- (2016) Gabriele Di Stefano et al. DISTRIBUTED COMPUTING
- Gathering of robots on anonymous grids and trees without multiplicity detection
- (2016) Gianlorenzo D'Angelo et al. THEORETICAL COMPUTER SCIENCE
- Gathering on rings under the Look–Compute–Move model
- (2014) Gianlorenzo D’Angelo et al. DISTRIBUTED COMPUTING
- Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
- (2013) Tomoko IZUMI et al. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- (2012) Samuel Guilbault et al. THEORETICAL COMPUTER SCIENCE
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- (2010) Ralf Klasing et al. THEORETICAL COMPUTER SCIENCE
- Gathering asynchronous oblivious mobile robots in a ring
- (2007) Ralf Klasing et al. THEORETICAL COMPUTER SCIENCE
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now