6 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 2 cited
Approximately Sampling Elements with Fixed Rank in Graded Posets
Prateek Bhakta, Ben Cousins, Matthew Fahrbach +1
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}…
cs.DM2012★ 6 cited
Mixing Times of Self-Organizing Lists and Biased Permutations
Prateek Bhakta, Sarah Miracle, Dana Randall +1
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time Θ(n^3 \log n) i…