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

• 1992
• 
  Basem S. Attili:
  A direct method for the characterization and computation of bifurcation points with corank 2. Computing 48(2): 149-159 (1992)
• 
  Marida Bertocchi, Luca Brandolini, Leszek Slominski, J. Sobczynska:
  A Monte-Carlo approach for 0-1 programming problems. Computing 48(3-4): 259-274 (1992)
• 
  Dario Bini, Victor Y. Pan:
  Practical improvement of the divide-and-conquer eigenvalue algorithms. Computing 48(1): 109-123 (1992)
• 
  Valérie Brasey:
  A half-explicit Runge-Kutta method of order 5 for solving constrained mechanical systems. Computing 48(2): 191-201 (1992)
• 
  Craig C. Douglas, Jan Mandel:
  An abstract theory for the domain reduction method. Computing 48(1): 73-96 (1992)
• 
  George J. Fix, Rangachary Kannan:
  A random direction algorithm for an intersection problem. Computing 48(3-4): 381-385 (1992)
• 
  Wolfgang Händler:
  A multiprocessor working as a Fault-Tolerant cellular automaton. Computing 48(1): 5-20 (1992)
• 
  Rong-Qing Jia, Charles A. Micchelli:
  Using the refinement equation for the construction of pre-wavelets V: Extensibility of trigonometric polynomials. Computing 48(1): 61-72 (1992)
• 
  Ferenc Kálovics:
  A reliable method for solving nonlinear systems of equations of few variables. Computing 48(3-4): 291-302 (1992)
• 
  Daniel W. Lozier, Peter R. Turner:
  Robust parallel computation in floating-point and SLI arithmetic. Computing 48(3-4): 239-257 (1992)
• 
  Günter Mayer:
  Some remarks on two interval-arithmetic modifications of the newton method. Computing 48(1): 125-128 (1992)
• 
  Glen S. Miranker:
  Titan III supercomputer architectural overview. Computing 48(1): 39-59 (1992)
• 
  Rossana Morandi:
  A blending function method with interior constraints. Computing 48(3-4): 373-380 (1992)
• 
  Igor Moret:
  A projection method for computing turning points of nonlinear equations. Computing 48(2): 133-147 (1992)
• 
  Harry Munack:
  On global optimization using interval arithmetic. Computing 48(3-4): 319-336 (1992)
• 
  N. Muthiyalu, S. Usha:
  Eigenvalues of centrosymmetric matrices. Computing 48(2): 213-218 (1992)
• 
  John K. Reid:
  The advantages of Fortran 90. Computing 48(3-4): 219-238 (1992)
• 
  Günter Rote:
  The convergence rate of the sandwich algorithm for approximating convex functions. Computing 48(3-4): 337-361 (1992)
• 
  Jochen W. Schmidt:
  Constrained smoothing of histograms by quadratic splines. Computing 48(1): 97-107 (1992)
• 
  Jochen W. Schmidt:
  Positive, monotone, andS-convexC¹-interpolation on rectangular grids. Computing 48(3-4): 363-371 (1992)
• 
  Raghu Shankar, Daniel P. Miranker:
  Credible execution of bounded-time parallel systems with delayed diagnosis. Computing 48(1): 21-37 (1992)
• 
  H. W. Stolle, Raimond Strauss:
  On the numerical integration of certain singular integrals. Computing 48(2): 177-189 (1992)
• 
  Heru Suhartanto, Wayne H. Enright:
  Detecting and locating a singular point in the numerical solution of IVPs for ODEs. Computing 48(2): 161-175 (1992)
• 
  Dusan Surla, Milos Rackovic:
  The application of ψ-transform for determining a near-optimal path in the presence of polyhedral obstacles. Computing 48(2): 203-212 (1992)
• 
  Guo-Jin Wang:
  Generating NURBS curves by envelopes. Computing 48(3-4): 275-289 (1992)
• 
  Barry E. Willner, Hung-Jen Chang, John Foy:
  Willard Graphs. Computing 48(1): 129-130 (1992)
• 
  Yi Xiao, Fangjun Zhou:
  Nonmonotone trust region methods with curvilinear path in unconstrained optimization. Computing 48(3-4): 303-317 (1992)