Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
2. Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. In: Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 463–472 (1992)
3. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4-5), 434–449 (1996)
4. Andersson, A.: Sublogarithmic searching without multiplications. In: Proc. 36th Symposium on Foundations of Computer Science (FOCS), pp. 655–663 (1995)
5. Brodal, G.S., Fagerberg, R.: On the limits of cache-obliviousness. In: Proc. 35th Annual ACM Symposium on Theory of Computing, pp. 307–315 (2003)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Elastic-Degenerate String Matching via Fast Matrix Multiplication;SIAM Journal on Computing;2022-05-19
2. Elastic-Degenerate String Matching with 1 Error;LATIN 2022: Theoretical Informatics;2022
3. Circular pattern matching with k mismatches;Journal of Computer and System Sciences;2021-02
4. The Parameterized Suffix Tray;Lecture Notes in Computer Science;2021
5. Predecessor Search;ACM Computing Surveys;2020-10-15