Comments on "A New Method of Computation of Square Roots Without Using Division". - Joseph F. Traub (Commun. ACM, 1960)

On functional iteration and the calculation of roots. - Joseph F. Traub (ACM National Meeting, 1961)

On a class of iteration formulas and some historical notes. - Joseph F. Traub (Commun. ACM, 1961)

Invited papers: The theory of multipoint iteration functions. - Joseph F. Traub (ACM National Conference, 1962)

IFIP-62: Comments. - Joseph F. Traub (Commun. ACM, 1962)

USA participation in an international standard glossary on information processing. - Joseph F. Traub (Commun. ACM, 1963)

The new program of work for the international standard vocabulary in computers and information processing. - Joseph F. Traub (Commun. ACM, 1964)

Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchange. - E. L. Lohse; R. V. Smith; Joseph F. Traub; Saul Gorn (Commun. ACM, 1965)

American standard and IFIP / ICC vocabularies compared. - Joseph F. Traub (Commun. ACM, 1965)

Notice: Newsletter for Numerical Analysts. - Joseph F. Traub (Comput. J., 1966)

The bell laboratories numerical mathematics program library project. - W. Morven Gentleman; Joseph F. Traub (ACM National Conference, 1968)

MERCURY: H system for the computer-aided distribution of technical reports. - W. S. Brown; Joseph F. Traub (J. ACM, 1969)

Computer science and mathematics. - George E. Forsythe; Bernard A. Galler; Juris Hartmanis; Alan J. Perlis; Joseph F. Traub (ACM SIGCSE Bull., 1970)

Optimal Iterative Processes: Theorems and Conjectures. - Joseph F. Traub (IFIP Congress (2), 1971)

On Euclid's Algorithm and the Theory of Subresultants. - W. S. Brown; Joseph F. Traub (J. ACM, 1971)

George Forsythe memorial lecture (Panel Session). - Donald G. M. Anderson; William Kahan; Joseph F. Traub (ACM Annual Conference (2), 1972)

On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives - Mary Shaw; Joseph F. Traub (SWAT, 1972)

Zeros of a Complex Polynomial [C2] (Algorithm 419). - Michael A. Jenkins; Joseph F. Traub (Commun. ACM, 1972)

Numerical Mathematics and Computer Science. - Joseph F. Traub (Commun. ACM, 1972)

Computational Complexity of Iterative Processes. - Joseph F. Traub (SIAM J. Comput., 1972)

Iterative solution of block tridiagonal systems on parallel or vector computers. - D. K. Stevenson; Joseph F. Traub (ACM Annual Conference, 1973)

Invited speaker. - Joseph F. Traub (ACM Conference on Computer Science, 1973)

Parallel Algorithms and Parallel Comnputational Complexity. - Joseph F. Traub (IFIP Congress, 1974)

Optimal Order of One-Point and Multipoint Iteration. - H. T. Kung 001; Joseph F. Traub (J. ACM, 1974)

On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. - Mary Shaw; Joseph F. Traub (J. ACM, 1974)

Principles for Testing Polynomial Zerofinding Programs. - Michael A. Jenkins; Joseph F. Traub (ACM Trans. Math. Softw., 1975)

Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers. - Don Eric Heller; D. K. Stevenson; Joseph F. Traub (J. ACM, 1976)

Some general observations on Ph.D. production in computer science. - Joseph F. Traub (ACM SIGCSE Bull., 1976)

Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. - Mary Shaw; Joseph F. Traub (Inf. Process. Lett., 1977)

All Algebraic Functions Can Be Computed Fast. - H. T. Kung 001; Joseph F. Traub (J. ACM, 1978)

Convergence and Complexity of Newton Iteration for Operator Equations. - Joseph F. Traub; Henryk Wozniakowski (J. ACM, 1979)

A general theory of optimal algorithms. - Joseph F. Traub; Henryk Wozniakowski (Academic Press, 1980)

On the Complexity of Composition and Generalized Composition of Power Series. - Richard P. Brent; Joseph F. Traub (SIAM J. Comput., 1980)

A Discipline in Crisis. - Peter J. Denning; Edward A. Feigenbaum; Paul C. Gilmore; Anthony C. Hearn; Robert W. Ritchie; Joseph F. Traub (Commun. ACM, 1981)

Quo Vadimus: Computer Science in a Decade. - Joseph F. Traub (Commun. ACM, 1981)

Complexity of linear programming. - Joseph F. Traub; Henryk Wozniakowski (Oper. Res. Lett., 1982)

Meeting the Crisis in Computer Science. - Stephen S. Yau; Robert W. Ritchie; Warren L. Semon; Joseph F. Traub; Andries van Dam; Stanley Winkler (Commun. ACM, 1983)

Information and Computation. - Joseph F. Traub; Henryk Wozniakowski (Adv. Comput., 1984)

On the Optimal Solution of Large Linear Systems. - Joseph F. Traub; Henryk Wozniakowski (J. ACM, 1984)

Average Case Optimality for Linear Problems. - Joseph F. Traub; Grzegorz W. Wasilkowski; Henryk Wozniakowski (Theor. Comput. Sci., 1984)

The Statistical Security of a Statistical Database. - Joseph F. Traub; Yechiam Yemini; Henryk Wozniakowski (ACM Trans. Database Syst., 1984)

Why a journal of complexity? - Joseph F. Traub (J. Complex., 1985)

Complexity of approximately solved problems. - Joseph F. Traub (J. Complex., 1985)

From the Editor. - Joseph F. Traub (J. Complex., 1986)

Information-based complexity. - Joseph F. Traub; Grzegorz W. Wasilkowski; Henryk Wozniakowski (Academic Press, 1988)

Information-Based Complexity: Recent Results and Open Problems. - Joseph F. Traub (FCT, 1991)

Solvability of III-posed problems: An historical note. - Joseph F. Traub (J. Complex., 1991)

Measures of uncertainty and information in computation. - Edward W. Packel; Joseph F. Traub; Henryk Wozniakowski (Inf. Sci., 1992)

Recent progress in information-based complexity. - Joseph F. Traub; Henryk Wozniakowski (Bull. EATCS, 1993)

Editorial. - James B. Hartle; Piet Hut; Joseph F. Traub (Complex., 1997)

Do negative results from formal systems limit scientific knowledge? - Joseph F. Traub (Complex., 1997)

Best Paper Award. - Joseph F. Traub (J. Complex., 1997)

A Note from the Editor. - Joseph F. Traub (J. Complex., 1997)

Complexity and information. - Joseph F. Traub; Arthur G. Werschulz (Cambridge University Press, 1998)

Varieties of limits to scientific knowledge. - Piet Hut; David Ruelle; Joseph F. Traub (Complex., 1998)

Faster Evaluation of Multidimensional Integrals - Anargyros Papageorgiou; Joseph F. Traub (CoRR, 2000)

Computing: Yesterday, today, and tomorrow. - Joseph F. Traub (Complex., 2001)

A Continuous Model of Computation - Joseph F. Traub (CoRR, 2001)

ANNOUNCEMENT: 2000 Best Paper Award. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2001)

Quantum Computing. - Joseph F. Traub (J. Complex., 2001)

2001 Best Paper Award. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2002)

Path Integration on a Quantum Computer. - Joseph F. Traub; Henryk Wozniakowski (Quantum Inf. Process., 2002)

04401 Summary - Algorithms and Complexity for Continuous Problems. - Thomas Müller-Gronbach; Erich Novak; Knut Petras; Joseph F. Traub (Algorithms and Complexity for Continuous Problems, 2004)

04401 Abstracts Collection - Algorithms and Complexity for Continuous. - Thomas Müller-Gronbach; Erich Novak; Knut Petras; Joseph F. Traub (Algorithms and Complexity for Continuous Problems, 2004)

From the Editors. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2004)

Guest editors' preface. - Askold Khovanskii; Pascal Koiran; Teresa Krick; Gregorio Malajovich; Joseph F. Traub (J. Complex., 2005)

06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. - Stephan Dahlke; Klaus Ritter 001; Ian H. Sloan; Joseph F. Traub (Algorithms and Complexity for Continuous Problems, 2006)

09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems. - Thomas Müller-Gronbach; Leszek Plaskota; Joseph F. Traub (Algorithms and Complexity for Continuous Problems, 2009)

Changes to the Editorial Board. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2009)

Editorial Board Changes. - Joseph F. Traub (J. Complex., 2009)

Our Silver Anniversary. - Joseph F. Traub (J. Complex., 2009)

Quantum Algorithms and Complexity for Continuous Problems. - Anargyros Papageorgiou; Joseph F. Traub (Encyclopedia of Complexity and Systems Science, 2009)

Quantum Information Science, Introduction to. - Joseph F. Traub (Encyclopedia of Complexity and Systems Science, 2009)

Information-based Complexity and Information-based Optimization. - Joseph F. Traub; Arthur G. Werschulz (Encyclopedia of Optimization, 2009)

Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2011)

Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems? - Joseph F. Traub (Ubiquity, 2011)

What is the Right Computational Model for Continuous Scientific Problems? - Joseph F. Traub (Comput. J., 2012)

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). - Alexander Keller 001; Frances Y. Kuo; Andreas Neuenkirch; Joseph F. Traub (Dagstuhl Reports, 2012)

Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2012)

A fast algorithm for approximating the ground state energy on a quantum computer. - Anargyros Papageorgiou; Iasonas Petras; Joseph F. Traub; Chi Zhang 059 (Math. Comput., 2013)

Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2014)

Frances Kuo Wins the 2014 Information-Based Complexity Prize. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2014)

Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2014)

Announcement. - Erich Novak; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2014)

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391). - Aicke Hinrichs; Joseph F. Traub; Henryk Wozniakowski; Larisa Yaroslavtseva (Dagstuhl Reports, 2015)

Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award. - Erich Novak; Klaus Ritter 001; Ian H. Sloan; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2015)

Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award. - Erich Novak; Ian H. Sloan; Klaus Ritter 001; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2015)