default search action
Shahrzad Haddadan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Shahrzad Haddadan, Cheng Xin, Jie Gao:
Optimally Improving Cooperative Learning in a Social Setting. ICML 2024 - [i9]Shahrzad Haddadan, Cheng Xin, Jie Gao:
Optimally Improving Cooperative Learning in a Social Setting. CoRR abs/2405.20808 (2024) - 2023
- [c8]Suman K. Bera
, Jayesh Choudhari
DeMEtRIS: Counting (near)-Cliques by Crawling. WSDM 2023: 312-320 - 2022
- [j4]Shahrzad Haddadan
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights. Data Min. Knowl. Discov. 36(6): 2334-2378 (2022) - [c7]Cristina Menghini, Justin Uhr
The Drift of #MyBodyMyChoice Discourse on Twitter. WebSci 2022: 110-117 - [i8]Cristina Menghini, Justin Uhr, Shahrzad Haddadan, Ashley Champagne, Björn Sandstede, Sohini Ramachandran:
The Drift of #MyBodyMyChoice Discourse on Twitter. CoRR abs/2205.04898 (2022) - [i7]Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian:
DeMEtRIS: Counting (near)-Cliques by Crawling. CoRR abs/2212.03957 (2022) - 2021
- [j3]Shahrzad Haddadan
Some Instances of Homomesy Among Ideals of Posets. Electron. J. Comb. 28(1): 1 (2021) - [c6]Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal:
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. NeurIPS 2021: 25760-25772 - [c5]Shahrzad Haddadan
RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. WSDM 2021: 139-147 - [i6]Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal:
RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions. CoRR abs/2101.04751 (2021) - [i5]Shahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli Upfal:
Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds. CoRR abs/2111.07372 (2021) - 2020
- [c4]Sara Ahmadian, Shahrzad Haddadan:
A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications. IEEE BigData 2020: 5-14 - [i4]Cyrus Cousins, Shahrzad Haddadan, Eli Upfal:
Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE. CoRR abs/2011.11129 (2020) - [i3]Sara Ahmadian, Shahrzad Haddadan:
The Wedge Picking Model: A dynamic graph model based on triadic closure. CoRR abs/2012.01691 (2020)
2010 – 2019
- 2019
- [j2]Matteo Agostini, Marco Bressan, Shahrzad Haddadan
Mixing time bounds for graphlet random walks. Inf. Process. Lett. 152 (2019) - [j1]Shahrzad Haddadan
Mixing of Permutations by Biased Transpositions. Theory Comput. Syst. 63(5): 1068-1088 (2019) - 2018
- [c3]Flavio Chierichetti, Shahrzad Haddadan
On the Complexity of Sampling Vertices Uniformly from a Graph. ICALP 2018: 149:1-149:13 - [c2]Flavio Chierichetti, Anirban Dasgupta, Shahrzad Haddadan, Ravi Kumar, Silvio Lattanzi:
Mallows Models for Top-k Lists. NeurIPS 2018: 4387-4397 - 2017
- [c1]Shahrzad Haddadan
Mixing of Permutations by Biased Transposition. STACS 2017: 41:1-41:13 - [i2]Flavio Chierichetti, Shahrzad Haddadan:
On the Complexity of Sampling Nodes Uniformly from a Graph. CoRR abs/1710.08815 (2017) - 2016
- [b1]Shahrzad Haddadan:
Algorithmic Problems Arising in Posets and Permutations. Dartmouth College, USA, 2016 - [i1]Shahrzad Haddadan, Peter Winkler:
Mixing of Permutations by Biased Transposition. CoRR abs/1604.00870 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: