Skip to Main content Skip to Navigation
Journal articles

How to meet when you forget: log-space rendezvous in arbitrary graphs

Jurek Czyzowicz 1 Adrian Kosowski 2, 3 Andrzej Pelc 1 
1 DII - Département d'Informatique et d'Ingénierie
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/hal-00725875
Contributor : Adrian Kosowski Connect in order to contact the contributor
Submitted on : Tuesday, August 28, 2012 - 9:43:41 AM
Last modification on : Saturday, June 25, 2022 - 10:33:19 AM

Links full text

istex

Identifiers

Collections

CNRS | INRIA | LABRI | INRIA2

Citation

Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Computing, Springer Verlag, 2012, 25 (2), pp.165-178. ⟨10.1007/s00446-011-0141-9⟩. ⟨hal-00725875⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

161

 

Contact                    Legal Notice                    Personal Data