Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lecture Notes in Computer Science;E.D. Demaine,2006
2. Lecture Notes in Computer Science;M. Dietzfelbinger,1996
3. Lecture Notes in Computer Science;M. Dietzfelbinger,2001
4. Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. of Alg. 25, 19–51 (1997)
5. Dietzfelbinger, M., Karlin, A., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. on Comp. 23, 738–761 (1994)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献