default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeiming Feng 0001
Person information
- affiliation: ETH Zürich, Switzerland
- affiliation (2023): UC Berkeley, CA, USA
- affiliation (2021-2023): University of Edinburgh, UK
- affiliation (PhD 2021): Nanjing University, China
Other persons with the same name
- Weiming Feng 0002 — Penn State University, University Park, PA, USA
- Weiming Feng 0003 — Guangzhou University, School of Geography and Remote Sensing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. ICALP 2024: 11:1-11:20- [c16]Weiming Feng, Heng Guo:
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. ICALP 2024: 62:1-62:19 - [c15]Weiming Feng, Liqiang Liu, Tianren Liu:
On Deterministically Approximating Total Variation Distance. SODA 2024: 1766-1791 - [i24]Charlie Carlson, Xiaoyu Chen, Weiming Feng, Eric Vigoda:
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. CoRR abs/2407.04576 (2024) - [i23]Xiaoyu Chen, Weiming Feng:
Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree. CoRR abs/2407.04672 (2024) - [i22]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang:
Rapid mixing of the flip chain over non-crossing spanning trees. CoRR abs/2409.07892 (2024) - 2023
- [j7]Weiming Feng, Heng Guo, Jiaheng Wang
:
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. Inf. Comput. 294: 105066 (2023) - [j6]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023) - [c14]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. FOCS 2023: 1963-1990 - [c13]Charilaos Efthymiou, Weiming Feng:
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n). ICALP 2023: 54:1-54:17 - [c12]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA 2023: 343-347 - [i21]Charilaos Efthymiou, Weiming Feng:
On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n, d/n). CoRR abs/2302.06172 (2023) - [i20]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. CoRR abs/2306.14867 (2023) - [i19]Weiming Feng, Liqiang Liu, Tianren Liu:
On Deterministically Approximating Total Variation Distance. CoRR abs/2309.14696 (2023) - [i18]Weiming Feng, Heng Guo:
An FPRAS for two terminal reliability in directed acyclic graphs. CoRR abs/2310.00938 (2023) - 2022
- [j5]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. Random Struct. Algorithms 61(4): 678-709 (2022) - [j4]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. ACM Trans. Algorithms 18(3): 28:1-28:32 (2022) - [c11]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved Bounds for Randomly Colouring Simple Hypergraphs. APPROX/RANDOM 2022: 25:1-25:17 - [c10]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal mixing for two-state anti-ferromagnetic spin systems. FOCS 2022: 588-599 - [i17]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved bounds for randomly colouring simple hypergraphs. CoRR abs/2202.05554 (2022) - [i16]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal mixing for two-state anti-ferromagnetic spin systems. CoRR abs/2203.07771 (2022) - [i15]Weiming Feng, Heng Guo, Jiaheng Wang:
Sampling from the ferromagnetic Ising model with external fields. CoRR abs/2205.01985 (2022) - [i14]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR abs/2208.00740 (2022) - [i13]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. CoRR abs/2211.03487 (2022) - 2021
- [j3]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime. J. ACM 68(6): 40:1-40:42 (2021) - [j2]Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin:
Dynamic Sampling from Graphical Models. SIAM J. Comput. 50(2): 350-381 (2021) - [c9]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Rapid mixing of Glauber dynamics via spectral independence for all degrees. FOCS 2021: 137-148 - [c8]Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin:
Dynamic Inference in Probabilistic Graphical Models. ITCS 2021: 25:1-25:20 - [c7]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. SODA 2021: 1558-1577 - [c6]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Metropolis Sampler with Optimal Parallelism. SODA 2021: 2121-2140 - [c5]Weiming Feng, Kun He, Yitong Yin:
Sampling constraint satisfaction solutions in the local lemma regime. STOC 2021: 1565-1578 - [i12]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Rapid mixing of Glauber dynamics via spectral independence for all degrees. CoRR abs/2105.15005 (2021) - [i11]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal Mixing Time for the Ising Model in the Uniqueness Regime. CoRR abs/2111.03034 (2021) - 2020
- [j1]Weiming Feng, Yuxin Sun, Yitong Yin:
What can be sampled locally? Distributed Comput. 33(3-4): 227-253 (2020) - [c4]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast sampling and counting k-SAT solutions in the local lemma regime. STOC 2020: 854-867 - [i10]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid mixing from spectral independence beyond the Boolean domain. CoRR abs/2007.08091 (2020) - [i9]Weiming Feng, Kun He, Yitong Yin:
Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. CoRR abs/2011.03915 (2020)
2010 – 2019
- 2019
- [c3]Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin:
Dynamic sampling from graphical models. STOC 2019: 1070-1081 - [i8]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. CoRR abs/1904.00943 (2019) - [i7]Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin:
Dynamic MCMC Sampling. CoRR abs/1904.11807 (2019) - [i6]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. CoRR abs/1907.06033 (2019) - [i5]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR abs/1911.01319 (2019) - 2018
- [c2]Weiming Feng, Yitong Yin:
On Local Distributed Sampling and Counting. PODC 2018: 189-198 - [i4]Weiming Feng, Yitong Yin:
On Local Distributed Sampling and Counting. CoRR abs/1802.06686 (2018) - [i3]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). CoRR abs/1802.06953 (2018) - [i2]Weiming Feng, Yahui Liu, Yitong Yin:
Local Rejection Sampling with Soft Filters. CoRR abs/1807.06481 (2018) - 2017
- [c1]Weiming Feng, Yuxin Sun, Yitong Yin:
What Can be Sampled Locally? PODC 2017: 121-130 - [i1]Weiming Feng, Yuxin Sun, Yitong Yin:
What can be sampled locally? CoRR abs/1702.00142 (2017)
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-22 20:11 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:
