J. F. Traub - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

1997

Do negative results from formal systems limit scientific knowledge?J. F. Traub. complexity, 3(1):29-31, 1997. [doi]

1991

Information-Based Complexity: Recent Results and Open ProblemsJ. F. Traub. fct 1991: 86-88

1983

Meeting the Crisis in Computer ScienceStephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler. Computer, 16(12):83-87, 1983.

Meeting the Crisis in Comuter ScienceStephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler. CACM, 26(12):1046-1050, 1983.

1981

A Discipline in CrisisPeter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, J. F. Traub. CACM, 24(6):370-374, 1981.

Quo Vadimus: Computer Science in a DecadeJ. F. Traub. CACM, 24(6):351-369, 1981.

1980

On the Complexity of Composition and Generalized Composition of Power SeriesRichard P. Brent, J. F. Traub. SICOMP, 9(1):54-66, 1980.

1978

All Algebraic Functions Can Be Computed FastH. T. Kung, J. F. Traub. JACM, 25(2):245-260, 1978. [doi]

1977

Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative EvaluationMary Shaw, J. F. Traub. ipl, 6(5):141-145, 1977.

1976

Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel ComputersD. E. Heller, D. K. Stevenson, J. F. Traub. JACM, 23(4):636-654, 1976. [doi]

1975

Principles for Testing Polynomial Zerofinding ProgramsMichael A. Jenkins, J. F. Traub. TOMS, 1(1):26-34, 1975. [doi]

1974

Optimal Order of One-Point and Multipoint IterationH. T. Kung, J. F. Traub. JACM, 21(4):643-651, 1974. [doi]

On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its DerivativesMary Shaw, J. F. Traub. JACM, 21(1):161-167, 1974. [doi]

Parallel Algorithms and Parallel Comnputational ComplexityJ. F. Traub. ifip 1974: 685-687

1972

Zeros of a Complex Polynomial [C2] (Algorithm 419)Michael A. Jenkins, J. F. Traub. CACM, 15(2):97-99, 1972.

On the Number of Multiplications for the Evaluation of a Polynomial and All Its DerivativesMary Shaw, J. F. Traub. focs 1972: 105-107

Computational Complexity of Iterative ProcessJ. F. Traub. SICOMP, 1(2):167-179, 1972.

Numerical Mathematics and Computer ScienceJ. F. Traub. CACM, 15(7):537-541, 1972.

1971

On Euclid s Algorithm and the Theory of SubresultantsW. S. Brown, J. F. Traub. JACM, 18(4):505-514, 1971. [doi]

Optimal Iterative Processes: Theorems and ConjecturesJ. F. Traub. ifip 1971: 1273-1277

1969

MERCURY: H system for the computer-aided distribution of technical reportsW. S. Brown, J. F. Traub. JACM, 16(1):13-25, 1969. [doi]

1964

The new program of work for the international standard vocabulary in computers and information processingJ. F. Traub. CACM, 7(11):662, 1964. [doi]

1963

USA participation in an international standard glossary on information processingJ. F. Traub. CACM, 6(11):658-659, 1963. [doi]

1962

IFIP-62: CommentsJ. F. Traub. CACM, 5(10):500-501, 1962. [doi]

1961

On a class of iteration formulas and some historical notesJ. F. Traub. CACM, 4(6):276-278, 1961. [doi]

1960

Comments on A New Method of Computation of Square Roots Without Using Division J. F. Traub. CACM, 3(2):86, 1960. [doi]

Sign in or sign up to see more results.

runs on WebDSL