default search action
Yitong Yin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c41]Chunyang Wang, Yitong Yin:
A Sampling Lovász Local Lemma for Large Domain Sizes. FOCS 2024: 129-150 - [i40]Xiaoyu Chen, Xiongxin Yang, Yitong Yin, Xinyuan Zhang:
Spectral Independence Beyond Total Influence on Trees and Related Graphs. CoRR abs/2404.04668 (2024) - [i39]Hongyang Liu, Yitong Yin, Yiyao Zhang:
Work-Efficient Parallel Counting via Sampling. CoRR abs/2408.09719 (2024) - 2023
- [c40]Xinyu Fu, Yitong Yin, Chaodong Zheng:
Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative Algorithms. COCOON (1) 2023: 232-243 - [c39]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. FOCS 2023: 1963-1990 - [c38]Xiaoyu Chen, Jingcheng Liu, Yitong Yin:
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract). FOCS 2023: 1991-2005 - [c37]Kun He, Chunyang Wang, Yitong Yin:
Deterministic counting Lovász local lemma beyond linear programming. SODA 2023: 3388-3425 - [i38]Xiaoyu Chen, Jingcheng Liu, Yitong Yin:
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model. CoRR abs/2305.00186 (2023) - [i37]Chunyang Wang, Yitong Yin:
Correlation decay up to the sampling threshold in the local lemma regime. CoRR abs/2307.14872 (2023) - [i36]Xinyu Fu, Yonggang Jiang, Yitong Yin:
Perfect Simulation of Las Vegas Algorithms via Local Computation. CoRR abs/2311.11679 (2023) - 2022
- [j12]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. Random Struct. Algorithms 61(4): 678-709 (2022) - [j11]Weiming Feng
, Heng Guo
Rapid Mixing from Spectral Independence beyond the Boolean Domain. ACM Trans. Algorithms 18(3): 28:1-28:32 (2022) - [c36]Kun He, Chunyang Wang, Yitong Yin:
Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time. FOCS 2022: 147-158 - [c35]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal mixing for two-state anti-ferromagnetic spin systems. FOCS 2022: 588-599 - [c34]Penghui Yao, Yitong Yin, Xinyuan Zhang:
Polynomial-Time Approximation of Zero-Free Partition Functions. ICALP 2022: 108:1-108:20 - [c33]Hongyang Liu, Yitong Yin:
Simple parallel algorithms for single-site dynamics. STOC 2022: 1431-1444 - [i35]Penghui Yao, Yitong Yin, Xinyuan Zhang:
Polynomial-Time Approximation of Zero-Free Partition Functions. CoRR abs/2201.12772 (2022) - [i34]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal mixing for two-state anti-ferromagnetic spin systems. CoRR abs/2203.07771 (2022) - [i33]Kun He, Chunyang Wang, Yitong Yin:
Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time. CoRR abs/2204.01520 (2022) - [i32]Xinyu Fu, Yitong Yin, Chaodong Zheng:
Locally-iterative (Δ+1)-Coloring in Sublinear (in Δ) Rounds. CoRR abs/2207.14458 (2022) - [i31]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. CoRR abs/2211.03487 (2022) - [i30]Kun He, Chunyang Wang, Yitong Yin:
Deterministic counting Lovász local lemma beyond linear programming. CoRR abs/2212.14847 (2022) - 2021
- [j10]Weiming Feng, Heng Guo, Yitong Yin
Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime. J. ACM 68(6): 40:1-40:42 (2021) - [j9]Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin
Dynamic Sampling from Graphical Models. SIAM J. Comput. 50(2): 350-381 (2021) - [c32]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Rapid mixing of Glauber dynamics via spectral independence for all degrees. FOCS 2021: 137-148 - [c31]Weiming Feng, Kun He, Xiaoming Sun
Dynamic Inference in Probabilistic Graphical Models. ITCS 2021: 25:1-25:20 - [c30]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. SODA 2021: 1558-1577 - [c29]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Metropolis Sampler with Optimal Parallelism. SODA 2021: 2121-2140 - [c28]Weiming Feng, Kun He, Yitong Yin:
Sampling constraint satisfaction solutions in the local lemma regime. STOC 2021: 1565-1578 - [e1]Kun He
Theoretical Computer Science - 38th National Conference, NCTCS 2020, Nanning, China, November 13-15, 2020, Revised Selected Papers. Communications in Computer and Information Science 1352, Springer 2021, ISBN 978-981-16-1876-5 [contents] - [i29]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Rapid mixing of Glauber dynamics via spectral independence for all degrees. CoRR abs/2105.15005 (2021) - [i28]Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang:
Optimal Mixing Time for the Ising Model in the Uniqueness Regime. CoRR abs/2111.03034 (2021) - [i27]Hongyang Liu, Yitong Yin:
Simple Parallel Algorithms for Single-Site Dynamics. CoRR abs/2111.04044 (2021) - 2020
- [j8]Weiming Feng, Yuxin Sun, Yitong Yin
What can be sampled locally? Distributed Comput. 33(3-4): 227-253 (2020) - [c27]Mingmou Liu
Succinct Filters for Sets of Unknown Sizes. ICALP 2020: 79:1-79:19 - [c26]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast sampling and counting k-SAT solutions in the local lemma regime. STOC 2020: 854-867 - [i26]Mingmou Liu
Succinct Filters for Sets of Unknown Sizes. CoRR abs/2004.12465 (2020) - [i25]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid mixing from spectral independence beyond the Boolean domain. CoRR abs/2007.08091 (2020) - [i24]Weiming Feng, Kun He, Yitong Yin:
Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. CoRR abs/2011.03915 (2020)
2010 – 2019
- 2019
- [j7]Renjie Song, Yitong Yin, Jinman Zhao:
Counting hypergraph matchings up to uniqueness threshold. Inf. Comput. 266: 75-96 (2019) - [j6]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48(2): 581-643 (2019) - [c25]Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin:
Dynamic sampling from graphical models. STOC 2019: 1070-1081 - [i23]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. CoRR abs/1904.00943 (2019) - [i22]Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin:
Dynamic MCMC Sampling. CoRR abs/1904.11807 (2019) - [i21]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. CoRR abs/1907.06033 (2019) - [i20]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
- [j5]Mingmou Liu
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. ACM Trans. Parallel Comput. 5(1): 3:1-3:26 (2018) - [c24]Weiming Feng, Yitong Yin:
On Local Distributed Sampling and Counting. PODC 2018: 189-198 - [i19]Weiming Feng, Yitong Yin:
On Local Distributed Sampling and Counting. CoRR abs/1802.06686 (2018) - [i18]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). CoRR abs/1802.06953 (2018) - [i17]Weiming Feng, Yahui Liu, Yitong Yin:
Local Rejection Sampling with Soft Filters. CoRR abs/1807.06481 (2018) - 2017
- [c23]Weiming Feng, Yuxin Sun, Yitong Yin:
What Can be Sampled Locally? PODC 2017: 121-130 - [i16]Weiming Feng, Yuxin Sun, Yitong Yin:
What can be sampled locally? CoRR abs/1702.00142 (2017) - 2016
- [c22]Renjie Song, Yitong Yin, Jinman Zhao:
Counting Hypergraph Matchings up to Uniqueness Threshold. APPROX-RANDOM 2016: 46:1-46:29 - [c21]Yitong Yin, Chihao Zhang:
Sampling in Potts Model on Sparse Random Graphs. APPROX-RANDOM 2016: 47:1-47:22 - [c20]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS 2016: 704-713 - [c19]Yitong Yin:
Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities. ICALP 2016: 84:1-84:13 - [c18]Mingmou Liu
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. SPAA 2016: 23-33 - [r1]Pinyan Lu, Yitong Yin:
Approximating the Partition Function of Two-Spin Systems. Encyclopedia of Algorithms 2016: 117-123 - [i15]Mingmou Liu
Randomized approximate nearest neighbor search with limited adaptivity. CoRR abs/1602.04421 (2016) - [i14]Yitong Yin:
Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities. CoRR abs/1602.05391 (2016) - [i13]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR abs/1604.01422 (2016) - 2015
- [j4]Bin Tang, Shenghao Yang, Baoliu Ye, Yitong Yin, Sanglu Lu:
Expander chunked codes. EURASIP J. Adv. Signal Process. 2015: 106 (2015) - [c17]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. SODA 2015: 1549-1563 - [i12]Yitong Yin, Jinman Zhao:
Counting hypergraph matchings up to uniqueness threshold. CoRR abs/1503.05812 (2015) - [i11]Yitong Yin, Chihao Zhang:
Spatial mixing and approximate counting for Potts model on graphs with bounded average degree. CoRR abs/1507.07225 (2015) - 2014
- [c16]Yaoyu Wang, Yitong Yin:
Certificates in Data Structures. ICALP (1) 2014: 1039-1050 - [c15]Yitong Yin:
Spatial Mixing of Coloring Random Graphs. ICALP (1) 2014: 1075-1086 - [c14]Yi-Kai Wang, Yitong Yin, Sheng Zhong:
Approximate capacities of two-dimensional codes by spatial mixing. ISIT 2014: 1061-1065 - [c13]Yi-Kai Wang, Yitong Yin, Sheng Zhong:
Belief propagation for spatial spectrum access games. MobiHoc 2014: 225-234 - [i10]Yi-Kai Wang, Yitong Yin, Sheng Zhong:
Approximate Capacities of Two-Dimensional Codes by Spatial Mixing. CoRR abs/1401.4831 (2014) - [i9]Yitong Yin:
Spatial Mixing of Coloring Random Graphs. CoRR abs/1402.4556 (2014) - [i8]Yaoyu Wang, Yitong Yin:
Certificates in Data Structures. CoRR abs/1404.5743 (2014) - [i7]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. CoRR abs/1410.2595 (2014) - 2013
- [c12]Pinyan Lu
Improved FPTAS for Multi-spin Systems. APPROX-RANDOM 2013: 639-654 - [c11]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. FOCS 2013: 300-309 - [c10]Yitong Yin, Chihao Zhang:
Approximate Counting via Correlation Decay on Planar Graphs. SODA 2013: 47-66 - [c9]Liang Li, Pinyan Lu
Correlation Decay up to Uniqueness in Spin Systems. SODA 2013: 67-84 - [i6]Bin Tang, Shenghao Yang, Baoliu Ye, Yitong Yin, Sanglu Lu:
Expander Chunked Codes. CoRR abs/1307.5664 (2013) - [i5]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial mixing and approximation algorithms for graphs with bounded connective constant. CoRR abs/1308.1762 (2013) - 2012
- [j3]James Aspnes, Yitong Yin:
Randomized load balancing by joining and splitting bins. Inf. Process. Lett. 112(8-9): 309-313 (2012) - [j2]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. J. Parallel Distributed Comput. 72(5): 705-715 (2012) - [c8]Bin Tang, Shenghao Yang, Yitong Yin, Baoliu Ye, Sanglu Lu:
Expander graph based overlapped chunked codes. ISIT 2012: 2451-2455 - [c7]Liang Li, Pinyan Lu
Approximate counting via correlation decay in spin systems. SODA 2012: 922-940 - [i4]Yitong Yin, Chihao Zhang:
Approximate Counting via Correlation Decay on Planar Graphs. CoRR abs/1207.3564 (2012) - 2011
- [i3]Liang Li, Pinyan Lu, Yitong Yin:
Approximate Counting via Correlation Decay in Spin Systems. CoRR abs/1109.0604 (2011) - [i2]Liang Li, Pinyan Lu, Yitong Yin:
Correlation Decay up to Uniqueness in Spin Systems. CoRR abs/1111.7064 (2011) - 2010
- [j1]Yitong Yin:
Cell-Probe Proofs. ACM Trans. Comput. Theory 2(1): 1:1-1:17 (2010) - [c6]Michael J. Fischer, Xueyuan Su, Yitong Yin:
Assigning tasks for efficiency in Hadoop: extended abstract. SPAA 2010: 30-39 - [c5]James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. SPAA 2010: 345-354
2000 – 2009
- 2008
- [c4]Yitong Yin:
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity. ICALP (1) 2008: 72-83 - [c3]James Aspnes, Muli Safra
Ranged hash functions and the price of churn. SODA 2008: 1066-1075 - 2007
- [c2]James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines. SODA 2007: 814-823 - 2006
- [i1]James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines. CoRR abs/cs/0607026 (2006) - 2005
- [c1]Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin:
Fast construction of overlay networks. SPAA 2005: 145-154
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-12-10 20:51 CET 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: