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

2^nd place

451^st place

277^th place

11^th place

8^th place

3^rd place

741^st place

577^th place

3,341^st place

2,191^st place

18^th place

17^th place

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
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

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