The following pages link to Ellis Horowitz (Q1214236):
Displaying 22 items.
- A fast method for interpolation using preconditioning (Q1214237) (← links)
- The efficient calculation of powers of polynomials (Q1393926) (← links)
- A unified view of the complexity of evaluation and interpolation (Q2561457) (← links)
- Concurrent communication and synchronization mechanisms (Q3040493) (← links)
- A linear time approximation algorithm for multiprocessor scheduling (Q3048240) (← links)
- (Q3334953) (← links)
- Divide-and-Conquer for Parallel Processing (Q3659129) (← links)
- (Q3885184) (← links)
- (Q3919054) (← links)
- (Q4023843) (← links)
- (Q4035352) (← links)
- On Computing the Exact Determinant of Matrices with Polynomial Entries (Q4045512) (← links)
- The Computation of Powers of Symbolic Polynomials (Q4069695) (← links)
- A Sorting Algorithm for Polynomial Multiplication (Q4080722) (← links)
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors (Q4095869) (← links)
- Computing Partitions with Applications to the Knapsack Problem (Q4096145) (← links)
- (Q4125771) (← links)
- Abstract data types and software validation (Q4168047) (← links)
- Combinatorial Problems: Reductibility and Approximation (Q4170233) (← links)
- (Q4195901) (← links)
- (Q4302402) (← links)
- The Minimum Root Separation of a Polynomial (Q4404316) (← links)