( en | de | ru )

 

Disambiguation of "Yang, Linji"

Author of the publication

copydeleteadd this publication to your clipboard
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results.

, , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 677-691. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yang Yang

Yang Yang

Yang Yang

Yang Yang

Yang Yang

 

Other publications of authors with the same name

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model., , , , and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 567-578. Springer, (2011)Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results., , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 677-691. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees., , , , and . SODA, page 945-956. SIAM, (2011)Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees., , , and . SODA, page 1646-1656. SIAM, (2010)Average-Case Complexity of the Min-Sum Matrix Product Problem., , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 41-52. Springer, (2014)Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets., , , , and . FOCS, page 140-149. IEEE Computer Society, (2011)Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 1153-1162. Springer, (2005)Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 412-421. Springer, (2005)Improved inapproximability results for counting independent sets in the hard-core model., , , , and . Random Struct. Algorithms, 45 (1): 78-110 (2014)Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions., , and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 699-713. Springer, (2013)