default search action
12th RP 2018: Marseille, France
- Igor Potapov, Pierre-Alain Reynier:
Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings. Lecture Notes in Computer Science 11123, Springer 2018, ISBN 978-3-030-00249-7 - Julien Alexandre Dit Sandretto, Jian Wan:
Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta. 1-14 - Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka:
The Satisfiability of Word Equations: Decidable and Undecidable Theories. 15-29 - Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem:
Left-Eigenvectors Are Certificates of the Orbit Problem. 30-44 - Matthew Hague, Vincent Penelle:
Constrained Dynamic Tree Networks. 45-58 - Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. 59-74 - Alexei Lisitsa:
Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification. 75-86 - Markus Lohrey:
Knapsack in Hyperbolic Groups. 87-102 - Turlough Neary, Matthew Cook:
Generalized Tag Systems. 103-116 - Iovka Boneva, Joachim Niehren, Momar Sakho:
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams. 117-132 - Michal Skrzypczak:
Büchi VASS Recognise ∑11-complete ω-languages. 133-145 - Jeremy Sproston:
Qualitative Reachability for Open Interval Markov Chains. 146-160
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.