Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
type: Dataset
description: Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this study concern the feasibility of solving fundamental tasks in an anonymous network, subject to limitations on the resources available to the agent. The considered challenges include: exploring a graph by means of an agent with limited memory, discovery of the network topology, and attempting to meet with another agent in another network (rendezvous). The constraints imposed on the agent include the number of moves which the agent is allowed to perform in the network, the amount of state memory available to the agent, the ability of the agent to communicate with other agents, as well as its a priori knowledge of the network topology or of global parameters.
issued: 2026-05-09T13:24:49.826547
language: en
modified: 2026-05-09T13:24:49.826551
contact point: Organization
  fn: CCSD
keyword: accreditation-to-supervise-research
keyword: anonymous-network
keyword: de-rendomization
keyword: distributed-algorithm
keyword: graph-exploration
keyword: infoeu-reposemanticsother
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds
keyword: metropolis-walk
keyword: mobile-agent
keyword: random-walk
keyword: rendezvous-in-graphs
keyword: rotor-router-walk
keyword: universal-traversal-sequence
landing page: https://theses.hal.science/tel-00867765

Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
type: Distribution
format: HTML
issued: 2026-05-09T13:24:49.828044
modified: 2026-05-09T13:24:49.812275
access URL: https://theses.hal.science/tel-00867765

test_moissonnage_selune
type: Agent