FKT algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "FKT algorithm" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

6harvard.edu

18^th place

17^th place

2ams.org

451^st place

277^th place

1americanscientist.org

7,231^st place

5,635^th place

1anu.edu.au

942^nd place

597^th place

1unlv.edu

6,804^th place

4,447^th place

1arxiv.org

69^th place

59^th place

1gatech.edu

4,448^th place

2,923^rd place

1icm2006.org

low place

1handle.net

102^nd place

76^th place

1worldcat.org

5^th place

1semanticscholar.org

11^th place

8^th place

americanscientist.org

Hayes, Brian (January–February 2008), "Accidental Algorithms", American Scientist

ams.org

Kenyon, Richard; Okounkov, Andrei (2005). "What is a Dimer?" (PDF). AMS. 52 (3): 342–343.

mathscinet.ams.org

Valiant, Leslie G. (2008). "Holographic algorithms" (PDF). SIAM Journal on Computing. 37 (5): 1565–1594. doi:10.1137/070682575. MR 2386281.

anu.edu.au

tpsrv.anu.edu.au

Baxter, R. J. (2008) [1982]. Exactly Solved Models in Statistical Mechanics (Third ed.). Dover Publications. p. 11. ISBN 978-0-486-46271-4.

arxiv.org

Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010). Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE. arXiv:1008.0683. Bibcode:2010arXiv1008.0683C.

doi.org

Kasteleyn, P. W. (1961), "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice", Physica, 27 (12): 1209–1225, Bibcode:1961Phy....27.1209K, doi:10.1016/0031-8914(61)90063-5
Temperley, H. N. V.; Fisher, Michael E. (1961). "Dimer problem in statistical mechanics-an exact result". Philosophical Magazine. 6 (68): 1061–1063. Bibcode:1961PMag....6.1061T. doi:10.1080/14786436108243366.
Kasteleyn, P. W. (1963). "Dimer Statistics and Phase Transitions". Journal of Mathematical Physics. 4 (2): 287–293. Bibcode:1963JMP.....4..287K. doi:10.1063/1.1703953.
Vazirani, Vijay V. (1989). "NC algorithms for computing the number of perfect matchings in K_3,3-free graphs and related problems". Information and Computation. 80 (2): 152–164. doi:10.1016/0890-5401(89)90017-5. hdl:1813/6700. ISSN 0890-5401.
Jerrum, Mark (1987), "Two-dimensional monomer-dimer systems are computationally intractable", Journal of Statistical Physics, 48 (1): 121–134, Bibcode:1987JSP....48..121J, doi:10.1007/BF01010403, S2CID 189854401.
Valiant, Leslie G. (2008). "Holographic algorithms" (PDF). SIAM Journal on Computing. 37 (5): 1565–1594. doi:10.1137/070682575. MR 2386281.

gatech.edu

people.math.gatech.edu

Thomas, Robin (2006). A survey of Pfaffian orientations of graphs (PDF). International Congress of Mathematicians. Vol. III. Zurich: European Mathematical Society. pp. 963–984.

handle.net

hdl.handle.net

Vazirani, Vijay V. (1989). "NC algorithms for computing the number of perfect matchings in K_3,3-free graphs and related problems". Information and Computation. 80 (2): 152–164. doi:10.1016/0890-5401(89)90017-5. hdl:1813/6700. ISSN 0890-5401.

harvard.edu

ui.adsabs.harvard.edu

Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010). Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE. arXiv:1008.0683. Bibcode:2010arXiv1008.0683C.
Kasteleyn, P. W. (1961), "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice", Physica, 27 (12): 1209–1225, Bibcode:1961Phy....27.1209K, doi:10.1016/0031-8914(61)90063-5
Temperley, H. N. V.; Fisher, Michael E. (1961). "Dimer problem in statistical mechanics-an exact result". Philosophical Magazine. 6 (68): 1061–1063. Bibcode:1961PMag....6.1061T. doi:10.1080/14786436108243366.
Kasteleyn, P. W. (1963). "Dimer Statistics and Phase Transitions". Journal of Mathematical Physics. 4 (2): 287–293. Bibcode:1963JMP.....4..287K. doi:10.1063/1.1703953.
Jerrum, Mark (1987), "Two-dimensional monomer-dimer systems are computationally intractable", Journal of Statistical Physics, 48 (1): 121–134, Bibcode:1987JSP....48..121J, doi:10.1007/BF01010403, S2CID 189854401.

people-aws.seas.harvard.edu

Valiant, Leslie G. (2008). "Holographic algorithms" (PDF). SIAM Journal on Computing. 37 (5): 1565–1594. doi:10.1137/070682575. MR 2386281.

icm2006.org

Thomas, Robin (2006). A survey of Pfaffian orientations of graphs (PDF). International Congress of Mathematicians. Vol. III. Zurich: European Mathematical Society. pp. 963–984.

semanticscholar.org

api.semanticscholar.org

Jerrum, Mark (1987), "Two-dimensional monomer-dimer systems are computationally intractable", Journal of Statistical Physics, 48 (1): 121–134, Bibcode:1987JSP....48..121J, doi:10.1007/BF01010403, S2CID 189854401.

unlv.edu

egr.unlv.edu

Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010). Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE. arXiv:1008.0683. Bibcode:2010arXiv1008.0683C.

worldcat.org

Vazirani, Vijay V. (1989). "NC algorithms for computing the number of perfect matchings in K_3,3-free graphs and related problems". Information and Computation. 80 (2): 152–164. doi:10.1016/0890-5401(89)90017-5. hdl:1813/6700. ISSN 0890-5401.