Improved Bounds for the Symmetric Rendezvous Value on the Line
From MaRDI portal
Publication:3392207
Recommendations
- scientific article; zbMATH DE number 6381633
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Symmetric improvements of Liouville's inequality
- Lower Bounds on the SymmetricL2-Discrepancy and Their Application
- An improved point-line incidence bound over arbitrary fields
- scientific article; zbMATH DE number 2085199
- An improved bound in Wirsing's problem
- scientific article; zbMATH DE number 1522533
- An improved upper-bound for Rivest et al.'s half-lie problem
Cited in
(9)- Deterministic symmetric rendezvous with tokens in a synchronous torus
- A symbolic programming approach to the rendezvous search problem
- Rendezvous problem
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- scientific article; zbMATH DE number 6381633 (Why is no real title available?)
- Ten Open Problems in Rendezvous Search
- Optimal trade-off between speed and acuity when searching for a small object
- Rendezvous Search with Revealed Information: Applications to the Line
This page was built for publication: Improved Bounds for the Symmetric Rendezvous Value on the Line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392207)