How to meet when you forget: log-space rendezvous in arbitrary graphs
type: Item
instance of: scholarly article
title: How to meet when you forget: log-space rendezvous in arbitrary graphs
zbMATH Open document ID: 1284.68066
author: Adrian Kosowski
author: Andrzej Pelc
author: Jurek Czyzowicz
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6134269
zbMATH Keywords: rendezvous
zbMATH Keywords: graph exploration
zbMATH Keywords: compact data structure
MaRDI profile type: Publication
full work available at URL: s00446-011-0141-9
OpenAlex ID: W1972775782
cites work: The Rendezvous Search Problem
cites work: Rendezvous search on labeled networks
cites work: Rendezvous search on a graph
cites work: Q2934641
cites work: The rendezvous problem on discrete locations
cites work: Two Dimensional Rendezvous Search
cites work: Computing on an anonymous ring
cites work: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
cites work: Rendezvous search when marks are left at the starting points
cites work: Computing anonymously with arbitrary knowledge
cites work: Space Lower Bounds for Maze Threadability on Restricted Machines
cites work: Asynchronous deterministic rendezvous in graphs
cites work: Deterministic rendezvous in graphs
cites work: Tree exploration with little memory
cites work: LATIN 2004: Theoretical Informatics
cites work: Gathering of asynchronous robots with limited visibility
cites work: Q4535803
cites work: Q4736828
cites work: STACS 2004
cites work: Deterministic Rendezvous in Trees with Little Memory
cites work: Delays Induce an Exponential Memory Gap for Rendezvous in Trees
cites work: Rendezvous Search on the Line
cites work: Universal traversal sequences with backtracking.
cites work: How to meet in anonymous network
cites work: Computing Boolean functions on anonymous networks
cites work: Randomized Rendez-Vous with Limited Memory
cites work: Minimax Rendezvous on the Line
cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
cites work: Undirected connectivity in log-space
cites work: Remarks on the Intrinsic Equations of Twisted Curves
cites work: Q2934643
cites work: Finding Your Kids When They Are Lost
cites work: Q4818870
DOI: 10.1007/S00446-011-0141-9
Recommended article: How to meet when you forget
Recommended article: On the probability of rendezvous in graphs
Recommended article: Rendezvous search on a graph
Recommended article: Algorithms - ESA 2003
Recommended article: Deterministic rendezvous in graphs
Recommended article: On asynchronous rendezvous in general graphs
Recommended article: Deterministic Rendezvous in Restricted Graphs
Recommended article: Deterministic Rendezvous in Trees with Little Memory
Recommended article: Algorithms and Computation
description: scientific article; zbMATH DE number 6134269