Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
A guided tour of Chernoff bounds
Information Processing Letters
Competitive algorithms for server problems
Journal of Algorithms
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Journal of Algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Lower Bounds for Randomized $k$-Serverand Motion-Planning Algorithms
SIAM Journal on Computing
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Robot Motion Planning
Online Performance-Improvement Algorithms
Online Performance-Improvement Algorithms
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polylogarithmic-overhead piecemeal graph exploration
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Searching and on-line recognition of star-shaped polygons
Information and Computation
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Information and Computation
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Online multi-robot exploration of grid graphs with rectangular obstacles
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Worst-case optimal exploration of terrains with obstacles
Information and Computation
| Hi-index | 0.00 |