• 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

• 2010
• 
  Golnaz Badkobeh, Maxime Crochemore:
  Bounded Number of Squares in Infinite Repetition-Constrained Binary Words. Stringology 2010: 161-166
• 
  Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
  The Number of Runs in a Ternary Word. Stringology 2010: 178-181
• 
  Noud de Beijer, Loek G. Cleophas, Derrick G. Kourie, Bruce W. Watson:
  Improving Automata Efficiency by Stretching and Jamming. Stringology 2010: 9-24
• 
  Martin Berglund, Frank Drewes:
  On the Complexity of Variants of the k Best Strings Problem. Stringology 2010: 76-88
• 
  Domenico Cantone, Salvatore Cristofaro, Simone Faro:
  A Space-Efficient Implementation of the Good-Suffix Heuristic. Stringology 2010: 63-75
• 
  Domenico Cantone, Simone Faro, Emanuele Giaquinta:
  Approximate String Matching Allowing for Inversions and Translocations. Stringology 2010: 37-51
• 
  Luigi Cinque, Sergio De Agostino, Luca Lombardi:
  Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability. Stringology 2010: 103-115
• 
  Raphaël Clifford, Alexandru Popa:
  (In)approximability Results for Pattern Matching Problems. Stringology 2010: 52-62
• 
  Maxime Crochemore, Dov M. Gabbay:
  Reactive Links to Save Automata States. Stringology 2010: 1-8
• 
  Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
  New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149
• 
  Szymon Grabowski, Wojciech Bieniecki:
  Tight and Simple Web Graph Compression. Stringology 2010: 127-137
• 
  Shmuel Tomi Klein, Dana Shapira:
  Practical Fixed Length Lempel Ziv Coding. Stringology 2010: 116-126
• 
  Kazuhiko Kusano, Ayumi Shinohara:
  Average Number of Runs and Squares in Necklace. Stringology 2010: 167-177
• 
  Jan Lahoda, Jan Zdárek:
  Simple Tree Pattern Matching for Trees in the Prefix Bar Notation. Stringology 2010: 25-36
• 
  Giuseppe Lancia, Romeo Rizzi, Russell Schwartz:
  Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. Stringology 2010: 89-102
• 
  Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
  Inferring Strings from Runs. Stringology 2010: 150-160
• 
  Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie:
  Formal Characterizations of FA-based String Processors. Stringology 2010: 183-185
• 
  Jan Holub, Jan Zdárek:
  Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague 2010, ISBN 978-80-01-04597-8 [contents]