The following pages link to Shmuel Winograd (Q915377):
Displaying 50 items.
- (Q786508) (redirect page) (← links)
- The multiplicative complexity of certain semilinear systems defined by polynomials (Q786509) (← links)
- On the direct sum conjecture (Q801142) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- The multiplicative complexity of the discrete Fourier transform (Q1060552) (← links)
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\) (Q1110328) (← links)
- Direct sums of bilinear algorithms (Q1157377) (← links)
- Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm (Q1169506) (← links)
- On the complexity of multiplication in finite fields (Q1171378) (← links)
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708) (← links)
- The optimal recovery of smooth functions (Q1229549) (← links)
- On multiplication in algebraic extension fields (Q1256512) (← links)
- On the multiplicative complexity of the discrete Fourier transform (Q1259162) (← links)
- On the algebraic complexity of inner product (Q2548858) (← links)
- On multiplication of 2 \(\times\) 2 matrices (Q2548859) (← links)
- Optimal iterative processes for root-finding (Q2557541) (← links)
- Multiple Input-Output Links in Computer Systems (Q3289378) (← links)
- (Q3309061) (← links)
- New algorithms for the multidimensional discrete Fourier transform (Q3678628) (← links)
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels (Q3765234) (← links)
- (Q3776615) (← links)
- (Q3883493) (← links)
- On Multiplication of Polynomials Modulo a Polynomial (Q3891764) (← links)
- (Q3933738) (← links)
- On the Asymptotic Complexity of Matrix Multiplication (Q3947117) (← links)
- On the multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
- Fast algorithms for the discrete cosine transform (Q4031486) (← links)
- (Q4044055) (← links)
- On computing the Discrete Fourier Transform (Q4086677) (← links)
- On the Parallel Evaluation of Certain Arithmetic Expressions (Q4091448) (← links)
- (Q4110539) (← links)
- A new approach to error-correcting codes (Q4133530) (← links)
- Some bilinear forms whose multiplicative complexity depends on the field of constants (Q4138004) (← links)
- (Q4139625) (← links)
- On Computing the Discrete Fourier Transform (Q4151723) (← links)
- A generalization of a theorem of Boolean relation matrices (Q4166859) (← links)
- (Q4401564) (← links)
- Finding All Shortest Distances in a Directed Network (Q4401749) (← links)
- (Q4775468) (← links)
- Parallel Iteration Methods (Q4999422) (← links)
- (Q5180764) (← links)
- On the rate of convergence to the neutral attractor of a family of one-dimensional maps (Q5306808) (← links)
- On the Time Required to Perform Addition (Q5330952) (← links)
- Input-Error-Limiting Automata (Q5509694) (← links)
- A FORTRAN Extension to Facilitate Proposal Preparation (Q5511411) (← links)
- Index Register Allocation (Q5530094) (← links)
- On the Time Required to Perform Multiplication (Q5557464) (← links)
- The Organization of Computations for Uniform Recurrence Equations (Q5558285) (← links)
- (Q5560016) (← links)
