Problème d'accessibilité (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problème d'accessibilité" in French language version.

refsWebsite

Global rank French rank

low place

869^th place

832^nd place

2^nd place

3^rd place

1,185^th place

1,318^th place

207^th place

929^th place

7,215^th place

9,222^nd place

69^th place

232^nd place

acm.org

(en) Ernst W. Mayr, « An algorithm for the general Petri net reachability problem », STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing, Association for Computing Machinery,‎ 11 mai 1981, p. 238–246 (DOI 10.1145/800076.802477, lire en ligne, consulté le 14 novembre 2018)

(en) Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux et Filip Mazowiecki, « The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract) », 2018.

(en) Ernst W. Mayr, « An algorithm for the general Petri net reachability problem », STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing, Association for Computing Machinery,‎ 11 mai 1981, p. 238–246 (DOI 10.1145/800076.802477, lire en ligne, consulté le 14 novembre 2018)

Omer Reingold, « Undirected connectivity in log-space », Journal of the ACM, vol. 55, n^o 4,‎ 2008, p. 1–24 (lire en ligne)

P. Küngas « Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies » (July 26–29, 2005) (lire en ligne)
—Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation—SARA 2005

R. Lipton, « The Reachability Problem Requires Exponential Space », Technical Report 62,‎ 1976 (lire en ligne)

(en) RP Organization Committee, « (RP'17) 11th International Workshop on Reachability Problems 2017 », sur rp17.cs.rhul.ac.uk (consulté le 18 janvier 2018)