Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Ajtai, M., Megiddo, N.: A Deterministic Poly (log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension. In: Proc. 24th ACM Symp. on Theory of Computing, pp. 327–338 (1992)
2. Alon, N., Spencer, J.: The Probabilistic Method. Wiley Interscience, Hoboken (2000)
3. Akutsu, T.: Protein Structure Alignment Using Dynamic Programming and Iterative Improvement. IEICE Trans. on Information and Systems 12, 1629–1636 (1996)
4. Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discrete & Computational Geometry 20(3), 307–331 (1998)
5. Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A.: Point matching under non-uniform distortions. Discrete Applied Mathematics 127(1), 5–21 (2003)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献