Shmuel Winograd - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

1994

PrefaceShmuel Winograd, Alan J. Hoffman. ibmrd, 38(3):242-242, 1994. [doi]

1992

On the multiplicative complexity of discrete cosine transformsEphraim Feig, Shmuel Winograd. TIT, 38(4):1387, 1992.

Fast algorithms for the discrete cosine transformEphraim Feig, Shmuel Winograd. tsp, 40(9):2174-2193, 1992. [doi]

1991

Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>Amir Averbuch, Zvi Galil, Shmuel Winograd. TCS, 86(2):143-203, 1991.

1990

Matrix Multiplication via Arithmetic ProgressionsDon Coppersmith, Shmuel Winograd. JSC, 9(3):251-280, 1990.

1988

Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1Amir Averbuch, Zvi Galil, Shmuel Winograd. TCS, 58:17-56, 1988.

1987

Matrix Multiplication via Arithmetic ProgressionsDon Coppersmith, Shmuel Winograd. stoc 1987: 1-6

1986

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a PolynomialAmir Averbuch, Shmuel Winograd, Zvi Galil. icalp 1986: 31-39

1985

A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access ChannelsAlbert G. Greenberg, Shmuel Winograd. JACM, 32(3):589-596, July 1985. [doi]

Computing the ambiguity surfaceRichard Tolimieri, Shmuel Winograd. tsp, 33(5):1239-1245, 1985. [doi]

1983

On the Complexity of Multiplication in Finite FieldsAbraham Lempel, Gadiel Seroussi, Shmuel Winograd. TCS, 22:285-296, 1983.

1982

On the Asymptotic Complexity of Matrix MultiplicationDon Coppersmith, Shmuel Winograd. SICOMP, 11(3):472-492, 1982.

1981

On the use of filter design programs for generating spectral windowsJames W. Cooley, Shmuel Winograd. icassp 1981: 394-396 [doi]

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)Don Coppersmith, Shmuel Winograd. focs 1981: 82-90

On the Direct Sum Conjecture (Extended Summary)Ephraim Feig, Shmuel Winograd. focs 1981: 91-94

Algebraic constructions for algorithms (Extended Abstract)Shmuel Winograd. issac 1981: 142-145 [doi]

1980

A limited range discrete Fourier transform algorithmJames W. Cooley, Shmuel Winograd. icassp 1980: 213-217 [doi]

On Multiplication of Polynomials Modulo a PolynomialShmuel Winograd. SICOMP, 9(2):225-229, 1980.

Signal processing and complexity of computationShmuel Winograd. icassp 1980: 94-101 [doi]

1979

On Multiplication in Algebraic Extension FieldsShmuel Winograd. TCS, 8:359-377, 1979.

1978

TDM-FDM Conversion Requiring Reduced Computation ComplexityAbraham Peled, Shmuel Winograd. tcom, 26(5):707-719, 1978. [doi]

Complexity Of ComputationsShmuel Winograd. acm 1978: 138-141 [doi]

1977

A new approach to error-correcting codesAbraham Lempel, Shmuel Winograd. TIT, 23(4):503-508, 1977. [doi]

Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of ConstantsShmuel Winograd. mst, 10:169-180, 1977.

1975

The Effect of the Field of Constants on the Number of MultiplicationShmuel Winograd. focs 1975: 1-2

On the Parallel Evaluation of Certain Arithmetic ExpressionsShmuel Winograd. JACM, 22(4):477-492, 1975. [doi]

1972

Parallel Iteration MethodsShmuel Winograd. coco 1972: 53-60

1968

The number of multiplications involved in computing certain functionsShmuel Winograd. ifip 1968: 276-279

A New Algorithm for Inner ProductShmuel Winograd. TC, 17(7):693-694, 1968. [doi]

1967

The Organization of Computations for Uniform Recurrence EquationsRichard M. Karp, Raymond E. Miller, Shmuel Winograd. JACM, 14(3):563-590, 1967. [doi]

On the Time Required to Perform MultiplicationShmuel Winograd. JACM, 14(4):793-802, 1967. [doi]

1966

Continuity and Realizability of Sequence TransformationsLeo Hellerman, William L. Duda, Shmuel Winograd. TC, 15(4):560-569, 1966. [doi]

Index Register AllocationL. P. Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd. JACM, 13(1):43-61, 1966. [doi]

1965

On the Time Required to Perform AdditionShmuel Winograd. JACM, 12(2):277-285, 1965. [doi]

1964

On the Number of Transitions Entering the States of a Finite AutomatonRaymond E. Miller, Shmuel Winograd. TC, 13(4):463-464, 1964. [doi]

Input-Error-Limiting AutomataShmuel Winograd. JACM, 11(3):338-351, 1964. [doi]

1963

Redundancy and Complexity of Logical ElementsShmuel Winograd. iandc, 6(3):177-194, September 1963.

1962

Multiple Input-Output Links in Computer SystemsBurton B. Tasini, Shmuel Winograd. ibmrd, 6(3):306-328, 1962. [doi]

Bounded-transient automataShmuel Winograd. focs 1962: 137-141

Coding for Logical OperationsShmuel Winograd. ibmrd, 6(4):430-436, 1962. [doi]

Sign in or sign up to see more results.

runs on WebDSL