Joseph F. Traub

Personal life Traub had two daughters, Claudia Traub-Cooper and Hillary Spector. He lived in Manhattan and Santa Fe with his wife, author Pamela McCorduck. He often opined on current events by writing to the New York Times, which frequently published his comments.

Selected honors and distinctions Founding Chair, Computer Science and Telecommunications Board, National Academies, 1986–92, 2005–2009 Board of Governors, New York Academy of Sciences, 1986-9 (Executive Committee 1987–89) Fellow: American Association for the Advancement of Science, 1971; ACM 1994; New York Academy of Sciences, 1999; American Mathematical Society, 2012 1999 New York City Mayor's Award for Excellence in Science and Technology Festschrift for Joseph F. Traub, Academic Press, 1993 Festschrift for Joseph F. Traub, Elsevier, 2004 Honorary Doctorate of Science, University of Central Florida, 2001 Founding Editor-in-Chief, Journal of Complexity, 1985

Selected publications

Selected monographs Iterative Methods for the Solution of Equations, Prentice Hall, 1964. Reissued Chelsea Publishing Company, 1982; Russian translation MIR, 1985; reissued American Mathematical Society, 1998. Algorithms and Complexity: New Directions and Recent Results, (editor) Academic Press, 1976. Information-Based Complexity, Academic Press, 1988 (with G. Wasilkowski and H. Woźniakowski). Complexity and Information, Cambridge University Press, 1998 (with A. G. Werschulz); Japanese translation, 2000.

Selected papers Variational Calculations of the State of Helium, Phys. Rev. 116, 1959, 914–919. The Future of Scientific Journals, Science 158, 1966, 1153–1159 (with W. S. Brown and J. R. Pierce). A Three-Stage Variable-Shift Iteration for Polynomial Zeros and Its Relation to Generalized Rayleigh Iteration, Numerische mathematik 14, 1970, 252–263 (with M. A. Jenkins). Computational Complexity of Iterative Processes, SIAM Journal on Computing 1, 1972, 167–179. Parallel Algorithms and Parallel Computational Complexity, Proceedings IFIP Congress, 1974, 685–687. Convergence and Complexity of Newton Iteration for Operator Equations, Journal of the ACM 26, 1979, 250–258 (with H. Woźniakowski). All Algebraic Functions Can Be Computed Fast, Journal of the ACM 25, 1978, 245–260 (with H. T. Kung). On the Complexity of Composition and Generalized Composition of Power Series, SIAM Journal on Computing 9, 1980, 54–66 (with R. Brent). Complexity of Linear Programming, Operations Research Letters 1, 1982, 59–62 (with H. Woźniakowski). Information-Based Complexity, Nature 327, July, 1987, 29–33 (with E. Packel). The Monte Carlo Algorithm with a Pseudo-Random Number Generator, Mathematics of Computation 58, 199, 303–339 (with H. Woźniakowski). Breaking Intractability, Scientific American, January, 1994, 102–107 (with H. Woźniakowski). Translated into German, Italian, Japanese and Polish. Linear Ill-Posed Problems are Solvable on the Average for All Gaussian Measures, Math Intelligencer 16, 1994, 42–48 (with A. G. Werschulz). Faster Evaluation of Financial Derivatives, Journal of Portfolio Management 22, 1995, 113–120 (with S. Paskov). A Continuous Model of Computation, Physics Today, May, 1999, 39–43. No Curse of Dimensionality for Contraction Fixed points in the Worst Case, Econometrics, Vol. 70, No. 1, January, 2002, 285–329 (with J. Rust and H. Woźniakowski). Path Integration on a Quantum Computer, Quantum Information Processing, 2003, 365–388 (with H. Woźniakowski).