{"doi":"10.1145/800070.802201","title":"Decidability of reachability in vector addition systems (Preliminary Version)","abstract":null,"journal":"Proceedings of the fourteenth annual ACM symposium on Theory of computing","year":1982,"id":29625,"datarank":22.39692762050499,"base_score":5.780743515792329,"endowment":5.780743515792329,"self_citation_contribution":0.8671115273688494,"citation_network_contribution":21.52981609313614,"self_endowment_contribution":0.8671115273688494,"citer_contribution":21.52981609313614,"corpus_percentile":null,"corpus_rank":null,"citation_count":323,"citer_count":200,"citers_with_citation_signal":200,"citers_with_endowment":200,"datacite_reuse_total":16,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":162947,"name":"S. Rao Kosaraju","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":5.780743515792329,"endowment":5.780743515792329,"datacite_reuse_total":16,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W1989788631","authors":[],"funders":[],"total_grants":0,"fwci":4.3982,"citation_percentile":0.95010482,"influential_citations":16,"citation_trend":[{"year":2012,"count":9},{"year":2013,"count":15},{"year":2014,"count":9},{"year":2015,"count":12},{"year":2016,"count":11},{"year":2017,"count":9},{"year":2018,"count":11},{"year":2019,"count":10},{"year":2020,"count":11},{"year":2021,"count":19},{"year":2022,"count":5},{"year":2023,"count":24},{"year":2024,"count":9},{"year":2025,"count":1},{"year":2026,"count":2}],"oa_status":"closed","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"http://www.mimuw.edu.pl/~bojan/papers/KosarajuDecidability82.pdf","host_type":"GREEN"},{"url":"https://dl.acm.org/doi/10.1145/800070.802201","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/800070.802201","host_type":"publisher"},{"url":"https://doi.org/10.1145/800070.802201","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4618","host_type":""}],"fields_of_study":["semigroups and automata theory","Logic, programming, and type systems","Formal Methods in Verification","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Reachability","Decidability","Mathematical proof","Tree (set theory)","Computer science","Reachability problem","Mathematics","Algebra over a field","Discrete mathematics","Theoretical computer science","Pure mathematics","Combinatorics"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.mfcs.2025.60","title":"Reachability in Symmetric VASS","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2025.153","title":"Reachability in 3-VASS Is Elementary","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2019.27","title":"Long-Run Average Behavior of Vector Addition Systems with States","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2017.119","title":"Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2024.126","title":"Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2024.136","title":"Improved Algorithm for Reachability in d-VASS","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.stacs.2016.1","title":"Ideal Decompositions for Vector Addition Systems (Invited Talk)","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2018.14","title":"Affine Extensions of Integer Vector Addition Systems with States","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.mfcs.2019.5","title":"Petri Net Reachability Problem (Invited Talk)","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2023.18","title":"History-Deterministic Vector Addition Systems","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.stacs.2022.46","title":"Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2021.128","title":"Improved Lower Bounds for Reachability in Vector Addition Systems","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2018.24","title":"Linear Equations with Ordered Data","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2020.23","title":"Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.icalp.2018.134","title":"Polynomial Vector Addition Systems With States","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.concur.2017.40","title":"On Petri Nets with Hierarchical Special Arcs","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T00:20:07.356699Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}