Optimal constructions of hybrid algorithms

Authors:
Ming-Yang Kao;Yuan Ma;Michael Sipser;Yiqun Yin
Affiliations:
Department of Computer Science, Duke University, Durham, NC;Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Amortized efficiency of list update and paging rules

Communications of the ACM
Navigating in unfamiliar geometric terrain

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive algorithms for layered graph traversal

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On-line choice of on-line algorithms

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Shortest Paths Without a Map

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Hi-index	0.00