Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: algorithm 857 : polsys _ glp - a parallel general linear product homotopy code for solving polynomial systems of equations .
Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms
An efficient parallel solver for SDD linear systems
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
An efficient and exact subdivision algorithm for isolating complex roots of a polynomial and its complexity analysis
Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms
Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
Generalized Cannon's algorithm for parallel matrix multiplication
A Parallel Python library for nonlinear systems
Automatic optimisation of parallel linear algebra routines in systems with variable load
Programming Parallel Algorithms
Parallel network dual simplex method on a shared memory multiprocessor
Linear-time algorithms for linear programming in R3 and related problems
A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU
Data Parallel Algorithms
Communication-optimal parallel algorithm for strassen's matrix multiplication
factoring polynomials over finite fields : a survey .
An adaptive LU factorization algorithm for parallel circuit simulation
A New Approach to Strongly Polynomial Linear Programming
Meaningful Clustering Of Senses Helps Boost Word Sense Disambiguation Performance
A Guide to Visual Multi-Level Interface Design from Synthesis of Empirical Study Evidence
A New Energy-Efficient Adaptive Clustering Protocol Based on Genetic Algorithm for Improving the Lifetime and the Stable Period of Wireless Sensor Networks
The MOS social support survey.
matrix computations ( 3 . ed . ) .