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

• 1991
• 
  David J. Evans, W. S. Yousif:
  A note on solving the fourth order parabolic equation by the age method. Int. J. Comput. Math. 40(1-2): 93-97 (1991)
• 
  Peter R. J. Asveld, Jan Anne Hogendorp:
  On the generating power of regularly controlled bidirectional grammars. Int. J. Comput. Math. 40(1-2): 75-91 (1991)
• 
  Rabindra N. Banerjee, Maurice W. Benson:
  An approximate inverse based multigrid approach to the biharmonic problem. Int. J. Comput. Math. 40(3-4): 201-210 (1991)
• 
  M. M. Chawla, Kalpdrum Passi:
  On recursive decoupling method for solving tridiagonal linear systems. Int. J. Comput. Math. 40(3-4): 239-244 (1991)
• 
  Marnix Van Daele, Hans E. De Meyer, Guido Vanden Berghe:
  A modified numerov integration method for general second order initial value Problems. Int. J. Comput. Math. 40(1-2): 117-127 (1991)
• 
  T. M. El-Gindy, A. B. Shamardan:
  The optimal choice of the θ-parameter in the three-level time schemes. Int. J. Comput. Math. 40(3-4): 221-229 (1991)
• 
  Moawwad E. A. El-Mikkawy:
  A better approach for the derivation of the embedded runge-kutta-nystrom pair of orders 6 and 4. Int. J. Comput. Math. 40(3-4): 245-249 (1991)
• 
  Stephen E. Eldridge:
  A faster modular multiplication algorithm. Int. J. Comput. Math. 40(1-2): 63-68 (1991)
• 
  Masami Ito, Masashi Katsura:
  Context-free languages consisting of non-primitive words. Int. J. Comput. Math. 40(3-4): 157-167 (1991)
• 
  L. Jódar, J. L. Morera, E. Navarro:
  On convergent linear multistep matrix methods. Int. J. Comput. Math. 40(3-4): 211-219 (1991)
• 
  Helmut Jürgensen, S. S. Yu:
  Relations on free monoids, their independent sets, and codes. Int. J. Comput. Math. 40(1-2): 17-46 (1991)
• 
  Çetin Kaya Koç:
  High-radix and bit recoding techniques for modular exponentiation. Int. J. Comput. Math. 40(3-4): 139-156 (1991)
• 
  Çetin Kaya Koç, Guanrong Chen:
  Parallel algorithms for nevanlinna-pick interpolation: the scalar case. Int. J. Comput. Math. 40(1-2): 99-115 (1991)
• 
  Mark Levene, George Loizou:
  A domain theoretic characterisation of the universal relation. Int. J. Comput. Math. 40(1-2): 69-74 (1991)
• 
  Miao-Tsong Lin, Shian-Shyong Tseng:
  Some results of the relocation problems with processing times and deadlines. Int. J. Comput. Math. 40(1-2): 1-15 (1991)
• 
  H. Nasr, H. M. El-Hawary:
  A chebyshev method for the solution of boundary value problems. Int. J. Comput. Math. 40(3-4): 251-258 (1991)
• 
  Yi Pan:
  An improved election algorithm in chordal ring networks. Int. J. Comput. Math. 40(3-4): 191-200 (1991)
• 
  Nageswara S. V. Rao, R. Sridhar, S. S. Iyengar:
  An set refinement algorithm with applications. Int. J. Comput. Math. 40(3-4): 129-138 (1991)
• 
  Dietmar Wätjen:
  Restriction of active symbols in k-limited etol systems and a normal form theorem. Int. J. Comput. Math. 40(1-2): 47-62 (1991)
• 
  JiaWang Wei, Zezeng Zhang:
  Convergence of chaotic iterative least fixed point computations. Int. J. Comput. Math. 40(3-4): 232-238 (1991)
• 
  Xin Yao:
  Simulated annealing with extended neighbourhood. Int. J. Comput. Math. 40(3-4): 169-189 (1991)