| Beating the folklore algorithm for dynamic matching M Roghani, A Saberi, D Wajc 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022 | 8 | 2022 |
| Sequential importance sampling for estimating expectations over the space of perfect matchings Y Alimohammadi, P Diaconis, M Roghani, A Saberi arXiv preprint arXiv:2107.00850, 2021 | 1 | 2021 |
| Complexity of Computing the Anti-Ramsey Numbers for Paths S Akhoondian Amiri, A Popa, M Roghani, G Shahkarami, R Soltani, ... 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 1* | 2020 |
| Beating Greedy Matching in Sublinear Time S Behnezhad, M Roghani, A Rubinstein, A Saberi arXiv preprint arXiv:2206.13057, 2022 | | 2022 |
| Some Results on Dominating Induced Matchings S Akbari, H Baktash, A Behjati, A Behmaram, M Roghani Graphs and Combinatorics 38 (3), 1-8, 2022 | | 2022 |
| Improved Online Contention Resolution for Matchings and Applications to the Gig Economy T Pollner, M Roghani, A Saberi, D Wajc 23rd ACM Conference on Economics and Computation (EC 22), 2022 | | 2022 |
| TPS (Task Preparation System): A Tool for Developing Tasks in Programming Contests K MIRJALALI, AK MOHTASHAMI, M ROGHANI, H ZARRABI-ZADEH Olympiads in Informatics 13, 209–215, 2019 | | 2019 |
Amin SaberiProfessor, Stanford UniversityVerified email at stanford.edu
