A lower bound for randomized searching on m rays
Computer Science in Perspective
SIGACT news online algorithms column 1
ACM SIGACT News
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Ranking hypotheses to minimize the search cost in probabilistic inference models
Discrete Applied Mathematics
Contract algorithms and robots on rays: unifying two scheduling problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Multi-target ray searching problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Competitive search in symmetric trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computational Geometry: Theory and Applications
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.00 |