arXiv (OAI Expanded)
open access
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance $2d$, must follow the same randomized strategy to meet as quickly as possible. In the standard model, agents may condition their actions on the entire execution history, and both the known- and unk
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Onyx: Cost-Efficient Disk-Oblivious ANN Search#123957
- A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information#665597
- A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information#664097
- Fast robbers on abelian Cayley graphs and digraphs#926222
- ANet Patu-1: The Value of Connection in the Agent Network#373348
Record · ID 1071402
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive