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

• 2000
• 
  Joep Aerts, Jan H. M. Korst, Sebastian Egner:
  Random duplicate storage strategies for load balancing in multimedia servers. Inf. Process. Lett. 76(1-2): 51-59 (2000)
• 
  Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore:
  Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000)
• 
  Sergei Bespamyatnikh, Michael Segal:
  Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000)
• 
  Tomasz Borzyszkowski:
  Generalized interpolation in CASL. Inf. Process. Lett. 76(1-2): 19-24 (2000)
• 
  Jin-yi Cai, Ajay Nerurkar:
  A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Inf. Process. Lett. 76(1-2): 61-66 (2000)
• 
  Kuo-Liang Chung, Wen-Ming Yan:
  On the number of spanning trees of a multi-complete/star related graph. Inf. Process. Lett. 76(3): 113-119 (2000)
• 
  Francesc Comellas, Javier Ozón, Joseph G. Peters:
  Deterministic small-world communication networks. Inf. Process. Lett. 76(1-2): 83-90 (2000)
• 
  Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
  Evolutionary graph colouring. Inf. Process. Lett. 76(1-2): 91-94 (2000)
• 
  Leah Epstein:
  A note on on-line scheduling with precedence constraints on identical machines. Inf. Process. Lett. 76(4-6): 149-153 (2000)
• 
  Riccardo Focardi, Flaminia L. Luccio, David Peleg:
  Feedback vertex set in hypercubes. Inf. Process. Lett. 76(1-2): 1-5 (2000)
• 
  L. Javier García-Villalba, Amparo Fúster-Sabater:
  On the linear complexity of the sequences generated by nonlinear filterings. Inf. Process. Lett. 76(1-2): 67-73 (2000)
• 
  Erez Hartuv, Ron Shamir:
  A clustering algorithm based on graph connectivity. Inf. Process. Lett. 76(4-6): 175-181 (2000)
• 
  Akira Higuchi, Naofumi Takagi:
  A fast addition algorithm for elliptic curve arithmetic in GF(2ⁿ) using projective coordinates. Inf. Process. Lett. 76(3): 101-103 (2000)
• 
  Hyun-Sung Kim, Sung-Woo Lee, Kee-Young Yoo:
  Partitioned systolic architecture for modular multiplication in GF(2^m). Inf. Process. Lett. 76(3): 135-139 (2000)
• 
  Leslie Lamport, Sharon E. Perl, William E. Weihl:
  When does a correct mutual exclusion algorithm guarantee mutual exclusion? Inf. Process. Lett. 76(3): 131-134 (2000)
• 
  Keon-Jik Lee, Kee-Young Yoo:
  Linear systolic multiplier/squarer for fast exponentiation. Inf. Process. Lett. 76(3): 105-111 (2000)
• 
  Chu Min Li:
  Equivalency reasoning to solve a class of hard SAT problems. Inf. Process. Lett. 76(1-2): 75-81 (2000)
• 
  Lanfranco Lopriore:
  Protection in a single-address-space environment. Inf. Process. Lett. 76(1-2): 25-32 (2000)
• 
  Ho-Hyun Park, Chin-Wan Chung:
  Complexity of estimating multi-way join result sizes for area skewed spatial data. Inf. Process. Lett. 76(3): 121-129 (2000)
• 
  Florian Roussel, Irena Rusu:
  Recognizing i-triangulated graphs in O(mn) time. Inf. Process. Lett. 76(3): 141-147 (2000)
• 
  Matthias Schonlau, Martin Theus:
  Detecting masquerades in intrusion detection based on unpopular commands. Inf. Process. Lett. 76(1-2): 33-38 (2000)
• 
  Joan Serra-Sagristà:
  Enumeration of lattice points in l₁ norm. Inf. Process. Lett. 76(1-2): 39-44 (2000)
• 
  Igor E. Shparlinski:
  Linear complexity of the Naor-Reingold pseudo-random function. Inf. Process. Lett. 76(3): 95-99 (2000)
• 
  Xuehou Tan:
  On optimal bridges between two convex regions. Inf. Process. Lett. 76(4-6): 163-168 (2000)
• 
  Ryuhei Uehara, Zhi-Zhong Chen:
  Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000)
• 
  Limin Xiang, Kazuo Ushijima, Changjie Tang:
  Efficient loopless generation of Gray codes for k-ary trees. Inf. Process. Lett. 76(4-6): 169-174 (2000)
• 
  Jue Xue, Ju Liu:
  A network-flow-based lower bound for the minimum weighted integer coloring problem. Inf. Process. Lett. 76(1-2): 45-50 (2000)