Pebble guided rendezvous despite fault

DOI10.1016/J.TCS.2026.116073MaRDI QIDQ7294931zbMATH OpenFDO

Authors Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal

Publication date 13 July 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116073

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Deterministic graph exploration with advice
• Deterministic network exploration by a single agent with Byzantine tokens
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• How many ants does it take to find the food?
• scientific article; zbMATH DE number 7561402 (Why is no real title available?)
• Memoryless search algorithms in a network with faulty advice
• Mobile Agent Rendezvous in a Ring Using Faulty Tokens
• Online computation with advice
• Online searching with turn cost
• Pebble guided optimal treasure hunt in anonymous graphs
• Structural Information and Communication Complexity
• The rendezvous problem on discrete locations
• Treasure hunt in graph using pebbles
• Tree exploration with advice
• Two Dimensional Rendezvous Search
• Yet more on the linear search problem

This page was built for publication: Pebble guided rendezvous despite fault

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