Behnezhad, S. Et Al. 2017. Brief Announcement: Graph Matching in Massive Datasets. Annual ACM Symposium on Parallelism in Algorithms and Architectures , no.F129316 , 133-136.

Behnezhad, S., Derakhshan, M., Esfandiari, H., Tan, E., & Yami, H., (2017). Brief Announcement: Graph Matching in Massive Datasets. Annual ACM Symposium on Parallelism in Algorithms and Architectures , no.F129316, 133-136.

Behnezhad, Soheil Et Al. "Brief Announcement: Graph Matching in Massive Datasets," Annual ACM Symposium on Parallelism in Algorithms and Architectures , no.F129316, 133-136, 2017

Behnezhad, Soheil Et Al. "Brief Announcement: Graph Matching in Massive Datasets." Annual ACM Symposium on Parallelism in Algorithms and Architectures , no.F129316, pp.133-136, 2017

Behnezhad, S. Et Al. (2017) . "Brief Announcement: Graph Matching in Massive Datasets." Annual ACM Symposium on Parallelism in Algorithms and Architectures , no.F129316, pp.133-136.

@article{article, author={Soheil Behnezhad Et Al. }, title={Brief Announcement: Graph Matching in Massive Datasets}, journal={Annual ACM Symposium on Parallelism in Algorithms and Architectures}, year=2017, pages={133-136} }