Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs K Chatterjee, H Fu, P Novotný, R Hasheminezhad Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 95 | 2016 |
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs K Chatterjee, H Fu, P Novotný, R Hasheminezhad ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (2), 1-45, 2018 | 51 | 2018 |
Compressive sensing of high betweenness centrality nodes in networks H Mahyar, R Hasheminezhad, E Ghalebi, A Nazemian, R Grosu, ... Physica A: Statistical Mechanics and its Applications 497, 166-184, 2018 | 32 | 2018 |
Identifying central nodes for information flow in social networks using compressive sensing H Mahyar, R Hasheminezhad, E Ghalebi, A Nazemian, R Grosu, ... Social Network Analysis and Mining 8, 1-24, 2018 | 24 | 2018 |
A low-cost sparse recovery framework for weighted networks under compressive sensing H Mahyar, HR Rabiee, A Movaghar, R Hasheminezhad, E Ghalebi, ... 2015 IEEE International Conference on Smart City/SocialCom/SustainCom …, 2015 | 11 | 2015 |
Compressive closeness in networks H Mahyar, R Hasheminezhad, HE Stanley Applied Network Science 4 (1), 100, 2019 | 6 | 2019 |
Constructing provably robust scale-free networks R Hasheminezhad, U Brandes International Conference on Network Science, 126-139, 2022 | 4 | 2022 |
Scale-free networks need not be fragile R Hasheminezhad, M Boudourides, U Brandes 2020 IEEE/ACM International Conference on Advances in Social Networks …, 2020 | 4 | 2020 |
Robustness of preferential-attachment graphs R Hasheminezhad, U Brandes Applied Network Science 8 (1), 32, 2023 | 2 | 2023 |
The myth of the robust-yet-fragile nature of scale-free networks: An empirical analysis R Hasheminezhad, AB Rønberg, U Brandes International Workshop on Algorithms and Models for the Web-Graph, 99-111, 2023 | 2 | 2023 |
Robustness of preferential-attachment graphs: shifting the baseline R Hasheminezhad, U Brandes International Conference on Complex Networks and Their Applications, 445-456, 2022 | 2 | 2022 |
Convex block-sparse linear regression with expanders–provably A Kyrillidis, B Bah, R Hasheminezhad, QT Dinh, L Baldassarre, V Cevher Artificial Intelligence and Statistics, 19-27, 2016 | 2 | 2016 |
A compressive sensing framework for distributed detection of high closeness centrality nodes in networks H Mahyar, R Hasheminezhad, E Ghalebi, R Grosu, HE Stanley Complex Networks and Their Applications VII: Volume 2 Proceedings The 7th …, 2019 | 1 | 2019 |
Robustness of Scale-Free Networks S Hasheminezhad ETH Zurich, 2023 | | 2023 |