• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 18 matches

• 2019
• 
  Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný:
  Bidding Games on Markov Decision Processes. RP 2019: 1-12
• 
  Václav Blazej, Jan Matyás Kristan, Tomás Valla:
  On the m-eternal Domination Number of Cactus Graphs. RP 2019: 33-47
• 
  Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset:
  On Relevant Equilibria in Reachability Games. RP 2019: 48-62
• 
  Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
  Partial Solvers for Generalized Parity Games. RP 2019: 63-78
• 
  Ventsislav Chonev:
  Reachability in Augmented Interval Markov Chains. RP 2019: 79-92
• 
  Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
  On Solving Word Equations Using SAT. RP 2019: 93-106
• 
  Giorgio Delzanno:
  Parameterised Verification of Publish/Subscribe Networks with Exception Handling. RP 2019: 107-120
• 
  Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer:
  Reachability of Five Gossip Protocols. RP 2019: 218-231
• 
  Nazim Fatès, Irène Marcovici, Siamak Taati:
  Cellular Automata for the Self-stabilisation of Colourings and Tilings. RP 2019: 121-136
• 
  Christopher Hampson:
  On the Termination Problem for Counter Machines with Incrementing Errors. RP 2019: 137-148
• 
  Chris Köcher:
  Reachability Problems on Partially Lossy Queue Automata. RP 2019: 149-163
• 
  Vladimir Yu. Protasov:
  Primitivity and Synchronizing Automata: A Functional Analytic Approach. RP 2019: 13-21
• 
  Pierre-Alain Reynier, Frédéric Servais:
  On the Computation of the Minimal Coverability Set of Petri Nets. RP 2019: 164-177
• 
  Andrei Sandler, Olga Tveretina:
  Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. RP 2019: 178-192
• 
  Sriram Sankaranarayanan, Souradeep Dutta, Sergio Mover:
  Reaching Out Towards Fully Verified Autonomous Systems. RP 2019: 22-32
• 
  Sylvain Schmitz, Georg Zetzsche:
  Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP 2019: 193-201
• 
  Ronny Tredup:
  Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. RP 2019: 202-217
• 
  Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov:
  Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Lecture Notes in Computer Science 11674, Springer 2019, ISBN 978-3-030-30805-6 [contents]