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

• 2001
• 
  Vicki L. Almstrum, David Gries:
  From the Editors of this special issue. Inf. Process. Lett. 77(2-4): 49-51 (2001)
• 
  Andris Ambainis:
  On learning formulas in the limit and with assurance. Inf. Process. Lett. 77(1): 9-11 (2001)
• 
  James H. Anderson, Mark Moir, Srikanth Ramamurthy:
  A simple proof technique for priority-scheduled systems. Inf. Process. Lett. 77(2-4): 63-70 (2001)
• 
  Esther M. Arkin, Refael Hassin, Maxim Sviridenko:
  Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001)
• 
  Roland Carl Backhouse, Maarten M. Fokkinga:
  The associativity of equivalence and the Towers of Hanoi problem. Inf. Process. Lett. 77(2-4): 71-76 (2001)
• 
  Jean-Marie Le Bars:
  The 0-1 law fails for monadic existential second-order logic on undirected graphs. Inf. Process. Lett. 77(1): 43-48 (2001)
• 
  Lex Bijlsma:
  Model-based specification. Inf. Process. Lett. 77(2-4): 77-84 (2001)
• 
  D. W. Braben:
  Bucking the trends. Inf. Process. Lett. 77(2-4): 85-87 (2001)
• 
  Vicent Cholvi, Pablo Boronat:
  A minimal property for characterizing deadlock-free programs. Inf. Process. Lett. 77(5-6): 283-290 (2001)
• 
  Edsger W. Dijkstra:
  Under the spell of Leibniz's dream. Inf. Process. Lett. 77(2-4): 53-61 (2001)
• 
  W. H. J. Feijen:
  The joy of formula manipulation. Inf. Process. Lett. 77(2-4): 89-96 (2001)
• 
  Cormac Flanagan, Rajeev Joshi, K. Rustan M. Leino:
  Annotation inference for modular checkers. Inf. Process. Lett. 77(2-4): 97-108 (2001)
• 
  Mohamed G. Gouda:
  Elements of security: Closure, convergence, and protection. Inf. Process. Lett. 77(2-4): 109-114 (2001)
• 
  Michelangelo Grigni:
  A Sperner lemma complete for PPA. Inf. Process. Lett. 77(5-6): 255-259 (2001)
• 
  Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
  On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77(1): 1-7 (2001)
• 
  Frank Harary, Vladik Kreinovich, Luc Longpré:
  A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77(5-6): 277-282 (2001)
• 
  Ted Herman, Toshimitsu Masuzawa:
  Available stabilizing heaps. Inf. Process. Lett. 77(2-4): 115-121 (2001)
• 
  C. A. R. Hoare:
  Legacy. Inf. Process. Lett. 77(2-4): 123-129 (2001)
• 
  H. Peter Hofstee, Jun Sawada:
  Derivation of a rotator circuit with homogeneous interconnect. Inf. Process. Lett. 77(2-4): 131-135 (2001)
• 
  Rob R. Hoogerwoord:
  Formality works. Inf. Process. Lett. 77(2-4): 137-142 (2001)
• 
  Jerry James, Ambuj K. Singh:
  Recovering distributed objects. Inf. Process. Lett. 77(2-4): 143-150 (2001)
• 
  Anne Kaldewaij, Laurens de Vries:
  Optimal real-time garbage collection for acyclic pointer structures. Inf. Process. Lett. 77(2-4): 151-157 (2001)
• 
  Hiroyuki Kawai, Naohiro Fujikake, Yukio Shibata:
  Factorization of de Bruijn digraphs by cycle-rooted trees. Inf. Process. Lett. 77(5-6): 269-275 (2001)
• 
  William Leal, Anish Arora:
  State-level and value-level simulations in data refinement. Inf. Process. Lett. 77(2-4): 159-167 (2001)
• 
  K. Rustan M. Leino:
  Real estate of names. Inf. Process. Lett. 77(2-4): 169-171 (2001)
• 
  Xuandong Li, Johan Lilius:
  Efficient verification of a class of time Petri nets using linear programming. Inf. Process. Lett. 77(5-6): 219-224 (2001)
• 
  Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
  The shuffle-cubes and their generalization. Inf. Process. Lett. 77(1): 35-41 (2001)
• 
  Panagiotis Manolios, J Strother Moore:
  On the desirability of mechanizing calculational proofs. Inf. Process. Lett. 77(2-4): 173-179 (2001)
• 
  Carlos Martín-Vide, Victor Mitrana:
  Some undecidable problems for parallel communicating finite automata systems. Inf. Process. Lett. 77(5-6): 239-245 (2001)
• 
  Alain J. Martin:
  Towards an energy complexity of computation. Inf. Process. Lett. 77(2-4): 181-187 (2001)

skipping 12 more matches