Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Bast, H., Mehlhorn, K., Schäfer, G., Tamaki, H.: Matching algorithms are fast in sparse random graphs. Theory Comput. Syst. 39(1), 3–14 (2006)
2. Bentley, J.: Programming pearls: a sample of brilliance. J. Assoc. Comput. Mach. 30(9), 754–757 (1987)
3. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
4. Lecture Notes in Computer Science;F.C. Botelho,2005
5. Lecture Notes in Computer Science;F.C. Botelho,2007
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献