Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
J. F. Traub
Joseph F. Traub
2010 – today
- 2012
[j57]Joseph F. Traub: What is the Right Computational Model for Continuous Scientific Problems? Comput. J. 55(7): 836-837 (2012)
[j56]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)
[i3]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)- 2011
[j55]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)
2000 – 2009
- 2009
[j54]
[j53]
[j52]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Changes to the Editorial Board. J. Complexity 25(6): 510 (2009)
[r3]Anargyros Papageorgiou, Joseph F. Traub: Quantum Algorithms and Complexity for Continuous Problems. Encyclopedia of Complexity and Systems Science 2009: 7118-7135
[r2]Joseph F. Traub: Quantum Information Science, Introduction to. Encyclopedia of Complexity and Systems Science 2009: 7399-7400
[r1]J. F. Traub, Arthur G. Werschulz: Information-based Complexity and Information-based Optimization. Encyclopedia of Optimization 2009: 1603-1608- 2007
[j51]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: From the Editors. J. Complexity 23(1): 1 (2007)
[e2]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- 2006
[c7]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
[j50]Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub: Guest editors' preface. J. Complexity 21(1): 4- (2005)
[e1]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- 2004
[j49]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: From the Editors. J. Complexity 20(1): 1-2 (2004)
[c6]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
[c5]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- 2002
[j48]
[j47]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: 2001 Best Paper Award. J. Complexity 18(3): 680- (2002)- 2001
[j46]
[j45]
[j44]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski: ANNOUNCEMENT: 2000 Best Paper Award. J. Complexity 17(3): 494- (2001)
[i2]- 2000
[j43]
[j42]
[i1]Anargyros Papageorgiou, Joseph F. Traub: Faster Evaluation of Multidimensional Integrals. CoRR physics/0011053 (2000)
1990 – 1999
- 1999
[j41]- 1998
[b3]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
[j40]Piet Hut, David Ruelle, Joseph F. Traub: Varieties of limits to scientific knowledge. Complexity 3(6): 33-38 (1998)- 1997
[j39]
[j38]J. F. Traub: Do negative results from formal systems limit scientific knowledge? Complexity 3(1): 29-31 (1997)
[j37]
[j36]- 1993
[j35]Joseph F. Traub, Henryk Wozniakowski: Recent progress in information-based complexity. Bulletin of the EATCS 51: 141-154 (1993)- 1992
[j34]Edward W. Packel, Joseph F. Traub, Henryk Wozniakowski: Measures of uncertainty and information in computation. Inf. Sci. 65(3): 253-273 (1992)- 1991
[j33]Joseph F. Traub: Solvability of III-posed problems: An historical note. J. Complexity 7(3): 219- (1991)
[c4]
1980 – 1989
- 1988
[b2]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- 1986
[j32]- 1985
[j31]
[j30]
[j29]- 1984
[j28]Joseph F. Traub, Henryk Wozniakowski: Information and Computation. Advances in Computers 23: 35-92 (1984)
[j27]Joseph F. Traub, Henryk Wozniakowski: On the Optimal Solution of Large Linear Systems. J. ACM 31(3): 545-559 (1984)
[j26]Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski: Average Case Optimality for Linear Problems. Theor. Comput. Sci. 29: 1-25 (1984)
[j25]Joseph F. Traub, Yechiam Yemini, Henryk Wozniakowski: The Statistical Security of a Statistical Database. ACM Trans. Database Syst. 9(4): 672-679 (1984)- 1983
[j24]Stephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler: Meeting the Crisis in Computer Science. Commun. ACM 26(12): 1046-1050 (1983)
[j23]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
[j22]
[j21]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
[b1]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
[j20]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)
1970 – 1979
- 1979
[j19]Joseph F. Traub, Henryk Wozniakowski: Convergence and Complexity of Newton Iteration for Operator Equations. J. ACM 26(2): 250-258 (1979)- 1978
[j18]- 1977
[j17]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
[j16]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
[j15]Michael A. Jenkins, J. F. Traub: Principles for Testing Polynomial Zerofinding Programs. ACM Trans. Math. Softw. 1(1): 26-34 (1975)- 1974
[j14]
[j13]H. T. Kung, J. F. Traub: Optimal Order of One-Point and Multipoint Iteration. J. ACM 21(4): 643-651 (1974)
[c3]J. F. Traub: Parallel Algorithms and Parallel Comnputational Complexity. IFIP Congress 1974: 685-687- 1972
[j12]Michael A. Jenkins, J. F. Traub: Zeros of a Complex Polynomial [C2] (Algorithm 419). Commun. ACM 15(2): 97-99 (1972)
[j11]
[j10]
[c2]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- 1971
[j9]W. S. Brown, J. F. Traub: On Euclid's Algorithm and the Theory of Subresultants. J. ACM 18(4): 505-514 (1971)
[c1]J. F. Traub: Optimal Iterative Processes: Theorems and Conjectures. IFIP Congress (2) 1971: 1273-1277
1960 – 1969
- 1969
[j8]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
[j7]Joseph F. Traub: American standard and IFIP / ICC vocabularies compared. Commun. ACM 8(6): 361-362 (1965)
[j6]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
[j5]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
[j4]J. F. Traub: USA participation in an international standard glossary on information processing. Commun. ACM 6(11): 658-659 (1963)- 1962
[j3]- 1961
[j2]J. F. Traub: On a class of iteration formulas and some historical notes. Commun. ACM 4(6): 276-278 (1961)- 1960
[j1]J. F. Traub: Comments on "A New Method of Computation of Square Roots Without Using Division". Commun. ACM 3(2): 86 (1960)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team



