Joseph F. Traub

Publication Activity (10 Years)

Years Active: 1960-2015
Publications (10 Years): 0

Top Topics

Computational Issues

Exact Algorithms

Difficult Problems

Top Venues

Dagstuhl Reports

Publications

Erich Novak, Klaus Ritter, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award. J. Complex. 31 (3) (2015)
Erich Novak, Ian H. Sloan, Klaus Ritter, Joseph F. Traub, Henryk Wozniakowski
Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award. J. Complex. 31 (2) (2015)
Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, Larisa Yaroslavtseva
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391). Dagstuhl Reports 5 (9) (2015)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award. J. Complex. 30 (1) (2014)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Announcement. J. Complex. 30 (5) (2014)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award. J. Complex. 30 (3) (2014)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Frances Kuo Wins the 2014 Information-Based Complexity Prize. J. Complex. 30 (4) (2014)
Anargyros Papageorgiou, Iasonas Petras, Joseph F. Traub, Chi Zhang
A fast algorithm for approximating the ground state energy on a quantum computer. Math. Comput. 82 (284) (2013)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. J. Complex. 28 (5-6) (2012)
Joseph F. Traub
What is the Right Computational Model for Continuous Scientific Problems? Comput. J. 55 (7) (2012)
Alexander Keller, Frances Y. Kuo, Andreas Neuenkirch, Joseph F. Traub
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). Dagstuhl Reports 2 (9) (2012)
Joseph F. Traub
Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems? Ubiquity 2011 (January) (2011)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. J. Complex. 27 (6) (2011)
Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski
Changes to the Editorial Board. J. Complex. 25 (6) (2009)
Joseph F. Traub
Our Silver Anniversary. J. Complex. 25 (6) (2009)
Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub
09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems (2009)
Joseph F. Traub
Editorial Board Changes. J. Complex. 25 (1) (2009)
Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski
From the Editors. J. Complex. 23 (1) (2007)
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub
06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems (2006)
Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub
Guest editors' preface. J. Complex. 21 (1) (2005)
Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub
04401 Abstracts Collection - Algorithms and Complexity for Continuous. Algorithms and Complexity for Continuous Problems (2004)
Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski
From the Editors. J. Complex. 20 (1) (2004)
Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub
04401 Summary - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems (2004)
Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski
2001 Best Paper Award. J. Complex. 18 (3) (2002)
Joseph F. Traub, Henryk Wozniakowski
Path Integration on a Quantum Computer. Quantum Inf. Process. 1 (5) (2002)
Joseph F. Traub
FROM THE EDITOR. J. Complex. 18 (3) (2002)
Joseph F. Traub
Computing: Yesterday, today, and tomorrow. Complex. 6 (6) (2001)
Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski
ANNOUNCEMENT: 2000 Best Paper Award. J. Complex. 17 (3) (2001)
Joseph F. Traub
Quantum Computing. J. Complex. 17 (1) (2001)
Joseph F. Traub
A Continuous Model of Computation CoRR (2001)
Anargyros Papageorgiou, Joseph F. Traub
Faster Evaluation of Multidimensional Integrals CoRR (2000)
Joseph F. Traub
From the Editor. J. Complex. 16 (3) (2000)
Joseph F. Traub
From the Editor. J. Complex. 16 (4) (2000)
Joseph F. Traub
From the Editor. J. Complex. 15 (4) (1999)
Piet Hut, David Ruelle, Joseph F. Traub
Varieties of limits to scientific knowledge. Complex. 3 (6) (1998)
Joseph F. Traub
Best Paper Award. J. Complex. 13 (1) (1997)
Joseph F. Traub
A Note from the Editor. J. Complex. 13 (4) (1997)
Joseph F. Traub
Do negative results from formal systems limit scientific knowledge? Complex. 3 (1) (1997)
James B. Hartle, Piet Hut, Joseph F. Traub
Editorial. Complex. 3 (1) (1997)
Joseph F. Traub, Henryk Wozniakowski
Recent progress in information-based complexity. Bull. EATCS 51 (1993)
Edward W. Packel, Joseph F. Traub, Henryk Wozniakowski
Measures of uncertainty and information in computation. Inf. Sci. 65 (3) (1992)
Joseph F. Traub
Solvability of III-posed problems: An historical note. J. Complex. 7 (3) (1991)
Joseph F. Traub
Information-Based Complexity: Recent Results and Open Problems. FCT (1991)
Joseph F. Traub
From the Editor. J. Complex. 2 (1) (1986)
Joseph F. Traub
Complexity of approximately solved problems. J. Complex. 1 (1) (1985)
Joseph F. Traub
From the editor. J. Complex. 1 (2) (1985)
Joseph F. Traub
Why a journal of complexity? J. Complex. 1 (1) (1985)
Joseph F. Traub, Henryk Wozniakowski
On the Optimal Solution of Large Linear Systems. J. ACM 31 (3) (1984)
Joseph F. Traub, Yechiam Yemini, Henryk Wozniakowski
The Statistical Security of a Statistical Database. ACM Trans. Database Syst. 9 (4) (1984)
Joseph F. Traub, Henryk Wozniakowski
Information and Computation. Adv. Comput. 23 (1984)
Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski
Average Case Optimality for Linear Problems. Theor. Comput. Sci. 29 (1984)
Stephen S. Yau, Robert W. Ritchie, Warren L. Semon, Joseph F. Traub, Andries van Dam, Stanley Winkler
Meeting the Crisis in Computer Science. Commun. ACM 26 (12) (1983)
Stephen S. Yau, Robert W. Ritchie, Warren L. Semon, Joseph F. Traub, Andries van Dam, Stanley Winkler
Meeting the Crisis in Computer Science. Computer 16 (12) (1983)
Joseph F. Traub, Henryk Wozniakowski
Complexity of linear programming. Oper. Res. Lett. 1 (2) (1982)
Peter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, Joseph F. Traub
A Discipline in Crisis. Commun. ACM 24 (6) (1981)
Joseph F. Traub
Quo Vadimus: Computer Science in a Decade. Commun. ACM 24 (6) (1981)
Richard P. Brent, Joseph F. Traub
On the Complexity of Composition and Generalized Composition of Power Series. SIAM J. Comput. 9 (1) (1980)
Joseph F. Traub, Henryk Wozniakowski
Convergence and Complexity of Newton Iteration for Operator Equations. J. ACM 26 (2) (1979)
H. T. Kung, Joseph F. Traub
All Algebraic Functions Can Be Computed Fast. J. ACM 25 (2) (1978)
Mary Shaw, Joseph F. Traub
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. Inf. Process. Lett. 6 (5) (1977)
Joseph F. Traub
Some general observations on Ph.D. production in computer science. ACM SIGCSE Bull. 8 (4) (1976)
D. E. Heller, D. K. Stevenson, Joseph F. Traub
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers. J. ACM 23 (4) (1976)
Michael A. Jenkins, Joseph F. Traub
Principles for Testing Polynomial Zerofinding Programs. ACM Trans. Math. Softw. 1 (1) (1975)
Mary Shaw, Joseph F. Traub
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. J. ACM 21 (1) (1974)
H. T. Kung, Joseph F. Traub
Optimal Order of One-Point and Multipoint Iteration. J. ACM 21 (4) (1974)
Joseph F. Traub
Parallel Algorithms and Parallel Comnputational Complexity. IFIP Congress (1974)
Joseph F. Traub
Invited speaker. ACM Conference on Computer Science (1973)
D. K. Stevenson, Joseph F. Traub
Iterative solution of block tridiagonal systems on parallel or vector computers. ACM Annual Conference (1973)
Michael A. Jenkins, Joseph F. Traub
Zeros of a Complex Polynomial [C2] (Algorithm 419). Commun. ACM 15 (2) (1972)
Mary Shaw, Joseph F. Traub
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives SWAT (1972)
Donald G. M. Anderson, William Kahan, Joseph F. Traub
George Forsythe memorial lecture (Panel Session). ACM Annual Conference (2) (1972)
Joseph F. Traub
Computational Complexity of Iterative Processes. SIAM J. Comput. 1 (2) (1972)
Joseph F. Traub
Numerical Mathematics and Computer Science. Commun. ACM 15 (7) (1972)
W. S. Brown, Joseph F. Traub
On Euclid's Algorithm and the Theory of Subresultants. J. ACM 18 (4) (1971)
Joseph F. Traub
Optimal Iterative Processes: Theorems and Conjectures. IFIP Congress (2) (1971)
George E. Forsythe, Bernard A. Galler, Juris Hartmanis, Alan J. Perlis, Joseph F. Traub
Computer science and mathematics. ACM SIGCSE Bull. 2 (4) (1970)
W. S. Brown, Joseph F. Traub
MERCURY: H system for the computer-aided distribution of technical reports. J. ACM 16 (1) (1969)
W. Morven Gentleman, Joseph F. Traub
The bell laboratories numerical mathematics program library project. ACM National Conference (1968)
Joseph F. Traub
Notice: Newsletter for Numerical Analysts. Comput. J. 8 (4) (1966)
E. L. Lohse, R. V. Smith, Joseph F. Traub, Saul Gorn
Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchange. Commun. ACM 8 (9) (1965)
Joseph F. Traub
American standard and IFIP / ICC vocabularies compared. Commun. ACM 8 (6) (1965)
Joseph F. Traub
The new program of work for the international standard vocabulary in computers and information processing. Commun. ACM 7 (11) (1964)
Joseph F. Traub
USA participation in an international standard glossary on information processing. Commun. ACM 6 (11) (1963)
Joseph F. Traub
IFIP-62: Comments. Commun. ACM 5 (10) (1962)
Joseph F. Traub
Invited papers: The theory of multipoint iteration functions. ACM National Conference (1962)
Joseph F. Traub
On a class of iteration formulas and some historical notes. Commun. ACM 4 (6) (1961)
Joseph F. Traub
On functional iteration and the calculation of roots. ACM National Meeting (1961)
Joseph F. Traub
Comments on "A New Method of Computation of Square Roots Without Using Division". Commun. ACM 3 (2) (1960)