Space complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Space complexity" in English language version.

refsWebsite

Global rank English rank

3doi.org

2^nd place

2ams.org

451^st place

277^th place

2semanticscholar.org

11^th place

8^th place

1books.google.com

3^rd place

1princeton.edu

741^st place

577^th place

1umass.edu

3,341^st place

2,191^st place

1harvard.edu

18^th place

17^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Immerman, Neil (1988), "Nondeterministic space is closed under complementation" (PDF), SIAM Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049
Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2006), "Pseudorandom walks on regular digraphs and the RL vs. L problem" (PDF), STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 1-59593-134-1, MR 2277171, S2CID 17360260

books.google.com (Global: 3^rd place; English: 3^rd place)

Kuo, Way; Zuo, Ming J. (2003), Optimal Reliability Modeling: Principles and Applications, John Wiley & Sons, p. 62, ISBN 9780471275459

doi.org (Global: 2^nd place; English: 2^nd place)

Immerman, Neil (1988), "Nondeterministic space is closed under complementation" (PDF), SIAM Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049
Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10.1145/129712.129772, ISBN 0-89791-511-9, S2CID 11651375{{citation}}: CS1 maint: location missing publisher (link).
Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2006), "Pseudorandom walks on regular digraphs and the RL vs. L problem" (PDF), STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 1-59593-134-1, MR 2277171, S2CID 17360260

harvard.edu (Global: 18^th place; English: 17^th place)

people.seas.harvard.edu

Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2006), "Pseudorandom walks on regular digraphs and the RL vs. L problem" (PDF), STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 1-59593-134-1, MR 2277171, S2CID 17360260

princeton.edu (Global: 741^st place; English: 577^th place)

theory.cs.princeton.edu

Arora, Sanjeev; Barak, Boaz (2007), Computational Complexity : A Modern Approach (PDF) (draft ed.), p. 76, ISBN 9780511804090

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10.1145/129712.129772, ISBN 0-89791-511-9, S2CID 11651375{{citation}}: CS1 maint: location missing publisher (link).
Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2006), "Pseudorandom walks on regular digraphs and the RL vs. L problem" (PDF), STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 1-59593-134-1, MR 2277171, S2CID 17360260

umass.edu (Global: 3,341^st place; English: 2,191^st place)

cs.umass.edu

Immerman, Neil (1988), "Nondeterministic space is closed under complementation" (PDF), SIAM Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049

Space complexity (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

books.google.com (Global: 3rd place; English: 3rd place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)