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

• 1997
• 
  Sarmad Abbasi, Anirvan Sengupta:
  An O(n log n) Algorithm for Finding Dissimilar Strings. Inf. Process. Lett. 62(3): 135-139 (1997)
• 
  Amihood Amir, Emanuel Dar:
  An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. Inf. Process. Lett. 62(2): 95-101 (1997)
• 
  Eric Bach:
  The Complexity of Number-Theoretic Constants. Inf. Process. Lett. 62(3): 145-152 (1997)
• 
  Feng Bao, Aohan Mei, Yoshihide Igarashi:
  Average Competitive Ratios of On-Line Spanning Trees. Inf. Process. Lett. 62(4): 213-216 (1997)
• 
  Fabrice Bouquet, Philippe Jégou:
  Using OBDDs to Handle Dynamic Constraints. Inf. Process. Lett. 62(3): 111-120 (1997)
• 
  Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide:
  Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997)
• 
  Assef Chmeiss, Philippe Jégou:
  A Generalization of Chordal Graphs and the Maximum Clique Problem. Inf. Process. Lett. 62(2): 61-66 (1997)
• 
  Felipe Cucker, Pascal Koiran, Martín Matamala:
  Complexity and Dimension. Inf. Process. Lett. 62(4): 209-212 (1997)
• 
  Guozhu Dong, Chaoyi Pang:
  Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions. Inf. Process. Lett. 62(4): 193-199 (1997)
• 
  Andreas Döring, Wolfgang J. Paul:
  Decimal Adjustment of Long Numbers in Constant Time. Inf. Process. Lett. 62(3): 161-163 (1997)
• 
  David Eppstein:
  Dynamic Connectivity in Digital Images. Inf. Process. Lett. 62(3): 121-126 (1997)
• 
  Wan J. Fokkink:
  Unification for Infinite Sets of Equations Between Finite Terms. Inf. Process. Lett. 62(4): 183-188 (1997)
• 
  Anna Formica, Michele Missikoff:
  A Verification Algorithm for Inheritance Hierarchies in Object-Oriented Databases. Inf. Process. Lett. 62(5): 269-279 (1997)
• 
  Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier:
  An O(n) Time Algorithm for Maximum Matching in P₄-Tidy Graphs. Inf. Process. Lett. 62(6): 281-287 (1997)
• 
  Anna Gál:
  A Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. 62(1): 13-16 (1997)
• 
  Manolis Gergatsoulis:
  Unfold/fold Transformations for Disjunctive Logic Programs. Inf. Process. Lett. 62(1): 23-29 (1997)
• 
  Robert Glück, Andrei V. Klimov:
  A Regeneration Scheme for Generating Extensions. Inf. Process. Lett. 62(3): 127-134 (1997)
• 
  James W. Gray III:
  On the Clark-Jacob Version of SPLICE/AS. Inf. Process. Lett. 62(5): 251-254 (1997)
• 
  Qian-Ping Gu, Shietung Peng:
  Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62(4): 201-207 (1997)
• 
  Vesa Halava, Tero Harju, Lucian Ilie:
  On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997)
• 
  Rabah Harbane, Carles Padró:
  Spanners of de Bruijn and Kautz Graphs. Inf. Process. Lett. 62(5): 231-236 (1997)
• 
  Rabah Harbane, Carles Padró:
  Spanners of Underlying Graphs of Iterated Line Digraphs. Inf. Process. Lett. 62(5): 245-250 (1997)
• 
  Montserrat Hermo:
  Compressibility and Uniform Complexity. Inf. Process. Lett. 62(5): 259-264 (1997)
• 
  Shoichi Hirose, Katsuo Ikeda:
  A Conference Key Distribution System for the Star Configuration Based on the Discrete Logarithm Problem. Inf. Process. Lett. 62(4): 189-192 (1997)
• 
  Gabriel Istrate:
  The Strong Equivalence of ET0L Grammars. Inf. Process. Lett. 62(4): 171-176 (1997)
• 
  H. V. Jagadish:
  Analysis of the Hilbert Curve for Representing Two-Dimensional Space. Inf. Process. Lett. 62(1): 17-22 (1997)
• 
  Jacques Justin, Giuseppe Pirillo:
  On Some Factorizations of Infinite Words by Elements of Codes. Inf. Process. Lett. 62(6): 289-294 (1997)
• 
  Hee-Joong Kang, Kawon Kim, Jin Hyung Kim:
  Approximating Optimally Discrete Probability Distribution with kth-Order Dependency for Combining Multiple Decisions. Inf. Process. Lett. 62(2): 67-75 (1997)
• 
  Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
  Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997)
• 
  Burghard von Karger, Rudolf Berghammer:
  Computing Kernels in Directed Bichromatic Graphs. Inf. Process. Lett. 62(1): 5-11 (1997)

skipping 21 more matches