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

• 1989
• 
  Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman:
  A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30(4): 205-208 (1989)
• 
  Ronald E. Barkley, T. Paul Lee:
  Point Representation and Hashing of an Interval. Inf. Process. Lett. 30(4): 201-203 (1989)
• 
  Peter van Emde Boas:
  Space Measures for Storage Modification Machines. Inf. Process. Lett. 30(2): 103-110 (1989)
• 
  P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar:
  Increasing Search Efficiency Using Multiple Heuristics. Inf. Process. Lett. 30(1): 33-36 (1989)
• 
  Houssine Chetto, Maryline Silly-Chetto:
  Scheduling Periodic and Sporadic Tasks in a Real-Time System. Inf. Process. Lett. 30(4): 177-184 (1989)
• 
  Hock T. Ch'ng, B. Sprinivasan, Beng Chin Ooi:
  Study of Self-Organizing Heuristics for Skewed Access Patterns. Inf. Process. Lett. 30(5): 237-244 (1989)
• 
  Charles Consel, Olivier Danvy:
  Partial Evaluation of Pattern Matching in Strings. Inf. Process. Lett. 30(2): 79-86 (1989)
• 
  Joseph C. Culberson, Piotr Rudnicki:
  A Fast Algorithm for Constructing Trees from Distance Matrices. Inf. Process. Lett. 30(4): 215-220 (1989)
• 
  Karel Culík II:
  Variations of the Firing Squad Problem and Applications. Inf. Process. Lett. 30(3): 153-157 (1989)
• 
  Philippe Darondeau:
  Bisimulation and Effectiveness. Inf. Process. Lett. 30(1): 19-20 (1989)
• 
  E. M. Ehlers, Sebastiaan H. von Solms:
  Using Random Context Structure Grammars to Represent Chemical Structures. Inf. Process. Lett. 30(3): 159-166 (1989)
• 
  Rudolf Fleischer:
  Communication Complexity of Multi-Processor Systems. Inf. Process. Lett. 30(2): 57-65 (1989)
• 
  M. J. Foster, Ronald I. Greenberg:
  Lower Bounds on the Area of Finite-State Machines. Inf. Process. Lett. 30(1): 1-7 (1989)
• 
  Zvi Galil, Victor Y. Pan:
  Parallel Evaluation of the Determinant and of the Inverse of a Matrix. Inf. Process. Lett. 30(1): 41-45 (1989)
• 
  Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi:
  There are no p-Complete Families of Symmetric Boolean Functions. Inf. Process. Lett. 30(1): 47-49 (1989)
• 
  Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks:
  Bit Complexity of Order Statistics on a Distributed Star Network. Inf. Process. Lett. 30(3): 127-132 (1989)
• 
  Dan Gusfield, Robert W. Irving:
  Parametric Stable Marriage and Minimum Cuts. Inf. Process. Lett. 30(5): 255-259 (1989)
• 
  Eric C. R. Hehner:
  Real-Time Programming. Inf. Process. Lett. 30(1): 51-56 (1989)
• 
  Oscar H. Ibarra, Tao Jiang:
  Optimal Simulation of Tree Arrays by Linear Arrays. Inf. Process. Lett. 30(6): 295-302 (1989)
• 
  Toshiya Itoh, Shigeo Tsujii:
  An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). Inf. Process. Lett. 30(3): 111-114 (1989)
• 
  Matti O. Jokinen:
  Customizable Garbage Collectors. Inf. Process. Lett. 30(3): 115-118 (1989)
• 
  Udo Kelter:
  The Pitfall Paradox and its Solution with Virtual Objects. Inf. Process. Lett. 30(3): 139-143 (1989)
• 
  June H. Kim, Kyu Ho Park, Myunghwan Kim:
  A Model of Distributed Control: Dependency and Uncertainty. Inf. Process. Lett. 30(2): 73-77 (1989)
• 
  Ludek Kucera:
  Graphs with Small Chromatic Numbers are Easy to Color. Inf. Process. Lett. 30(5): 233-236 (1989)
• 
  Christian Lavault:
  Average Number of Messages for Distributed Leader-Finding in Rings of Processors. Inf. Process. Lett. 30(4): 167-176 (1989)
• 
  G. Lindhorst, Farhad Shahrokhi:
  On Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 30(6): 289-293 (1989)
• 
  Andrzej Lingas, Marek Karpinski:
  Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. Inf. Process. Lett. 30(1): 27-32 (1989)
• 
  Aldo de Luca, Stefano Varricchio:
  Factorial Languages Whose Growth Function is Quadratically Upper Bounded. Inf. Process. Lett. 30(6): 283-288 (1989)
• 
  Charles U. Martel, Dan Gusfield:
  A Fast Parallel Quicksort Algorithm. Inf. Process. Lett. 30(2): 97-102 (1989)
• 
  Friedemann Mattern:
  Global Quiescence Detection Based on Credit Distribution and Recovery. Inf. Process. Lett. 30(4): 195-200 (1989)

skipping 22 more matches