A lower bound for randomized searching on m rays
Computer Science in Perspective
SIGACT news online algorithms column 1
ACM SIGACT News
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Ranking hypotheses to minimize the search cost in probabilistic inference models
Discrete Applied Mathematics
On the two-dimensional cow search problem
Information Processing Letters
Incremental Facility Location Problem and Its Competitive Algorithms
Journal of Combinatorial Optimization
Searching for an axis-parallel shoreline
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
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
Optimal competitive online ray search with an error-prone robot
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Online minimization knapsack problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Flood search under the California Split rule
Operations Research Letters
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |