Deterministic rendezvous with detection using beeps

DOI10.1007/978-3-319-28472-9_7MaRDI QIDQ6829946zbMATH OpenFDO

Authors Samir Elouasbi, Andrzej Pelc

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28472-9_7

zbMATH Keywords

graphalgorithmdetectionsynchronous networkdeterministic rendezvousbeep

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)

This page was built for publication: Deterministic rendezvous with detection using beeps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829946)