Amortized efficiency of list update and paging rules
Communications of the ACM
Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
Information and Computation
How to find a point on a line within a fixed distance
Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Lower bounds in on-line geometric searching
Computational Geometry: Theory and Applications
The ultimate strategy to search on m rays?
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Searching on m Bounded Rays Optimally
Searching on m Bounded Rays Optimally
A princess swimming in the fog looking for a monster cow
ACM SIGACT News
On the two-dimensional cow search problem
Information Processing Letters
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a framework for lower bounds on all cyclic and monotone strategies that result in two-sequence functionals. For optimizing such functionals we apply a method that combines two main paradigms. The given solution shows that the combination method is of general interest. Finally, we obtain the current best strategy and can prove that this is the best strategy among all cyclic and monotone strategies which is a main step toward a lower bound construction.