J. F. Traub

Joseph F. Traub: What is the Right Computational Model for Continuous Scientific Problems? Comput. J. 55(7): 836-837 (2012)

Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. J. Complexity 28(5-6): 519 (2012)

Alexander Keller, Frances Y. Kuo, Andreas Neuenkirch, Joseph F. Traub: Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). Dagstuhl Reports 2(9): 200-225 (2012)

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. Complexity 27(6): 501 (2011)

Joseph F. Traub: Editorial Board Changes. J. Complexity 25(1): 1 (2009)

Joseph F. Traub: Our Silver Anniversary. J. Complexity 25(6): 509 (2009)

Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Changes to the Editorial Board. J. Complexity 25(6): 510 (2009)

Anargyros Papageorgiou, Joseph F. Traub: Quantum Algorithms and Complexity for Continuous Problems. Encyclopedia of Complexity and Systems Science 2009: 7118-7135

Joseph F. Traub: Quantum Information Science, Introduction to. Encyclopedia of Complexity and Systems Science 2009: 7399-7400

J. F. Traub, Arthur G. Werschulz: Information-based Complexity and Information-based Optimization. Encyclopedia of Optimization 2009: 1603-1608

Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: From the Editors. J. Complexity 23(1): 1 (2007)

Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub (Eds.): Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006. Dagstuhl Seminar Proceedings 06391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 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. Complexity 21(1): 4- (2005)

Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub (Eds.): Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. Dagstuhl Seminar Proceedings 04401, IBFI, Schloss Dagstuhl, Germany 2005

Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: From the Editors. J. Complexity 20(1): 1-2 (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

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

Joseph F. Traub: FROM THE EDITOR. J. Complexity 18(3): 679- (2002)

Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: 2001 Best Paper Award. J. Complexity 18(3): 680- (2002)

Joseph F. Traub: Computing: Yesterday, today, and tomorrow. Complexity 6(6): 15-18 (2001)

Joseph F. Traub: Quantum Computing. J. Complexity 17(1): 1- (2001)

Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: ANNOUNCEMENT: 2000 Best Paper Award. J. Complexity 17(3): 494- (2001)

J. F. Traub: A Continuous Model of Computation. CoRR physics/0106045 (2001)

Joseph F. Traub: From the Editor. J. Complexity 16(3): 525 (2000)

Joseph F. Traub: From the Editor. J. Complexity 16(4): 639 (2000)

Anargyros Papageorgiou, Joseph F. Traub: Faster Evaluation of Multidimensional Integrals. CoRR physics/0011053 (2000)

Joseph F. Traub: From the Editor. J. Complexity 15(4): 449- (1999)

Joseph F. Traub, Arthur G. Werschulz: Complexity and information. Lezioni Lincee, Cambridge University Press 1998, isbn 978-0-521-48005-5, pp. I-XII, 1-139

Piet Hut, David Ruelle, Joseph F. Traub: Varieties of limits to scientific knowledge. Complexity 3(6): 33-38 (1998)

James B. Hartle, Piet Hut, Joseph F. Traub: Editorial. Complexity 3(1): 8 (1997)

J. F. Traub: Do negative results from formal systems limit scientific knowledge? Complexity 3(1): 29-31 (1997)

Joseph F. Traub: Best Paper Award. J. Complexity 13(1): 1- (1997)

Joseph F. Traub: A Note from the Editor. J. Complexity 13(4): 385- (1997)

Joseph F. Traub, Henryk Wozniakowski: Recent progress in information-based complexity. Bulletin of the EATCS 51: 141-154 (1993)

Edward W. Packel, Joseph F. Traub, Henryk Wozniakowski: Measures of uncertainty and information in computation. Inf. Sci. 65(3): 253-273 (1992)

Joseph F. Traub: Solvability of III-posed problems: An historical note. J. Complexity 7(3): 219- (1991)

J. F. Traub: Information-Based Complexity: Recent Results and Open Problems. FCT 1991: 86-88

Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski: Information-based complexity. Computer science and scientific computing, Academic Press 1988, isbn 978-0-12-697545-1, pp. I-XIII, 1-523

Joseph F. Traub: From the Editor. J. Complexity 2(1): 1- (1986)

Joseph F. Traub: Why a journal of complexity? J. Complexity 1(1): 1- (1985)

Joseph F. Traub: Complexity of approximately solved problems. J. Complexity 1(1): 3-10 (1985)

Joseph F. Traub: From the editor. J. Complexity 1(2): 169- (1985)

Joseph F. Traub, Henryk Wozniakowski: Information and Computation. Advances in Computers 23: 35-92 (1984)

Joseph F. Traub, Henryk Wozniakowski: On the Optimal Solution of Large Linear Systems. J. ACM 31(3): 545-559 (1984)

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

Joseph F. Traub, Yechiam Yemini, Henryk Wozniakowski: The Statistical Security of a Statistical Database. ACM Trans. Database Syst. 9(4): 672-679 (1984)

Stephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler: Meeting the Crisis in Comuter Science. Commun. ACM 26(12): 1046-1050 (1983)

Stephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler: Meeting the Crisis in Computer Science. IEEE Computer 16(12): 83-87 (1983)

J. F. Traub: Quo Vadimus: Computer Science in a Decade. Commun. ACM 24(6): 351-369 (1981)

Peter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, J. F. Traub: A Discipline in Crisis. Commun. ACM 24(6): 370-374 (1981)

Joseph F. Traub, Henryk Wozniakowski: A general theory of optimal algorithms. ACM monograph series, Academic Press 1980, isbn 978-0-12-697650-2, pp. I-XIV, 1-341

Richard P. Brent, J. F. Traub: On the Complexity of Composition and Generalized Composition of Power Series. SIAM J. Comput. 9(1): 54-66 (1980)

Joseph F. Traub, Henryk Wozniakowski: Convergence and Complexity of Newton Iteration for Operator Equations. J. ACM 26(2): 250-258 (1979)

H. T. Kung, J. F. Traub: All Algebraic Functions Can Be Computed Fast. J. ACM 25(2): 245-260 (1978)

Mary Shaw, J. F. Traub: Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. Inf. Process. Lett. 6(5): 141-145 (1977)

D. E. Heller, D. K. Stevenson, J. F. Traub: Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers. J. ACM 23(4): 636-654 (1976)

Michael A. Jenkins, J. F. Traub: Principles for Testing Polynomial Zerofinding Programs. ACM Trans. Math. Softw. 1(1): 26-34 (1975)

Mary Shaw, J. F. Traub: On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. J. ACM 21(1): 161-167 (1974)

H. T. Kung, J. F. Traub: Optimal Order of One-Point and Multipoint Iteration. J. ACM 21(4): 643-651 (1974)

J. F. Traub: Parallel Algorithms and Parallel Comnputational Complexity. IFIP Congress 1974: 685-687

Michael A. Jenkins, J. F. Traub: Zeros of a Complex Polynomial [C2] (Algorithm 419). Commun. ACM 15(2): 97-99 (1972)

J. F. Traub: Numerical Mathematics and Computer Science. Commun. ACM 15(7): 537-541 (1972)

J. F. Traub: Computational Complexity of Iterative Processes. SIAM J. Comput. 1(2): 167-179 (1972)

Mary Shaw, J. F. Traub: On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives. SWAT (FOCS) 1972: 105-107

W. S. Brown, J. F. Traub: On Euclid's Algorithm and the Theory of Subresultants. J. ACM 18(4): 505-514 (1971)

J. F. Traub: Optimal Iterative Processes: Theorems and Conjectures. IFIP Congress (2) 1971: 1273-1277

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

Joseph F. Traub: American standard and IFIP / ICC vocabularies compared. Commun. ACM 8(6): 361-362 (1965)

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): 553-556 (1965)

J. F. Traub: The new program of work for the international standard vocabulary in computers and information processing. Commun. ACM 7(11): 662 (1964)

J. F. Traub: USA participation in an international standard glossary on information processing. Commun. ACM 6(11): 658-659 (1963)

J. F. Traub: IFIP-62: Comments. Commun. ACM 5(10): 500-501 (1962)

J. F. Traub: On a class of iteration formulas and some historical notes. Commun. ACM 4(6): 276-278 (1961)

J. F. Traub: Comments on "A New Method of Computation of Square Roots Without Using Division". Commun. ACM 3(2): 86 (1960)