EXPSPACE (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "EXPSPACE" in French language version.

refsWebsite

Global rank French rank

2doi.org

2^nd place

3^rd place

1caltech.edu

887^th place

928^th place

1mit.edu

415^th place

809^th place

1ieee.org

652^nd place

741^st place

1issn.org

57^th place

4^th place

1sciencedirect.com

149^th place

80^th place

caltech.edu (Global: 887^th place; French: 928^th place)

cs.caltech.edu

(en) Chris Umans, Kevin Lee, « Computational Complexity, Lecture Notes 8 », 19 février 2010

doi.org (Global: 2^nd place; French: 3^rd place)

dx.doi.org

I. Hodkinson, R. Kontchakov, A. Kurucz et F. Wolter, « On the computational complexity of decidable fragments of first-order linear temporal logics », 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings,‎ 1^er juillet 2003, p. 91–98 (DOI 10.1109/TIME.2003.1214884, lire en ligne, consulté le 17 octobre 2016)
(en) Charles Rackoff, « The covering and boundedness problems for vector addition systems », Theoretical Computer Science, vol. 6, n^o 2,‎ 1^er janvier 1978, p. 223–231 (ISSN 0304-3975, DOI 10.1016/0304-3975(78)90036-1, lire en ligne, consulté le 19 mai 2022)

ieee.org (Global: 652^nd place; French: 741^st place)

ieeexplore.ieee.org

I. Hodkinson, R. Kontchakov, A. Kurucz et F. Wolter, « On the computational complexity of decidable fragments of first-order linear temporal logics », 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings,‎ 1^er juillet 2003, p. 91–98 (DOI 10.1109/TIME.2003.1214884, lire en ligne, consulté le 17 octobre 2016)

issn.org (Global: 57^th place; French: 4^th place)

portal.issn.org

(en) Charles Rackoff, « The covering and boundedness problems for vector addition systems », Theoretical Computer Science, vol. 6, n^o 2,‎ 1^er janvier 1978, p. 223–231 (ISSN 0304-3975, DOI 10.1016/0304-3975(78)90036-1, lire en ligne, consulté le 19 mai 2022)

mit.edu (Global: 415^th place; French: 809^th place)

people.csail.mit.edu

Albert R. Meyer et Larry Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. 13th IEEE Symposium on Switching and Automata Theory, Oct 1972, pp.125–129.

sciencedirect.com (Global: 149^th place; French: 80^th place)

(en) Charles Rackoff, « The covering and boundedness problems for vector addition systems », Theoretical Computer Science, vol. 6, n^o 2,‎ 1^er janvier 1978, p. 223–231 (ISSN 0304-3975, DOI 10.1016/0304-3975(78)90036-1, lire en ligne, consulté le 19 mai 2022)

EXPSPACE (French Wikipedia)

caltech.edu (Global: 887th place; French: 928th place)

cs.caltech.edu

doi.org (Global: 2nd place; French: 3rd place)