@inproceedings{GoellerHaaseLazicTotzke:BVASS:ICALP:2016,
Address = {Dagstuhl, Germany},
Annote = {Keywords: branching vector addition systems, reachability, coverability, boundedness},
Author = {G{\"o}ller, Stefan and Haase, Christoph and Lazic, Ranko and Totzke, Patrick},
BookTitle = {Proc. of ICALP'16},
Editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
File = {LIPIcs-ICALP-2016-105 (0) (0) - a - a - t.pdf},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
Pages = {105:1--105:13},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6240},
Volume = {55},
Year = {2016},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/6240},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2016.105},
date-added = {2019-03-05 20:31:56 +0100},
date-modified = {2019-03-05 20:33:37 +0100},
urn = {urn:nbn:de:0030-drops-62409},
doi = {10.4230/LIPIcs.ICALP.2016.105}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A