Joseph F. Traub

Research.com Recognitions

• 2013 - Fellow of the American Mathematical Society
• 1994 - ACM Fellow For pioneering research on information-based complexity, computational finance, optimal iteration theory, parallel computing, national science policy, and for leadership in computing education.

Overview

Best Publications

• Iterative Methods for the Solution of Equations

  Joseph Frederick Traub

  3348
  Citations

• Information-based complexity

  Joseph F. Traub

  1512
  Citations

• Optimal Order of One-Point and Multipoint Iteration

  H. T. Kung;J. F. Traub

  887
  Citations

• A General Theory of Optimal Algorithms

  Joseph Frederick Traub;H. Woźniakowski

  787
  Citations

• Information-based complexity

  Edward W. Packel;J. F. Traub

  596
  Citations

• Faster valuation of financial derivatives

  Spassimir H. Paskov;Joseph F. Traub

  563
  Citations

• On Euclid's Algorithm and the Theory of Subresultants

  W. S. Brown;J. F. Traub

  370
  Citations

• Complexity and Information

  J. F. Traub;A. G. Werschulz

  351
  Citations

• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration

  M. A. Jenkins;Joseph F. Traub

  247
  Citations

• The statistical security of a statistical database

  J. F. Traub;Y. Yemini;H. Woźniakowski

  228
  Citations

• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration

  M.A. Jenkins;Joseph F. Traub

  216
  Citations

• Algorithms and Complexity: New Directions and Recent Results

  Joseph F. Traub

  216
  Citations

• The Algebraic Theory of Matrix Polynomials

  J.E. Dennis;Joseph F. Traub;R.P. Weber

  210
  Citations

• Information, Uncertainty, Complexity

  J. F. Traub;G. W. Wasilkowski;H. Wozniakowski;John J. Bartholdi

  201
  Citations

• Convergence and Complexity of Newton Iteration for Operator Equations

  J. F. Traub;H. Woźniakowski

  175
  Citations

• All Algebraic Functions Can Be Computed Fast

  H. T. Kung;J. F. Traub

  145
  Citations

• Algorithm 419: zeros of a complex polynomial [C2]

  M. A. Jenkins;J. F. Traub

  135
  Citations

• Estimation method and system for complex securities using low-discrepancy deterministic sequences

  Joseph F. Traub;Spassimir Paskov;Irwin F. Vanderhoof

  131
  Citations

• Quantum algorithm and circuit design solving the Poisson equation

  Yudong Cao;Anargyros Papageorgiou;Iasonas Petras;Joseph Traub

  117
  Citations

• Portfolio structuring using low-discrepancy deterministic sequences

  Joseph F. Traub;Spassimir Paskov;Irwin T. Vanderhoof;Anargyros Papageorgiou

  107
  Citations

• Faster evaluation of multidimensional integrals

  A. Papageorgiou;J. F. Traub

  106
  Citations

• Complexity of linear programming

  J. F. Traub;H. Woniakowski

  68
  Citations

• Information and computation

  Joseph F. Traub;Henryk Wozniakowski

  4
  Citations