Poset game (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Poset game" in English language version.

refsWebsite

Global rank English rank

2^nd place

451^st place

277^th place

11^th place

8^th place

207^th place

136^th place

low place

69^th place

59^th place

18^th place

17^th place

ams.org

Soltys, Michael; Wilson, Craig (2011), "On the complexity of computing winning strategies for finite poset games", Theory of Computing Systems, 48 (3): 680–692, CiteSeerX 10.1.1.150.3656, doi:10.1007/s00224-010-9254-y, MR 2770813, S2CID 2720334.
Byrnes, Steven (2003), "Poset game periodicity" (PDF), Integers, 3 (G3): 1–16, MR 2036487.

Grier, Daniel (2012), "Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete", Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 7965, pp. 497–503, arXiv:1209.1750, Bibcode:2012arXiv1209.1750G, doi:10.1007/978-3-642-39206-1_42, ISBN 978-3-642-39205-4, S2CID 13129445.

Soltys, Michael; Wilson, Craig (2011), "On the complexity of computing winning strategies for finite poset games", Theory of Computing Systems, 48 (3): 680–692, CiteSeerX 10.1.1.150.3656, doi:10.1007/s00224-010-9254-y, MR 2770813, S2CID 2720334.
Grier, Daniel (2012), "Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete", Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 7965, pp. 497–503, arXiv:1209.1750, Bibcode:2012arXiv1209.1750G, doi:10.1007/978-3-642-39206-1_42, ISBN 978-3-642-39205-4, S2CID 13129445.

Byrnes, Steven (2003), "Poset game periodicity" (PDF), Integers, 3 (G3): 1–16, MR 2036487.

Grier, Daniel (2012), "Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete", Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 7965, pp. 497–503, arXiv:1209.1750, Bibcode:2012arXiv1209.1750G, doi:10.1007/978-3-642-39206-1_42, ISBN 978-3-642-39205-4, S2CID 13129445.

Soltys, Michael; Wilson, Craig (2011), "On the complexity of computing winning strategies for finite poset games", Theory of Computing Systems, 48 (3): 680–692, CiteSeerX 10.1.1.150.3656, doi:10.1007/s00224-010-9254-y, MR 2770813, S2CID 2720334.

Soltys, Michael; Wilson, Craig (2011), "On the complexity of computing winning strategies for finite poset games", Theory of Computing Systems, 48 (3): 680–692, CiteSeerX 10.1.1.150.3656, doi:10.1007/s00224-010-9254-y, MR 2770813, S2CID 2720334.
Grier, Daniel (2012), "Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete", Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 7965, pp. 497–503, arXiv:1209.1750, Bibcode:2012arXiv1209.1750G, doi:10.1007/978-3-642-39206-1_42, ISBN 978-3-642-39205-4, S2CID 13129445.