Algorithmic Problems Arising in Posets and Permutations. - Shahrzad Haddadan (2016)

Mixing of Permutations by Biased Transposition. - Shahrzad Haddadan; Peter Winkler 001 (STACS, 2017)

On the Complexity of Sampling Nodes Uniformly from a Graph. - Flavio Chierichetti; Shahrzad Haddadan (CoRR, 2017)

On the Complexity of Sampling Vertices Uniformly from a Graph. - Flavio Chierichetti; Shahrzad Haddadan (ICALP, 2018)

Mallows Models for Top-k Lists. - Flavio Chierichetti; Anirban Dasgupta 001; Shahrzad Haddadan; Ravi Kumar 001; Silvio Lattanzi (NeurIPS, 2018)

Mixing time bounds for graphlet random walks. - Matteo Agostini; Marco Bressan 002; Shahrzad Haddadan (Inf. Process. Lett., 2019)

Mixing of Permutations by Biased Transpositions. - Shahrzad Haddadan; Peter Winkler 001 (Theory Comput. Syst., 2019)

A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications. - Sara Ahmadian; Shahrzad Haddadan (IEEE BigData, 2020)

Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE. - Cyrus Cousins; Shahrzad Haddadan; Eli Upfal (CoRR, 2020)

The Wedge Picking Model: A dynamic graph model based on triadic closure. - Sara Ahmadian; Shahrzad Haddadan (CoRR, 2020)

Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. - Shahrzad Haddadan; Yue Zhuang; Cyrus Cousins; Eli Upfal (NeurIPS, 2021)

RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. - Shahrzad Haddadan; Cristina Menghini; Matteo Riondato; Eli Upfal (WSDM, 2021)

Some Instances of Homomesy Among Ideals of Posets. - Shahrzad Haddadan (Electron. J. Comb., 2021)

The Drift of #MyBodyMyChoice Discourse on Twitter. - Cristina Menghini; Justin Uhr; Shahrzad Haddadan; Ashley Champagne; Björn Sandstede; Sohini Ramachandran (WebSci, 2022)

Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights. - Shahrzad Haddadan; Cristina Menghini; Matteo Riondato; Eli Upfal (Data Min. Knowl. Discov., 2022)

DeMEtRIS: Counting (near)-Cliques by Crawling. - Suman K. Bera 001; Jayesh Choudhari; Shahrzad Haddadan; Sara Ahmadian (WSDM, 2023)

Optimally Improving Cooperative Learning in a Social Setting. - Shahrzad Haddadan; Cheng Xin; Jie Gao (ICML, 2024)