• 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 222 matches

• 2021
• 
  Sumit Adak, Sukanya Mukherjee, Sukanta Das:
  Reachability problem in non-uniform cellular automata. Inf. Sci. 543: 72-84 (2021)
• 
  Wei Liao, Xiaohui Wei, Jizhou Lai:
  Cost-limited reachability: a new problem in reachability analysis. CoRR abs/2101.09646 (2021)
• 2020
• 
  Matthew Dippel, Ravi Sundaram, Akshar Varma:
  Realization Problems on Reachability Sequences. COCOON 2020: 274-286
• 
  Benedikt Bollig, Alain Finkel, Amrita Suresh:
  Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR 2020: 49:1-49:17
• 
  Stefan Jaax, Stefan Kiefer:
  On Affine Reachability Problems. MFCS 2020: 48:1-48:14
• 
  Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Egor Derevenetc, Carl Leonardsson, Roland Meyer:
  On the State Reachability Problem for Concurrent Programs Under Power. NETYS 2020: 47-59
• 
  C. Aiswarya:
  On Network Topologies and the Decidability of Reachability Problem. NETYS 2020: 3-10
• 
  Xinwei Chai, Tony Ribeiro, Morgan Magnin, Olivier F. Roux, Katsumi Inoue:
  Static Analysis and Stochastic Search for Reachability Problem. SASB 2020: 139-158
• 
  Sylvain Schmitz, Igor Potapov:
  Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings. Lecture Notes in Computer Science 12448, Springer 2020, ISBN 978-3-030-61738-7 [contents]
• 2019
• 
  Igor Potapov, Pavel Semukhin:
  Vector and scalar reachability problems in SL(2, Z). J. Comput. Syst. Sci. 100: 30-43 (2019)
• 
  Joseph D. Gleason, Abraham P. Vinod, Meeko M. K. Oishi:
  The Maximal Hitting-Time Stochastic Reachability Problem. CDC 2019: 7266-7272
• 
  Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
  On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP 2019: 44:1-44:15
• 
  Jérôme Leroux:
  Petri Net Reachability Problem (Invited Talk). MFCS 2019: 5:1-5:3
• 
  Michael Stiglmayr:
  Layout Problems with Reachability Constraint. OR 2019: 183-189
• 
  Chris Köcher:
  Reachability Problems on Partially Lossy Queue Automata. RP 2019: 149-163
• 
  Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
  The reachability problem for Petri nets is not elementary. STOC 2019: 24-33
• 
  Peter Chini, Roland Meyer:
  Inductive Counting and the Reachability Problem for Petri Nets. Carl Adam Petri: Ideas, Personality, Impact 2019: 161-169
• 
  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]
• 
  Sumit Adak, Sukanya Mukherjee, Sukanta Das:
  Reachability Problem in Non-uniform Cellular Automata. CoRR abs/1901.08246 (2019)
• 
  Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
  On reachability problems for low dimensional matrix semigroups. CoRR abs/1902.09597 (2019)
• 2018
• 
  Reino Niskanen:
  Reachability games and related matrix and word problems. University of Liverpool, UK, 2018
• 
  Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov:
  Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29(4): 529-549 (2018)
• 
  Adam Case, Jack H. Lutz, Donald M. Stull:
  Reachability problems for continuous chemical reaction networks. Nat. Comput. 17(2): 223-230 (2018)
• 
  Xiaofeng Gao, Yueyang Xianzang, Xiaotian You, Yaru Dang, Guihai Chen, Xinglong Wang:
  Reachability for airline networks: fast algorithm for shortest path problem with time windows. Theor. Comput. Sci. 749: 66-79 (2018)
• 
  Kim G. Larsen, Igor Potapov, Jirí Srba:
  Reachability problems: Special issue. Theor. Comput. Sci. 750: 1 (2018)
• 
  Joël Ouaknine, Igor Potapov, James Worrell:
  Reachability Problems 2014: Special issue. Theor. Comput. Sci. 735: 1 (2018)
• 
  Ryo Ashida, Kotaro Nakagawa:
  O~(n{1/3})-Space Algorithm for the Grid Graph Reachability Problem. Symposium on Computational Geometry 2018: 5:1-5:13
• 
  Sang-Ki Ko, Reino Niskanen, Igor Potapov:
  Reachability Problems in Nondeterministic Polynomial Maps on the Integers. DLT 2018: 465-477
• 
  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 [contents]
• 
  Ryo Ashida, Kotaro Nakagawa:
  O͂(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem. CoRR abs/1803.07097 (2018)

skipping 192 more matches