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

• 2004
• 
  Alok Aggarwal, Youngcheul Wee:
  On the symmetric angle-restricted nearest neighbor problem. Inf. Process. Lett. 92(3): 121-126 (2004)
• 
  Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
  Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92(2): 89-94 (2004)
• 
  Eberhard Bertsch, Mark-Jan Nederhof:
  Fast parallel recognition of LR language suffixes. Inf. Process. Lett. 92(5): 225-229 (2004)
• 
  Byron L. D. Bezerra, Francisco de A. T. de Carvalho:
  A symbolic approach for content-based information filtering. Inf. Process. Lett. 92(1): 45-52 (2004)
• 
  Ayelet Butman, Revital Eres, Gad M. Landau:
  Scaled and permuted string matching. Inf. Process. Lett. 92(6): 293-297 (2004)
• 
  Jin-yi Cai, Robert A. Threlfall:
  A note on quadratic residuosity and UP. Inf. Process. Lett. 92(3): 127-131 (2004)
• 
  Cezar Câmpeanu, Sheng Yu:
  Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004)
• 
  Ku-Young Chang, Howon Kim, Ju-Sung Kang, Hyun Sook Cho:
  An extension of TYT algorithm for GF((2n)m) using precomputation. Inf. Process. Lett. 92(5): 231-234 (2004)
• 
  Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
  The super laceability of the hypercubes. Inf. Process. Lett. 92(1): 15-21 (2004)
• 
  Yu-Wei Chen:
  An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services. Inf. Process. Lett. 92(6): 299-302 (2004)
• 
  King Sing Cheung:
  New characterization for live and reversible augmented marked graphs. Inf. Process. Lett. 92(5): 239-243 (2004)
• 
  Sharon A. Curtis:
  Darts and hoopla board design. Inf. Process. Lett. 92(1): 53-56 (2004)
• 
  George Davie:
  Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. Inf. Process. Lett. 92(3): 157-160 (2004)
• 
  Benjamin Doerr:
  Global roundings of sequences. Inf. Process. Lett. 92(3): 113-116 (2004)
• 
  Daniel J. Dougherty, Stanley M. Selkow:
  The complexity of the certification of properties of Stable Marriage. Inf. Process. Lett. 92(6): 275-277 (2004)
• 
  Donglei Du:
  Optimal preemptive semi-online scheduling on two uniform processors. Inf. Process. Lett. 92(5): 219-223 (2004)
• 
  Eyas El-Qawasmeh:
  Word prediction using a clustered optimal binary search tree. Inf. Process. Lett. 92(5): 257-265 (2004)
• 
  Lars Engebretsen:
  Simplified tight analysis of Johnson's algorithm. Inf. Process. Lett. 92(4): 207-210 (2004)
• 
  S. Fossé, Gwénaël Richomme:
  Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. 92(2): 77-82 (2004)
• 
  John Hershberger:
  Kinetic collision detection with fast flight plan changes. Inf. Process. Lett. 92(6): 287-291 (2004)
• 
  Garth Isaak, Darren A. Narayan:
  A classification of tournaments having an acyclic tournament as a minimum feedback arc set. Inf. Process. Lett. 92(3): 107-111 (2004)
• 
  Kuen-Fang Jea, Ming-Yuan Chang, Ke-Chung Lin:
  An efficient and flexible algorithm for online mining of large itemsets. Inf. Process. Lett. 92(6): 311-316 (2004)
• 
  Heum-Geun Kang, Jun-Ki Min, Seok-Ju Chun, Chin-Wan Chung:
  A compression method for prefix-sum cubes. Inf. Process. Lett. 92(2): 99-105 (2004)
• 
  Owen Kaser:
  Compressing arrays by ordering attribute values. Inf. Process. Lett. 92(5): 253-256 (2004)
• 
  Mohammod Abul Kashem, M. Ziaur Rahman:
  An optimal parallel algorithm for c-vertex-ranking of trees. Inf. Process. Lett. 92(4): 179-184 (2004)
• 
  Irit Katriel:
  On the algebraic complexity of set equality and inclusion. Inf. Process. Lett. 92(4): 175-178 (2004)
• 
  Ilia Krasikov, Steven D. Noble:
  Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3): 117-119 (2004)
• 
  Maciej Kurowski:
  A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Inf. Process. Lett. 92(2): 95-98 (2004)
• 
  Jens Lechtenbörger:
  Computing unique canonical covers for simple FDs via transitive reduction. Inf. Process. Lett. 92(4): 169-174 (2004)
• 
  Bruce E. Litow, Narsingh Deo:
  Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004)

skipping 20 more matches