Publisher
Springer International Publishing
Reference13 articles.
1. Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155–193 (1979).
https://doi.org/10.1016/0022-0000(79)90045-X
2. Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo (1996)
3. Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246–260 (1974).
https://doi.org/10.1145/321812.321820
4. Fano, R.M.: On the number of bits required to implement an associative memory. Computation Structures Group Memo 61, MIT Project MAC, August 1971
5. Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3), 348–359 (2007).
https://doi.org/10.1016/j.tcs.2007.07.041
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献