scientific article; zbMATH DE number 1775412
From MaRDI portal
Publication:4542545
zbMath1027.68652MaRDI QIDQ4542545
No author found.
Publication date: 17 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Efficient pebbling for list traversal synopses with application to program rollback ⋮ Fault-tolerant sequential scan ⋮ Information Spreading by Mobile Particles on a Line ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Searching without communicating: tradeoffs between performance and selection complexity ⋮ On temporal graph exploration ⋮ A general framework for searching on a line ⋮ Graph covering using bounded size subgraphs ⋮ On the Power of Local Orientations ⋮ How many oblivious robots can explore a line ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Distributed chasing of network intruders ⋮ Map construction of unknown graphs by multiple agents ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ The Magnus-Derek game ⋮ Optimal graph exploration without good maps ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Mapping a polygon with holes using a compass ⋮ Black Hole Search in Directed Graphs ⋮ Collective tree exploration ⋮ Mapping a Polygon with Holes Using a Compass ⋮ Dispersion of mobile robots on directed anonymous graphs ⋮ The power of a pebble: Exploring and mapping directed graphs ⋮ Fast rendezvous on a cycle by agents with different speeds
This page was built for publication:
