Yitong Yin

According to our database1, Yitong Yin authored at least 37 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
SIAM J. Comput., 2019

Counting hypergraph matchings up to uniqueness threshold.
Inf. Comput., 2019

Fast sampling and counting k-SAT solutions in the local lemma regime.
CoRR, 2019

Perfect sampling from spatial mixing.
CoRR, 2019

Dynamic MCMC Sampling.
CoRR, 2019

Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup.
CoRR, 2019

Dynamic sampling from graphical models.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity.
TOPC, 2018

Local Rejection Sampling with Soft Filters.
CoRR, 2018

Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors).
CoRR, 2018

On Local Distributed Sampling and Counting.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
What Can be Sampled Locally?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Approximating the Partition Function of Two-Spin Systems.
Encyclopedia of Algorithms, 2016

Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Sampling in Potts Model on Sparse Random Graphs.
Proceedings of the Approximation, 2016

2015
Expander chunked codes.
EURASIP J. Adv. Sig. Proc., 2015

Spatial mixing and approximate counting for Potts model on graphs with bounded average degree.
CoRR, 2015

Counting hypergraph matchings up to uniqueness threshold.
CoRR, 2015

Spatial mixing and the connective constant: Optimal bounds.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Belief propagation for spatial spectrum access games.
Proceedings of the Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2014

Approximate capacities of two-dimensional codes by spatial mixing.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Spatial Mixing of Coloring Random Graphs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Certificates in Data Structures.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Approximate Counting via Correlation Decay on Planar Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Correlation Decay up to Uniqueness in Spin Systems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Improved FPTAS for Multi-spin Systems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Low-contention data structures.
J. Parallel Distributed Comput., 2012

Randomized load balancing by joining and splitting bins.
Inf. Process. Lett., 2012

Approximate counting via correlation decay in spin systems.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Expander graph based overlapped chunked codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2010
Cell-Probe Proofs.
TOCT, 2010

Assigning tasks for efficiency in Hadoop: extended abstract.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2008
Ranged hash functions and the price of churn.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Path-independent load balancing with unreliable machines.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005
Fast construction of overlay networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005


  Loading...