| |
| 1-Saeed Shahrivari، Saeed Jalili، 2019، Efficient Distributed k-clique Mining for Large Networks Using MapReduce،IEEE Transactions on Knowledge and Data Engineering. |
| |
| 2-Saeed Shahrivari، Mehdi Alemi، 2017، CCFinder: using Spark to find clustering coefficient in big graphs،Springer Computing. |
| |
| 3-Ali Gholami Rudi. Saeed Shahrivari، 2013، RANGI: A Fast List-Colored Graph Motif Finding Algorithm،IEEE/ACM Transactions on Computational Biology and Bioinformatics. |
| |
| 4-Saeed Shahrivari، Saeed Jalili، 2015، High-performance parallel frequent subgraph discovery،Supercomputing. |
| |
| 5-Saeed Shahrivari، Saeed Jalili، 2015، Fast Parallel All Subgraph Enumeration Using Multicore Machines،Scientific Programming. |
| |
| 6-Saeed Shahrivari، Saeed Jalili، 2015، Distributed discovery of frequent subgraphs of a network using MapReduce،Springer Computing. |
| |
| 7-Saeed Shahrivari، Ali Hadian، 2014، High performance parallel k-means clustering for disk-resident datasets on multi-core CPUs،Supercomputing. |
| |
| 8-Saeed Shahrivari، Saeed Jalili، 2016، Single-pass and Linear-time k-means Clustering based on MapReduce،Information Systems. |
| |
| 9-Saeed Shahrivari، 2014، Beyond Batch Processing: Towards Real-Time and Streaming Big Data،Computers. |
| |
| 10-Mohsen Sharifi، Saeed Shahrivari، Hadi Salimi، 2013، PASTA: a power-aware solution to scheduling of precedence-constrained tasks on heterogeneous computing resources،Springer Computing. |