Joseph F. Traub | Academic Influence

Joseph F. Traub's AcademicInfluence.com Rankings

Joseph F. Traub

Computer Science

#808

World Rank

#836

Historical Rank

#439

USA Rank

Numerical Analysis

#21

World Rank

#22

Historical Rank

#13

USA Rank

computer-science Degrees

Joseph F. Traub

Mathematics

#1852

World Rank

#2947

Historical Rank

#749

USA Rank

Linear Algebra

#7

World Rank

#9

Historical Rank

#3

USA Rank

Measure Theory

#923

World Rank

#1207

Historical Rank

#345

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Joseph F. Traub's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics City College of New York

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Joseph F. Traub Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Joseph Frederick Traub was an American computer scientist. He was the Edwin Howard Armstrong Professor of Computer Science at Columbia University and External Professor at the Santa Fe Institute. He held positions at Bell Laboratories, University of Washington, Carnegie Mellon, and Columbia, as well as sabbatical positions at Stanford, Berkeley, Princeton, California Institute of Technology, and Technical University, Munich.

(See a Problem?)

Joseph F. Traub's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Iterative Methods for the Solution of Equations (1982) (2040)
Information-based complexity (1987) (756)
Optimal Order of One-Point and Multipoint Iteration (1974) (710)
A general theory of optimal algorithms (1980) (579)
Faster Valuation of Financial Derivatives (1995) (376)
Complexity and information (1999) (279)
On Euclid's Algorithm and the Theory of Subresultants (1971) (271)
Complexity of linear programming (1982) (198)
The statistical security of a statistical database (1984) (187)
A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration (1970) (176)
Algorithms and Complexity: New Directions and Recent Results (1976) (162)
A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration (1970) (146)
Quantum algorithm and circuit design solving the Poisson equation (2012) (132)
The Algebraic Theory of Matrix Polynomials (1976) (131)
Convergence and Complexity of Newton Iteration for Operator Equations (1979) (122)
All Algebraic Functions Can Be Computed Fast (1978) (109)
Information, Uncertainty, Complexity (1982) (104)
Faster Evaluation of Multidimensional Integrals (2000) (83)
Complexity of Sequential and Parallel Numerical Algorithms (1973) (82)
Algorithm 419: zeros of a complex polynomial [C2] (1972) (76)
Principles for Testing Polynomial Zerofinding Programs (1975) (70)
Algorithms for solvents of matrix polynomials (1978) (68)
Average Case Optimality for Linear Problems (1984) (62)
Scaling Up: A Research Agenda for Software Engineering (1989) (54)
Path Integration on a Quantum Computer (2001) (51)
A discipline in crisis (1981) (50)
Annual Review of Computer Science (1986) (49)
Computer science and mathematics (1970) (48)
Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case (2002) (47)
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives (1974) (41)
The Future of Scientific Journals (1967) (40)
Analytic Computational Complexity (1976) (40)
Iterative Methods for the Solutions of Equations (1965) (39)
Associated Polynomials and Uniform Methods for the Solution of Linear Problems (1966) (37)
Information-Based complexity: New questions for mathematicians (1991) (36)
A class of globally convergent iteration functions for the solution of polynomial equations (1966) (35)
A Continuous Model of Computation (1999) (34)
The Monte Carlo Algorithm With a Pseudorandom Generator (1992) (34)
On the Optimal Solution of Large Linear Systems (1984) (31)
Computational Complexity of Iterative Processes (1972) (26)
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers (1976) (25)
On the Complexity of Composition and Generalized Composition of Power Series (1980) (25)
Essays on the Complexity of Continuous Problems (2009) (24)
On the Matrix Polynomial, Lambda-Matrix and Block Eigenvalue Problems (1971) (24)
Theory of optimal algorithms (1973) (24)
New Results on Deterministic Pricing of Financial Derivatives (1996) (23)
Measures of quantum computing speedup (2013) (22)
Invited speaker (2018) (19)
STRICT LOWER AND UPPER BOUNDS ON ITERATIVE COMPUTATIONAL COMPLEXITY (1976) (19)
Computational Complexity of One-Point and Multipoint Iteration, (1973) (18)
The shifted QR algorithm for Hermitian matrices (1971) (17)
Annual review of computer science vol. 1, 1986 (1986) (17)
Quo Vadimus: computer science in a decade (1981) (17)
Optimal order and efficiency for iterations with two evaluations (1976) (16)
On Lagrange-Hermite Interpolation (1964) (16)
A fast algorithm for approximating the ground state energy on a quantum computer (2010) (16)
The Unknown and the Unknowable (1999) (16)
On functional iteration and the calculation of roots (1961) (15)
Comparison of iterative methods for the calculation of nth roots (1961) (15)
Iterative solution of block tridiagonal systems on parallel or vector computers (1973) (14)
Meeting the Crisis in Computer Science (1983) (14)
Complexity of approximately solved problems (1985) (13)
An introduction to some current research in numerical computational complexity (1973) (13)
Numerical mathematics and computer science (1972) (12)
Perspectives on information-based complexity (1992) (12)
On a class of iteration formulas and some historical notes (1961) (10)
Pole Assignment for Linear Periodic Systems by Memoryless Output Feedback (1995) (10)
Generalized sequences with applications to the discrete calculus (1965) (10)
Algorithms and Complexity for Continuous Problems (2012) (10)
AN ALGORITHM FOR AN AUTOMATIC GENERAL POLYNOMIAL SOLVER. (1967) (7)
On Limits (2001) (7)
Interval Analysis. Ramon E. Moore. Prentice-Hall, Englewood Cliffs, N.J., 1966. 159 pp., illus. $9 (1967) (7)
The bell laboratories numerical mathematics program library project (1968) (6)
Optimal radius of convergence of interpolatory iterations for operator equations (1980) (6)
On Reality and Models (1996) (6)
Quantum Algorithms for Continuous Problems and Their Applications (2014) (6)
Convergence and complexity of interpolatory—newton iteration in a Banach space☆ (1980) (6)
Elementary Problems: E1845-E1854 (1966) (6)
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives (1972) (6)
No Curse of Dimensionality for Contraction Fixed Points Even in the Worst Case (1999) (5)
Qubit complexity of continuous problems (2005) (5)
A brief history of information-based complexity (2009) (5)
Varieties of limits to scientific knowledge (1998) (5)
Quantum Algorithms and Complexity for Continuous Problems (2007) (5)
Optimal Iterative Processes: Theorems and Conjectures (1971) (5)
Introduction to information-based complexity (1988) (5)
When is nonadaptive information as powerful as adaptive information? (1984) (5)
Recent progress in information-based complexity (1993) (5)
Why a journal of complexity? (1985) (5)
Analysis of a Family of Algorithms for the Evaluation of a Polynomial and Some of Its Derivatives (1975) (5)
General Theory of Optimal Error Algorithms and Analytic Complexity. Part B. Iterative Information Model. (1977) (5)
ON THE nth DERIVATIVE OF THE INVERSE FUNCTION (1962) (4)
Signum Panel on the Future of Numerical Mathematics. (1971) (4)
Measures of uncertainty and information in computation (1992) (4)
Asymptotic behavior of vector recurrences with applications (1977) (4)
The calculation of zeros of polynomials and analytic functions (1967) (4)
Do negative results from formal systems limit scientific knowledge? (1997) (3)
Parallel Algorithms and Parallel Comnputational Complexity (1974) (3)
Zeros of a Complex Polynomial [C2] (Algorithm 419) (1972) (3)
Do negative results from formal systems limit scientific knowledge (1997) (3)
MERCURY: H system for the computer-aided distribution of technical reports (1969) (3)
An analysis of the shiftedLR algorithm (1971) (3)
Information-based Complexity and Information-based Optimization (2009) (3)
Invited papers: The theory of multipoint iteration functions (1962) (2)
Information and Computation (2016) (2)
Our Silver Anniversary (2009) (2)
Solution of linear difference and differential equations (1965) (2)
Numerical computations: its nature and research directions (1979) (2)
On Newton-Raphson Iteration (1967) (2)
Construction of globally convergent iteration functions for the solution of polynomial equations (1965) (2)
Cohabiting with Computers (1985) (2)
Optimal Integration for Functions of Bounded Variation (1985) (2)
On the complexity of classical and quantum algorithms for numerical problems in quantum mechanics (2008) (2)
What is the Right Computational Model for Continuous Scientific Problems? (2012) (2)
Order of vector recurrences with applications to nonlinear iteration, parallel algorithms, and the power method (1974) (2)
Symposium on complexity of sequential and parallel numerical algorithms : program and abstracts. (1973) (2)
USA participation in an international standard glossary on information processing (1963) (1)
Quantum Computing (2001) (1)
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391) (2015) (1)
Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchange (1965) (1)
From Infoware to Infowar (1996) (1)
On a Soviet Algorithm for the Linear Programming Problem (1979) (1)
Non-Computability and Intractability: Does It Matter to Physics? (1998) (1)
On Smale’s Work in the Theory of Computation: From Polynomial Zeros to Continuous Complexity (1993) (1)
The new program of work for the international standard vocabulary in computers and information processing (1964) (1)
The Influence of Algorithms and Heuristics. (1979) (1)
George Forsythe memorial lecture (Panel Session) (1972) (0)
ABSTRACT PAD & APPROXIMANTS FOR THE SOLUTION OF A SYTEM OF NONLINEAR EQUATIONS (2001) (0)
Research in Information Processing (1978) (0)
Announcement: Best Paper Award (1996) (0)
Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004 (2005) (0)
04401 Summary - Algorithms and Complexity for Continuous Problems (2004) (0)
From the Editor (2000) (0)
ANNOUNCEMENT: 1999 Best Paper Award (2000) (0)
Annotated Bibliography and Brief History of Optimal Algorithms and Analytic Complexity. (1979) (0)
From the Editors (2004) (0)
From the Editor (1999) (0)
Can We Break Intractability Using Randomization or the Average Case Setting (1993) (0)
Breaking Intractability Problems that would otherwise be impossible to solve can now be computed , as long as one settles for what happens on the average by (0)
Complexity of sequential and parallel numerical algorithms : proceedings (1973) (0)
Announcement (1975) (0)
From the Editor (2002) (0)
Announcement: 2001 Prize for Achievement in Information-Based Complexity (2001) (0)
Theory and Applications of Information-Based Complexity (2018) (0)
Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award (2013) (0)
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award (2015) (0)
From the Editor (1986) (0)
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award (2014) (0)
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391) (2012) (0)
Revising the Publication Process (1970) (0)
Notice: Newsletter for Numerical Analysts (1966) (0)
COMPLEXITY OF APPROXTh1ATELY SOLVED PROBLEMS (1985) (0)
Frances Kuo Wins the 2014 Information-Based Complexity Prize (2014) (0)
CS Students Need Other Kinds of Math, Too (2003) (0)
Computing: Yesterday, today, and tomorrow (2001) (0)
From the editor (1985) (0)
Solvability of III-posed problems: An historical note (1991) (0)
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award (2014) (0)
Best Paper Award (2015) (0)
Comments on a recent paper0 (1960) (0)
THE SHIFTED QR ALGORITHM (1970) (0)
STATISTICAL SECURITY OF A STATISTICAL DATA BASE (2012) (0)
Pawel Przybylowicz wins the 2012 Information-Based Complexity Young Researcher Award (2013) (0)
Examination questions: qualifying examination: numerical analysis (1967) (0)
Optimal Linear Information for the Solution of Non-Linear Operator Equations, (1976) (0)
From the Editor (2000) (0)
Breaking Intractability, Software, and Implementation Testing (1998) (0)
Year 2000 Prize for Achievement in Information-Based Complexity (1999) (0)
From the Editors (2007) (0)
Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems? (2011) (0)
Electronic publishing. (1996) (0)
American standard and IFIP / ICC vocabularies compared (1965) (0)
Personalized subscriptions. (1968) (0)
Some general observations on Ph.D. production in computer science (1976) (0)
04401 Abstracts Collection - Algorithms and Complexity for Continuous (2004) (0)
Ph.D. qualifying examination: numerical analysis (1966) (0)
Editorial Board Changes (2009) (0)
Recent results and open problems in analytic computational complexity (1978) (0)
A Note from the Editor (1997) (0)
2001 Best Paper Award (2002) (0)
Changes to the Editorial Board (2018) (0)
The Next Big Thing (2003) (0)
Editorial (1997) (0)
Announcement: Editorial Board Changes (2012) (0)
The solution of transcendental equations * (2009) (0)
The Principle of Differentiated Quotients (1965) (0)
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award (2011) (0)
Stefan Heinrich wins the 2004 Best Paper Award (2005) (0)
1998 Best Paper Award (1999) (0)
ANNOUNCEMENT: 2000 Best Paper Award (2001) (0)
Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006 (2007) (0)
Information-Based Complexity: Recent Results and Open Problems (1991) (0)
Programming languages I (1973) (0)
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award (2012) (0)
Numerical analysis: approximation or estimation? (1967) (0)
A tribute to Allen Newell—1927–1992 (1992) (0)
State of the art in calculation of polynomial zeros (1968) (0)
Quantum Information Science, Introduction to (2009) (0)
Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award (2015) (0)
IFIP-62: Comments (1962) (0)
76 15391 – Algorithms and Complexity for Continuous Problems Participants (2016) (0)
A Lower Bound on the Average Number of Pivot Steps Required for Solving an LP – Valid for all Simplex-Variants (2008) (0)
202 12391 – Algorithms and Complexity for Continuous Problems 2 Table of Contents (2013) (0)
Computer-Based Journal Distribution for the Individual (1968) (0)
AIR FORCE OFFICT OF SCIENTIFIC RSSEARC NOTICE OF TRANSWITTAL TO DDü (2014) (0)
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation (1977) (0)
Analytic computational complexity: proceedings (1976) (0)
06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems (2006) (0)
Continuous Quantum Computation (2007) (0)
Announcement: Frank Aurzada, Steffen Dereich, Michael Scheutzow, and Christian Vormoor win the 2009 best paper award (2010) (0)
Prize for Achievement in Information-Based Complexity (1998) (0)
Announcement: J. Dick, F. Pillichshammer, and Y. Yomdin share the 2005 best paper award (2006) (0)
Ph.D. qualifying examination: numerical analysis (1967) (0)

This paper list is powered by the following services:

Other Resources About Joseph F. Traub

en.wikipedia.org

What Schools Are Affiliated With Joseph F. Traub?

Joseph F. Traub is affiliated with the following schools: