Joseph F. Traub
List of publications from the
| 2009 |
| 60 | EE | J. F. Traub,
Arthur G. Werschulz:
Information-based Complexity and Information-based Optimization.
Encyclopedia of Optimization 2009: 1603-1608 |
| 59 | EE | Joseph F. Traub:
Editorial Board Changes.
J. Complexity 25(1): 1 (2009) |
| 2007 |
| 58 | | Stephan Dahlke,
Klaus Ritter,
Ian H. Sloan,
Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 57 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
From the Editors.
J. Complexity 23(1): 1 (2007) |
| 2006 |
| 56 | EE | 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 |
| 2005 |
| 55 | | Thomas Müller-Gronbach,
Erich Novak,
Knut Petras,
Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004
IBFI, Schloss Dagstuhl, Germany 2005 |
| 54 | EE | Askold Khovanskii,
Pascal Koiran,
Teresa Krick,
Gregorio Malajovich,
Joseph F. Traub:
Guest editors' preface.
J. Complexity 21(1): 4- (2005) |
| 2004 |
| 53 | EE | 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 |
| 52 | EE | 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 |
| 51 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
From the Editors.
J. Complexity 20(1): 1-2 (2004) |
| 2002 |
| 50 | EE | Joseph F. Traub:
FROM THE EDITOR.
J. Complexity 18(3): 679- (2002) |
| 49 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
2001 Best Paper Award.
J. Complexity 18(3): 680- (2002) |
| 2001 |
| 48 | EE | J. F. Traub:
A Continuous Model of Computation
CoRR physics/0106045: (2001) |
| 47 | EE | Joseph F. Traub:
Quantum Computing.
J. Complexity 17(1): 1- (2001) |
| 46 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
ANNOUNCEMENT: 2000 Best Paper Award.
J. Complexity 17(3): 494- (2001) |
| 2000 |
| 45 | EE | A. Papageorgiou,
J. F. Traub:
Faster Evaluation of Multidimensional Integrals
CoRR physics/0011053: (2000) |
| 44 | EE | Joseph F. Traub:
From the Editor.
J. Complexity 16(3): 525 (2000) |
| 43 | EE | Joseph F. Traub:
From the Editor.
J. Complexity 16(4): 639 (2000) |
| 1999 |
| 42 | EE | Joseph F. Traub:
From the Editor.
J. Complexity 15(4): 449- (1999) |
| 1997 |
| 41 | EE | Joseph F. Traub:
Best Paper Award.
J. Complexity 13(1): 1- (1997) |
| 40 | EE | Joseph F. Traub:
A Note from the Editor.
J. Complexity 13(4): 385- (1997) |
| 1993 |
| 39 | | Joseph F. Traub,
Henryk Wozniakowski:
Recent progress in information-based complexity.
Bulletin of the EATCS 51: 141-154 (1993) |
| 1992 |
| 38 | EE | Edward W. Packel,
Joseph F. Traub,
Henryk Wozniakowski:
Measures of uncertainty and information in computation.
Inf. Sci. 65(3): 253-273 (1992) |
| 1991 |
| 37 | | J. F. Traub:
Information-Based Complexity: Recent Results and Open Problems.
FCT 1991: 86-88 |
| 36 | EE | Joseph F. Traub:
Solvability of III-posed problems: An historical note.
J. Complexity 7(3): 219- (1991) |
| 1986 |
| 35 | EE | Joseph F. Traub:
From the Editor.
J. Complexity 2(1): 1- (1986) |
| 1985 |
| 34 | EE | Joseph F. Traub:
Why a journal of complexity?
J. Complexity 1(1): 1- (1985) |
| 33 | EE | Joseph F. Traub:
Complexity of approximately solved problems.
J. Complexity 1(1): 3-10 (1985) |
| 32 | EE | Joseph F. Traub:
From the editor.
J. Complexity 1(2): 169- (1985) |
| 1984 |
| 31 | EE | Joseph F. Traub,
Yechiam Yemini,
Henryk Wozniakowski:
The Statistical Security of a Statistical Database.
ACM Trans. Database Syst. 9(4): 672-679 (1984) |
| 30 | | Joseph F. Traub,
Henryk Wozniakowski:
Information and Computation.
Advances in Computers 23: 35-92 (1984) |
| 29 | EE | Joseph F. Traub,
Henryk Wozniakowski:
On the Optimal Solution of Large Linear Systems.
J. ACM 31(3): 545-559 (1984) |
| 28 | | Joseph F. Traub,
Grzegorz W. Wasilkowski,
Henryk Wozniakowski:
Average Case Optimality for Linear Problems.
Theor. Comput. Sci. 29: 1-25 (1984) |
| 1983 |
| 27 | | 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) |
| 26 | | 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) |
| 1981 |
| 25 | | J. F. Traub:
Quo Vadimus: Computer Science in a Decade.
Commun. ACM 24(6): 351-369 (1981) |
| 24 | | 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) |
| 1980 |
| 23 | | 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) |
| 1979 |
| 22 | EE | Joseph F. Traub,
Henryk Wozniakowski:
Convergence and Complexity of Newton Iteration for Operator Equations.
J. ACM 26(2): 250-258 (1979) |
| 1978 |
| 21 | EE | H. T. Kung,
J. F. Traub:
All Algebraic Functions Can Be Computed Fast.
J. ACM 25(2): 245-260 (1978) |
| 1977 |
| 20 | | 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) |
| 1976 |
| 19 | EE | 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) |
| 1975 |
| 18 | EE | Michael A. Jenkins,
J. F. Traub:
Principles for Testing Polynomial Zerofinding Programs.
ACM Trans. Math. Softw. 1(1): 26-34 (1975) |
| 1974 |
| 17 | | J. F. Traub:
Parallel Algorithms and Parallel Comnputational Complexity.
IFIP Congress 1974: 685-687 |
| 16 | EE | 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) |
| 15 | EE | H. T. Kung,
J. F. Traub:
Optimal Order of One-Point and Multipoint Iteration.
J. ACM 21(4): 643-651 (1974) |
| 1972 |
| 14 | | Mary Shaw,
J. F. Traub:
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives
FOCS 1972: 105-107 |
| 13 | | Michael A. Jenkins,
J. F. Traub:
Zeros of a Complex Polynomial [C2] (Algorithm 419).
Commun. ACM 15(2): 97-99 (1972) |
| 12 | | J. F. Traub:
Numerical Mathematics and Computer Science.
Commun. ACM 15(7): 537-541 (1972) |
| 11 | | J. F. Traub:
Computational Complexity of Iterative Process.
SIAM J. Comput. 1(2): 167-179 (1972) |
| 1971 |
| 10 | | J. F. Traub:
Optimal Iterative Processes: Theorems and Conjectures.
IFIP Congress (2) 1971: 1273-1277 |
| 9 | EE | W. S. Brown,
J. F. Traub:
On Euclid's Algorithm and the Theory of Subresultants.
J. ACM 18(4): 505-514 (1971) |
| 1969 |
| 8 | EE | W. S. Brown,
J. F. Traub:
MERCURY: H system for the computer-aided distribution of technical reports.
J. ACM 16(1): 13-25 (1969) |
| 1965 |
| 7 | EE | Joseph F. Traub:
American standard and IFIP / ICC vocabularies compared.
Commun. ACM 8(6): 361-362 (1965) |
| 6 | EE | 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) |
| 1964 |
| 5 | EE | J. F. Traub:
The new program of work for the international standard vocabulary in computers and information processing.
Commun. ACM 7(11): 662 (1964) |
| 1963 |
| 4 | EE | J. F. Traub:
USA participation in an international standard glossary on information processing.
Commun. ACM 6(11): 658-659 (1963) |
| 1962 |
| 3 | EE | J. F. Traub:
IFIP-62: Comments.
Commun. ACM 5(10): 500-501 (1962) |
| 1961 |
| 2 | EE | J. F. Traub:
On a class of iteration formulas and some historical notes.
Commun. ACM 4(6): 276-278 (1961) |
| 1960 |
| 1 | EE | J. F. Traub:
Comments on "A New Method of Computation of Square Roots Without Using Division".
Commun. ACM 3(2): 86 (1960) |