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

• 1987
• 
  Ian F. Akyildiz:
  Mean value analysis of closed queueing networks with Erlang service time distributions. Computing 39(3): 219-232 (1987)
• 
  Götz Alefeld:
  Über die Konvergenzordnung des Intervall-Newton-Verfahrens. Computing 39(4): 363-369 (1987)
• 
  Giampietro Allasia, Renata Besenghi:
  Numerical computation of Tricomi's psi function by the trapezoidal rule. Computing 39(3): 271-279 (1987)
• 
  Semih Bilgen, Z. Seyda Deligönül:
  Weibull renewal equation solution. Computing 39(1): 71-76 (1987)
• 
  J. Hartmut Bleher, Siegfried M. Rump, Ulrich W. Kulisch, M. Metzger, Christian P. Ullrich, W. Walter:
  FORTRAN-SC a study of a FORTRAN extension for engineering/scientific computation with access to ACRITH. Computing 39(2): 93-110 (1987)
• 
  Luc Devroye:
  A simple generator for discrete log-concave distributions. Computing 39(1): 87-91 (1987)
• 
  Bernd Einfeldt:
  Ein schneller Algorithmus zur Lösung des Riemann-Problems. Computing 39(1): 77-86 (1987)
• 
  Jerry Michael Fine:
  Interpolants for Runge-Kutta-Nyström methods. Computing 39(1): 27-42 (1987)
• 
  J. B. G. Frenk, Gábor Galambos:
  Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39(3): 201-217 (1987)
• 
  J. B. G. Frenk, M. van Houweninge, Alexander H. G. Rinnooy Kan:
  Order statistics and the linear assignment problem. Computing 39(2): 165-174 (1987)
• 
  Martin Grötschel, Olaf Holland:
  A cutting plane algorithm for minimum perfect 2-matchings. Computing 39(4): 327-344 (1987)
• 
  Alain Hertz, Dominique de Werra:
  Using tabu search techniques for graph coloring. Computing 39(4): 345-351 (1987)
• 
  Jürgen Herzberger:
  Remarks on the interval version of Schulz's method. Computing 39(2): 183-186 (1987)
• 
  Jürgen Herzberger:
  On the monotonicity of the interval versions of Schulz's method II. Computing 39(4): 371-375 (1987)
• 
  Kryzstof C. Kiwiel:
  A subgradient selection method for minimizing convex functions subject to linear constraints. Computing 39(4): 293-305 (1987)
• 
  Israel Koltracht, Peter Lancaster:
  A definiteness test for Hankel matrices and their lower submatrices. Computing 39(1): 19-26 (1987)
• 
  Rudolf Krawczyk:
  Conditionally isotone interval operators. Computing 39(3): 261-270 (1987)
• 
  Thomas Lengauer, Christian Wieners:
  Efficient solutions of hierarchical systems of linear equations. Computing 39(2): 111-132 (1987)
• 
  José Mario Martínez:
  An algorithm for solving sparse Nonlinear Least Squares problems. Computing 39(4): 307-325 (1987)
• 
  Gary L. Mullen, Harald Niederreiter:
  Optimal characteristic polynomials for digital multistep pseudorandom numbers. Computing 39(2): 155-163 (1987)
• 
  Andreas Neubauer:
  Numerical realization of an optimal discrepancy principle for Tikhonov-regularization in Hilbert scales. Computing 39(1): 43-55 (1987)
• 
  Panos M. Pardalos, John H. Glick, J. Ben Rosen:
  Global minimization of indefinite quadratic problems. Computing 39(4): 281-291 (1987)
• 
  Gerd Pönisch:
  Computing hysteresis points of nonlinear equations depending on two parameters. Computing 39(1): 1-17 (1987)
• 
  Florian A. Potra:
  On a monotone Newton-like method. Computing 39(3): 233-246 (1987)
• 
  W. R. Richert:
  Implicit Runge-Kutta formulae with built-in estimates of the accumulated truncation error. Computing 39(4): 353-362 (1987)
• 
  Yves Robert, Denis Trystram:
  An orthogonal systolic array for the algebraic path problem. Computing 39(3): 187-199 (1987)
• 
  Jon G. Rokne, Paul G. Bao:
  Interval Taylor forms. Computing 39(3): 247-259 (1987)
• 
  Jochen W. Schmidt:
  An unconstrained dual program for computing convex C ¹-spline approximants. Computing 39(2): 133-140 (1987)
• 
  Josef Schneid:
  On the maximum order of optimal B-convergence of Lobatto III C schemes. Computing 39(2): 175-181 (1987)
• 
  Stefan Stefanescu, I. Vaduva:
  On computer generation of random vectors by transformations of uniformly distributed vectors. Computing 39(2): 141-153 (1987)

skipping 1 more match