| Evaluation of background subtraction methods S Panahi, S Sheikhi, S Haddadan, N Gheissari 2008 Digital Image Computing: Techniques and Applications, 357-364, 2008 | 47 | 2008 |
| Repbublik: Reducing polarized bubble radius with link insertions S Haddadan, C Menghini, M Riondato, E Upfal Proceedings of the 14th ACM International Conference on Web Search and Data …, 2021 | 28 | 2021 |
| The expected jaggedness of order ideals M Chan, S Haddadan, S Hopkins, L Moci Forum of Mathematics, Sigma 5, e9, 2017 | 24 | 2017 |
| Some Instances of Homomesy Among Ideals of Posets S Haddadan The Electronic Journal of Combinatorics 28 (1), 2021 | 23* | 2021 |
| Mallows models for top-k lists F Chierichetti, A Dasgupta, S Haddadan, R Kumar, S Lattanzi Advances in Neural Information Processing Systems 31, 2018 | 16 | 2018 |
| On the Complexity of Sampling Vertices Uniformly from a Graph F Chierichetti, S Haddadan 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 12* | 2018 |
| Mixing of Permutations by Biased Transposition S Haddadan, P Winkler At 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017 …, 2017 | 10 | 2017 |
| Mixing time bounds for graphlet random walks M Agostini, M Bressan, S Haddadan Information Processing Letters 152, 105851, 2019 | 9 | 2019 |
| Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE C Cousins, S Haddadan, E Upfal arXiv preprint arXiv:2011.11129, 2020 | 7 | 2020 |
| Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights S Haddadan, C Menghini, M Riondato, E Upfal Data Mining and Knowledge Discovery 36 (6), 2334-2378, 2022 | 6 | 2022 |
| Fast doubly-adaptive MCMC to estimate the gibbs partition function with weak mixing time bounds S Haddadan, Y Zhuang, C Cousins, E Upfal Advances in Neural Information Processing Systems 34, 25760-25772, 2021 | 6 | 2021 |
| The Drift of# MyBodyMyChoice Discourse on Twitter C Menghini, J Uhr, S Haddadan, A Champagne, B Sandstede, ... Proceedings of the 14th ACM Web Science Conference 2022, 110-117, 2022 | 5 | 2022 |
| A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications S Ahmadian, S Haddadan 2020 IEEE International Conference on Big Data (Big Data), 5-14, 2020 | 3 | 2020 |
| The wedge picking model: A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications S Ahmadian, S Haddadan Journal of Strategic Innovation and Sustainability 16 (3), 2021 | 1 | 2021 |
| The wedge picking model: A dynamic graph model based on triadic closure S Ahmadian, S Haddadan arXiv preprint arXiv:2012.01691, 2020 | 1 | 2020 |
| Algorithmic Problems Arising in Posets and Permutations S Haddadan Dartmouth College, 2016 | 1 | 2016 |
| Graph Algorithms with Strong and Weak Signals E Friedman, S Haddadan | | 2024 |
| Optimally Improving Cooperative Learning in a Social Setting S Haddadan, C Xin, J Gao Forty-first International Conference on Machine Learning, 2024 | | 2024 |
| DeMEtRIS: Counting (near)-Cliques by Crawling SK Bera, J Choudhari, S Haddadan, S Ahmadian Proceedings of the Sixteenth ACM International Conference on Web Search and …, 2023 | | 2023 |
| Mixing Time for Some Adjacent Transposition Markov Chains S Haddadan, P Winkler arXiv preprint arXiv:1604.00870, 2016 | | 2016 |
Eli UpfalComputer Science Professor, Brown UniversityVerified email at brown.edu
