How to find a battleship

DOI10.1002/net.3230190306zbMath0673.90063OpenAlexW2076107933MaRDI QIDQ3827792

Adi Shamir, Amos Fiat

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190306

zbMATH Keywords

moving targetdeterministic strategyoptimal searchtwo-dimensional case

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (7)

Optimal external memory planar point enclosure ⋮ Two dimensional range minimum queries and Fibonacci lattices ⋮ The area of empty axis-parallel boxes amidst 2-dimensional lattice points ⋮ Improved dispersion bounds for modified Fibonacci lattices ⋮ Piercing all translates of a set of axis-parallel rectangles ⋮ Decision Trees for Geometric Models ⋮ Piercing all translates of a set of axis-parallel rectangles

Cites Work

• Polymorphic arrays: A novel VLSI layout for systolic computers

This page was built for publication: How to find a battleship