default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmanda Streib
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations. SIAM J. Discret. Math. 38(1): 702-725 (2024)- 2022
- [j5]Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Mixing times of Markov chains for self-organizing lists and biased permutations. Random Struct. Algorithms 61(4): 638-665 (2022) - 2020
- [j4]Sam Greenberg, Dana Randall, Amanda Pascoe Streib:
Sampling biased monotonic surfaces using exponential metrics. Comb. Probab. Comput. 29(5): 672-697 (2020) - 2016
- [j3]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Sampling and Counting 3-Orientations of Planar Triangulations. SIAM J. Discret. Math. 30(2): 801-831 (2016) - 2015
- [j2]Amanda Streib, Noah Streib, Isabel Beichl, Francis Sullivan:
Stratified sampling for the Ising model: A graph-theoretic approach. Comput. Phys. Commun. 191: 1-8 (2015) - 2008
- [j1]Matthew Booth, Philip Hackney
, Benjamin Harris, Charles R. Johnson, Margaret Lay, Lon H. Mitchell, Sivaram K. Narayan, Amanda Pascoe, Kelly Steinmetz, Brian D. Sutton, Wendy Wang:
On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph. SIAM J. Matrix Anal. Appl. 30(2): 731-740 (2008)
Conference and Workshop Papers
- 2020
- [c7]Sarah Miracle, Amanda Pascoe Streib, Noah Streib:
Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains. APPROX-RANDOM 2020: 3:1-3:21 - 2018
- [c6]Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of k-Class Biased Permutations. LATIN 2018: 820-834 - 2017
- [c5]Amanda Pascoe Streib, Noah Streib:
Cycle Basis Markov Chains for the Ising Model. ANALCO 2017: 56-65 - 2013
- [c4]Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations. SODA 2013: 1-15 - 2011
- [c3]Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Cluster Algorithms for Discrete Models of Colloids with Bars. ANALCO 2011: 135-149 - [c2]Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Clustering in Interfering Binary Mixtures. APPROX-RANDOM 2011: 652-663 - 2009
- [c1]Sam Greenberg, Amanda Pascoe, Dana Randall:
Sampling biased lattice configurations using exponential metrics. SODA 2009: 76-85
Informal and Other Publications
- 2019
- [i5]Sarah Miracle, Amanda Pascoe Streib, Noah Streib:
Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains. CoRR abs/1910.05184 (2019) - 2017
- [i4]Sam Greenberg, Dana Randall, Amanda Pascoe Streib:
Sampling Biased Monotonic Surfaces using Exponential Metrics. CoRR abs/1704.07322 (2017) - [i3]Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of k-Class Biased Permutations. CoRR abs/1708.05078 (2017) - 2012
- [i2]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Algorithms for Sampling 3-Orientations of Planar Triangulations. CoRR abs/1202.4945 (2012) - [i1]Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Mixing Times of Self-Organizing Lists and Biased Permutations. CoRR abs/1204.3239 (2012)
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-04-24 22:58 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:
