:facetid:toc:\"db/conf/rp/rp2018.bht\"OK:facetid:toc:db/conf/rp/rp2018.bhtIovka BonevaJoachim NiehrenMomar SakhoCertain Query Answering on Compressed String Patterns: From Streams to Hyperstreams.RP117-1322018Conference and Workshop Papersclosedconf/rp/BonevaNS1810.1007/978-3-030-00250-3_9https://doi.org/10.1007/978-3-030-00250-3_9https://dblp.org/rec/conf/rp/BonevaNS18URL#2652320Joel D. DayVijay GaneshPaul HeFlorin ManeaDirk NowotkaThe Satisfiability of Word Equations: Decidable and Undecidable Theories.RP15-292018Conference and Workshop Papersclosedconf/rp/DayGHMN1810.1007/978-3-030-00250-3_2https://doi.org/10.1007/978-3-030-00250-3_2https://dblp.org/rec/conf/rp/DayGHMN18URL#2652321Matthew HagueVincent PenelleConstrained Dynamic Tree Networks.RP45-582018Conference and Workshop Papersclosedconf/rp/HagueP1810.1007/978-3-030-00250-3_4https://doi.org/10.1007/978-3-030-00250-3_4https://dblp.org/rec/conf/rp/HagueP18URL#2652322Petr JancarPetr OsickaZdenek SawaEXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.RP59-742018Conference and Workshop Papersclosedconf/rp/JancarOS1810.1007/978-3-030-00250-3_5https://doi.org/10.1007/978-3-030-00250-3_5https://dblp.org/rec/conf/rp/JancarOS18URL#2652323Alexei Lisitsa 0001Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification.RP75-862018Conference and Workshop Papersclosedconf/rp/Lisitsa1810.1007/978-3-030-00250-3_6https://doi.org/10.1007/978-3-030-00250-3_6https://dblp.org/rec/conf/rp/Lisitsa18URL#2652324Markus LohreyKnapsack in Hyperbolic Groups.RP87-1022018Conference and Workshop Papersclosedconf/rp/Lohrey1810.1007/978-3-030-00250-3_7https://doi.org/10.1007/978-3-030-00250-3_7https://dblp.org/rec/conf/rp/Lohrey18URL#2652325Turlough NearyMatthew Cook 0001Generalized Tag Systems.RP103-1162018Conference and Workshop Papersclosedconf/rp/Neary01810.1007/978-3-030-00250-3_8https://doi.org/10.1007/978-3-030-00250-3_8https://dblp.org/rec/conf/rp/Neary018URL#2652326Steven de OliveiraVirgile PrevostoPeter HabermehlSaddek BensalemLeft-Eigenvectors Are Certificates of the Orbit Problem.RP30-442018Conference and Workshop Papersclosedconf/rp/OliveiraPHB1810.1007/978-3-030-00250-3_3https://doi.org/10.1007/978-3-030-00250-3_3https://dblp.org/rec/conf/rp/OliveiraPHB18URL#2652327Julien Alexandre Dit SandrettoJian Wan 0002Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta.RP1-142018Conference and Workshop Papersclosedconf/rp/SandrettoW1810.1007/978-3-030-00250-3_1https://doi.org/10.1007/978-3-030-00250-3_1https://dblp.org/rec/conf/rp/SandrettoW18URL#2652328Michal SkrzypczakBüchi VASS Recognise ∑11-complete ω-languages.RP133-1452018Conference and Workshop Papersclosedconf/rp/Skrzypczak1810.1007/978-3-030-00250-3_10https://doi.org/10.1007/978-3-030-00250-3_10https://dblp.org/rec/conf/rp/Skrzypczak18URL#2652329Jeremy SprostonQualitative Reachability for Open Interval Markov Chains.RP146-1602018Conference and Workshop Papersclosedconf/rp/Sproston1810.1007/978-3-030-00250-3_11https://doi.org/10.1007/978-3-030-00250-3_11https://dblp.org/rec/conf/rp/Sproston18URL#2652330Igor PotapovPierre-Alain ReynierReachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, ProceedingsRPLecture Notes in Computer Science11123Springer2018Editorshipconf/rp/201810.1007/978-3-030-00250-3https://doi.org/10.1007/978-3-030-00250-3https://dblp.org/rec/conf/rp/2018URL#2684368