Reachability problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Reachability problem" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

69^th place

59^th place

194^th place

643^rd place

1files.wordpress.com

869^th place

864^th place

1semanticscholar.org

11^th place

8^th place

274^th place

309^th place

652^nd place

515^th place

1quantamagazine.org

6,413^th place

4,268^th place

arxiv.org

Czerwinski, Wojciech; Lasota, Slawomir; Lazic, Ranko; Leroux, Jerome; Mazowiecki, Filip (2019-04-11). "The Reachability Problem for Petri Nets is Not Elementary". arXiv:1809.07115 [cs.FL].
Leroux, Jerome (February 2022). "The Reachability Problem for Petri Nets is Not Primitive Recursive". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1241–1252. arXiv:2104.12695. doi:10.1109/FOCS52979.2021.00121. ISBN 978-1-6654-2055-6.
Czerwiński, Wojciech; Orlikowski, Łukasz (2021). Reachability in Vector Addition Systems is Ackermann-complete. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2104.13866.

doi.org

Mayr, Ernst W. (1981-05-11). "An algorithm for the general Petri net reachability problem". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81. New York, NY, USA: Association for Computing Machinery. pp. 238–246. doi:10.1145/800076.802477. ISBN 978-1-4503-7392-0. S2CID 15409115.
Küngas, Peep (2005). "Petri Net Reachability Checking is Polynomial with Optimal Abstraction Hierarchies". In Zucker, Jean-Daniel; Saitta, Lorenza (eds.). Abstraction, Reformulation and Approximation. Lecture Notes in Computer Science. Vol. 3607. Berlin, Heidelberg: Springer. pp. 149–164. doi:10.1007/11527862_11. ISBN 978-3-540-31882-8.
Leroux, Jerome (February 2022). "The Reachability Problem for Petri Nets is Not Primitive Recursive". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1241–1252. arXiv:2104.12695. doi:10.1109/FOCS52979.2021.00121. ISBN 978-1-6654-2055-6.

files.wordpress.com

omereingold.files.wordpress.com

Reingold, Omer (3 May 2008). "Undirected Connectivity in Log-Space". omereingold.files.wordpress.com. Archived from the original on 2007-06-15. Retrieved 9 December 2021.

ieee.org

ieeexplore.ieee.org

Leroux, Jerome (February 2022). "The Reachability Problem for Petri Nets is Not Primitive Recursive". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1241–1252. arXiv:2104.12695. doi:10.1109/FOCS52979.2021.00121. ISBN 978-1-6654-2055-6.

quantamagazine.org

Brubaker, Ben (4 December 2023). "An Easy-Sounding Problem Yields Numbers Too Big for Our Universe". Quanta Magazine.

semanticscholar.org

api.semanticscholar.org

Mayr, Ernst W. (1981-05-11). "An algorithm for the general Petri net reachability problem". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81. New York, NY, USA: Association for Computing Machinery. pp. 238–246. doi:10.1145/800076.802477. ISBN 978-1-4503-7392-0. S2CID 15409115.

springer.com

link.springer.com

Küngas, Peep (2005). "Petri Net Reachability Checking is Polynomial with Optimal Abstraction Hierarchies". In Zucker, Jean-Daniel; Saitta, Lorenza (eds.). Abstraction, Reformulation and Approximation. Lecture Notes in Computer Science. Vol. 3607. Berlin, Heidelberg: Springer. pp. 149–164. doi:10.1007/11527862_11. ISBN 978-3-540-31882-8.

wikiwix.com

archive.wikiwix.com

Reingold, Omer (3 May 2008). "Undirected Connectivity in Log-Space". omereingold.files.wordpress.com. Archived from the original on 2007-06-15. Retrieved 9 December 2021.