Shahrzad Haddadan

Orcid: 0000-0002-7702-8250

According to our database1, Shahrzad Haddadan authored at least 17 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimally Improving Cooperative Learning in a Social Setting.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
DeMEtRIS: Counting (near)-Cliques by Crawling.
Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

2022
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights.
Data Min. Knowl. Discov., 2022

The Drift of #MyBodyMyChoice Discourse on Twitter.
Proceedings of the WebSci '22: 14th ACM Web Science Conference 2022, Barcelona, Spain, June 26, 2022

2021
Some Instances of Homomesy Among Ideals of Posets.
Electron. J. Comb., 2021

RePBubLik: Reducing Polarized Bubble Radius with Link Insertions.
Proceedings of the WSDM '21, 2021

Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
The Wedge Picking Model: A dynamic graph model based on triadic closure.
CoRR, 2020

Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE.
CoRR, 2020

A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019
Mixing of Permutations by Biased Transpositions.
Theory Comput. Syst., 2019

Mixing time bounds for graphlet random walks.
Inf. Process. Lett., 2019

2018
Mallows Models for Top-k Lists.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

On the Complexity of Sampling Vertices Uniformly from a Graph.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
On the Complexity of Sampling Nodes Uniformly from a Graph.
CoRR, 2017

Mixing of Permutations by Biased Transposition.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
Algorithmic Problems Arising in Posets and Permutations.
PhD thesis, 2016


  Loading...