Author:
Segal Michael,Kedem Klara
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference21 articles.
1. Combinatorical Search;Aigner,1988
2. Efficient randomized algorithms for some geometric optimization problems;Agarwal,1995
3. G. Barequet, A. Briggs, M. Dickerson, M. Goodrich, Offset-polygon annulus placement problems, in: Workshop on Algorithms and Data Structures (WADS '97), Lecture Notes in Computer Science, Vol. 1272, Springer, New York, pp. 378–391.
4. Decomposable searching problems;Bentley;Inform. Process. Lett.,1979
5. Time bounds for selection;Blum;J. Comput. System Sci.,1973
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献