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

• 2023
• 
  Diego Arroyuelo, Juan Pablo Castillo:
  Trie-Compressed Adaptive Set Intersection. CPM 2023: 1:1-1:19
• 
  Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka:
  Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12
• 
  Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
  Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11
• 
  Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen:
  Sliding Window String Indexing in Streams. CPM 2023: 4:1-4:18
• 
  Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa:
  Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. CPM 2023: 5:1-5:18
• 
  Pierre Bourhis, Aaron Boussidan, Philippe Gambette:
  On Distances Between Words with Parameters. CPM 2023: 6:1-6:23
• 
  Manuel Cáceres:
  Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CPM 2023: 7:1-7:19
• 
  Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
  Optimal Near-Linear Space Heaviest Induced Ancestors. CPM 2023: 8:1-8:18
• 
  Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen:
  From Bit-Parallelism to Quantum String Matching for Labelled Graphs. CPM 2023: 9:1-9:20
• 
  Gabriele Fici, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
  On the Impact of Morphisms on BWT-Runs. CPM 2023: 10:1-10:18
• 
  Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba:
  Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. CPM 2023: 11:1-11:20
• 
  Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
  Order-Preserving Squares in Strings. CPM 2023: 13:1-13:19
• 
  Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
  Compressed Indexing for Consecutive Occurrences. CPM 2023: 12:1-12:22
• 
  Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung:
  MUL-Tree Pruning for Consistency and Compatibility. CPM 2023: 14:1-14:18
• 
  Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
  Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM 2023: 15:1-15:15
• 
  Sung-Hwan Kim, Francisco Olivares, Nicola Prezza:
  Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CPM 2023: 16:1-16:16
• 
  Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag:
  On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18
• 
  Dominik Köppl:
  Encoding Hard String Problems with Answer Set Programming. CPM 2023: 17:1-17:21
• 
  Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia:
  String Factorization via Prefix Free Families. CPM 2023: 19:1-19:10
• 
  Gregory Kucherov, Steven Skiena:
  Improving the Sensitivity of MinHash Through Hash-Value Analysis. CPM 2023: 20:1-20:12
• 
  Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba:
  Suffix-Prefix Queries on a Dictionary. CPM 2023: 21:1-21:20
• 
  Gene Myers:
  Merging Sorted Lists of Similar Strings. CPM 2023: 22:1-22:15
• 
  Shinya Nagashita, Tomohiro I:
  PalFM-Index: FM-Index for Palindrome Pattern Matching. CPM 2023: 23:1-23:15
• 
  Gonzalo Navarro:
  Computing MEMs on Repetitive Text Collections. CPM 2023: 24:1-24:17
• 
  Gonzalo Navarro, Cristian Urbina:
  L-Systems for Measuring Repetitiveness. CPM 2023: 25:1-25:17
• 
  Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie:
  MONI Can Find k-MEMs. CPM 2023: 26:1-26:14
• 
  Front Matter, Table of Contents, Preface, Conference Organization. CPM 2023: 0:1-0:16
• 
  Laurent Bulteau, Zsuzsanna Lipták:
  34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. LIPIcs 259, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-276-1 [contents]