1. Abram, G., & Treinish, L. (1995). An extended data-flow architecture for data analysis and visualization. In Proceedings of the 6th Conference on Visualization (pp. 263-270). Atlanta, GA: IEEE Computer Society.
2. Alabduljalil, M. A., Tang, X., & Yang, T. (2013). Optimizing parallel algorithms for all pairs similarity search. In Proceedings of the sixth ACM International Conference on Web Search and Data Mmining (pp. 203-212). Rome, Italy: ACM.
3. Allmaier, S. C., & Horton, G. (1997). Parallel shared-memory state-space exploration in stochastic modeling. In Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel (pp. 207-218). Paderborn, Germany: Springer-Verlag.
4. Bawa, M., Condie, T., & Ganesan, P. (2005). LSH forest: Self-tuning indexes for similarity search. In Proceedings of the 14th International Conference on World Wide Web (pp. 651-660). Chiba, Japan: ACM.