1. Efficient string matching: an aid to bibliographic search.;A. V.Aho;Communications of the ACM,1975
2. Positional data organization and compression in web inverted indexes;L.Akritidis;Proceedings of DEXA,2012
3. Alstrup, S., Brodal, G. S., & Rauhe, T. (2000). Pattern matching in dynamic texts. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (pp. 819–828).
4. Anderson, A., & Thorup, M. (2001). Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues. In Proceedings of the 32nd ACM Symposium on Theory of Computing (pp. 335-342).
5. Arge, L., & Vitter, J. S. (1996). Optimal dynamic interval management in external memory. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (pp. 560-569).