| Task allocation using a team of robots H Aziz, A Pal, A Pourmiri, F Ramezani, B Sims Current Robotics Reports 3 (4), 227-238, 2022 | 24 | 2022 |
| Faster rumor spreading with multiple calls K Panagiotou, A Pourmiri, T Sauerwald International Symposium on Algorithms and Computation, 446-456, 2013 | 18 | 2013 |
| Local coloring of Kneser graphs B Omoomi, A Pourmiri Discrete mathematics 308 (24), 5922-5927, 2008 | 14 | 2008 |
| Storage, communication, and load balancing trade-off in distributed cache networks MJ Siavoshani, A Pourmiri, SP Shariatpanahi IEEE Transactions on Parallel and Distributed Systems 29 (4), 943-957, 2017 | 13 | 2017 |
| Randomized rumor spreading in poorly connected small‐world networks A Mehrabian, A Pourmiri Random Structures & Algorithms 49 (1), 185-208, 2016 | 11 | 2016 |
| Balanced allocation on graphs: A random walk approach A Pourmiri Random Structures & Algorithms 55 (4), 980-1009, 2019 | 10 | 2019 |
| Balanced Allocation on Hypergraphs C Greenhill, B Mans, A Pourmiri arXiv preprint arXiv:2006.07588, 2020 | 8 | 2020 |
| On communication cost vs. load balancing in content delivery networks MJ Siavoshani, SP Shariatpanahi, H Ghasemi, A Pourmiri 2017 IEEE Symposium on Computers and Communications (ISCC), 651-656, 2017 | 7 | 2017 |
| Proximity-aware balanced allocations in cache networks A Pourmiri, MJ Siavoshani, SP Shariatpanahi 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017 | 7 | 2017 |
| On the local colorings of graphs B Omoomi, A Pourmiri Ars Combinatoria 86 (January), 2008 | 7 | 2008 |
| Brief announcement: Ultra-fast asynchronous randomized rumor spreading A Pourmiri, F Ramezani SPAA 2019, 2019 | 6 | 2019 |
| Randomized rumor spreading in poorly connected small-world networks A Mehrabian, A Pourmiri International Symposium on Distributed Computing, 346-360, 2014 | 6 | 2014 |
| Coded load balancing in cache networks MJ Siavoshani, F Parvaresh, A Pourmiri, SP Shariatpanahi IEEE Transactions on Parallel and Distributed Systems 31 (2), 347-358, 2019 | 5 | 2019 |
| Tight analysis of asynchronous rumor spreading in dynamic networks A Pourmiri, B Mans Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 4 | 2020 |
| Cutoff phenomenon for random walks on Kneser graphs A Pourmiri, T Sauerwald Discrete Applied Mathematics 176, 100-106, 2014 | 3 | 2014 |
| Considering user dynamic preferences for mitigating negative effects of long-tail in recommender systems R Shafiloo, M Kaedi, A Pourmiri Information Sciences 669, 120558, 2024 | 2 | 2024 |
| Ex-post Stability under Two-Sided Matching: Complexity and Characterization H Aziz, G Csáji, P Biró arXiv preprint arXiv:2411.14821, 2024 | 1 | 2024 |
| Predicting user demographics based on interest analysis R Shafiloo, M Kaedi, A Pourmiri arXiv preprint arXiv:2108.01014, 2021 | 1 | 2021 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 1 | 2020 |
| Ultra-fast asynchronous randomized rumor spreading (brief announcement) A Pourmiri, F Ramezani The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 81-83, 2019 | 1 | 2019 |
Mahdi Jafari SiavoshaniAssistant Professor, Sharif University of TechnologyVerified email at sharif.edu
