default search action
Joseph F. Traub
Person information
- affiliation: Columbia University, Computer Science Department
- award (1991): IEEE Emanuel R. Piore Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2015
- [j70]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): v (2015) - [j69]Erich Novak, Klaus Ritter, Ian H. Sloan
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award. J. Complex. 31(3): v (2015) - [i8]Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, Larisa Yaroslavtseva:
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391). Dagstuhl Reports 5(9): 57-76 (2015) - 2014
- [j68]Erich Novak, Ian H. Sloan
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award. J. Complex. 30(1): v (2014) - [j67]Erich Novak, Ian H. Sloan
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award. J. Complex. 30(3): v (2014) - [j66]Erich Novak, Ian H. Sloan
Frances Kuo Wins the 2014 Information-Based Complexity Prize. J. Complex. 30(4): v (2014) - [j65]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski:
Announcement. J. Complex. 30(5): v (2014) - 2013
- [j64]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): 2293-2304 (2013) - 2012
- [j63]Joseph F. Traub:
What is the Right Computational Model for Continuous Scientific Problems? Comput. J. 55(7): 836-837 (2012) - [j62]Erich Novak, Ian H. Sloan
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. J. Complex. 28(5-6): 519 (2012) - [i7]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
- [j61]Erich Novak, Ian H. Sloan
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. J. Complex. 27(6): 501 (2011) - [j60]Joseph F. Traub:
Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems? Ubiquity 2011(January): 2 (2011)
2000 – 2009
- 2009
- [j59]Joseph F. Traub:
Editorial Board Changes. J. Complex. 25(1): 1 (2009) - [j58]Joseph F. Traub:
Our Silver Anniversary. J. Complex. 25(6): 509 (2009) - [j57]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski:
Changes to the Editorial Board. J. Complex. 25(6): 510 (2009) - [e3]Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009. Dagstuhl Seminar Proceedings 09391, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [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]Joseph F. Traub, Arthur G. Werschulz:
Information-based Complexity and Information-based Optimization. Encyclopedia of Optimization 2009: 1603-1608 - [i6]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 - 2007
- [j56]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
From the Editors. J. Complex. 23(1): 1 (2007) - [e2]Stephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub:
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 [contents] - 2006
- [i5]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
- [j55]Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich
Guest editors' preface. J. Complex. 21(1): 4- (2005) - [e1]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. Dagstuhl Seminar Proceedings 04401, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - 2004
- [j54]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
From the Editors. J. Complex. 20(1): 1-2 (2004) - [i4]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 - [i3]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
- [j53]Joseph F. Traub:
FROM THE EDITOR. J. Complex. 18(3): 679- (2002) - [j52]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
2001 Best Paper Award. J. Complex. 18(3): 680- (2002) - [j51]Joseph F. Traub, Henryk Wozniakowski:
Path Integration on a Quantum Computer. Quantum Inf. Process. 1(5): 365-388 (2002) - 2001
- [j50]Joseph F. Traub:
Computing: Yesterday, today, and tomorrow. Complex. 6(6): 15-18 (2001) - [j49]Joseph F. Traub:
Quantum Computing. J. Complex. 17(1): 1- (2001) - [j48]Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
ANNOUNCEMENT: 2000 Best Paper Award. J. Complex. 17(3): 494- (2001) - [i2]Joseph F. Traub:
A Continuous Model of Computation. CoRR physics/0106045 (2001) - 2000
- [j47]Joseph F. Traub:
From the Editor. J. Complex. 16(3): 525 (2000) - [j46]Joseph F. Traub:
From the Editor. J. Complex. 16(4): 639 (2000) - [i1]Anargyros Papageorgiou, Joseph F. Traub:
Faster Evaluation of Multidimensional Integrals. CoRR physics/0011053 (2000)
1990 – 1999
- 1999
- [j45]Joseph F. Traub:
From the Editor. J. Complex. 15(4): 449- (1999) - 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 - [j44]Piet Hut, David Ruelle, Joseph F. Traub:
Varieties of limits to scientific knowledge. Complex. 3(6): 33-38 (1998) - 1997
- [j43]James B. Hartle, Piet Hut, Joseph F. Traub:
Editorial. Complex. 3(1): 8 (1997) - [j42]Joseph F. Traub:
Do negative results from formal systems limit scientific knowledge? Complex. 3(1): 29-31 (1997) - [j41]Joseph F. Traub:
Best Paper Award. J. Complex. 13(1): 1- (1997) - [j40]Joseph F. Traub:
A Note from the Editor. J. Complex. 13(4): 385- (1997) - 1993
- [j39]Joseph F. Traub, Henryk Wozniakowski:
Recent progress in information-based complexity. Bull. EATCS 51: 141-154 (1993) - 1992
- [j38]Edward W. Packel, Joseph F. Traub, Henryk Wozniakowski:
Measures of uncertainty and information in computation. Inf. Sci. 65(3): 253-273 (1992) - 1991
- [j37]Joseph F. Traub:
Solvability of III-posed problems: An historical note. J. Complex. 7(3): 219- (1991) - [c10]Joseph F. Traub:
Information-Based Complexity: Recent Results and Open Problems. FCT 1991: 86-88
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
- [j36]Joseph F. Traub:
From the Editor. J. Complex. 2(1): 1- (1986) - 1985
- [j35]Joseph F. Traub:
Why a journal of complexity? J. Complex. 1(1): 1- (1985) - [j34]Joseph F. Traub:
Complexity of approximately solved problems. J. Complex. 1(1): 3-10 (1985) - [j33]Joseph F. Traub:
From the editor. J. Complex. 1(2): 169- (1985) - 1984
- [j32]Joseph F. Traub, Henryk Wozniakowski:
Information and Computation. Adv. Comput. 23: 35-92 (1984) - [j31]Joseph F. Traub, Henryk Wozniakowski:
On the Optimal Solution of Large Linear Systems. J. ACM 31(3): 545-559 (1984) - [j30]Joseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Average Case Optimality for Linear Problems. Theor. Comput. Sci. 29: 1-25 (1984) - [j29]Joseph F. Traub, Yechiam Yemini, Henryk Wozniakowski:
The Statistical Security of a Statistical Database. ACM Trans. Database Syst. 9(4): 672-679 (1984) - 1983
- [j28]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): 1046-1050 (1983) - [j27]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): 83-87 (1983) - 1982
- [j26]Joseph F. Traub, Henryk Wozniakowski:
Complexity of linear programming. Oper. Res. Lett. 1(2): 59-62 (1982) - 1981
- [j25]Joseph F. Traub:
Quo Vadimus: Computer Science in a Decade. Commun. ACM 24(6): 351-369 (1981) - [j24]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): 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 - [j23]Richard P. Brent, Joseph F. Traub:
On the Complexity of Composition and Generalized Composition of Power Series. SIAM J. Comput. 9(1): 54-66 (1980)
1970 – 1979
- 1979
- [j22]Joseph F. Traub, Henryk Wozniakowski:
Convergence and Complexity of Newton Iteration for Operator Equations. J. ACM 26(2): 250-258 (1979) - 1978
- [j21]H. T. Kung, Joseph F. Traub:
All Algebraic Functions Can Be Computed Fast. J. ACM 25(2): 245-260 (1978) - 1977
- [j20]Mary Shaw
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. Inf. Process. Lett. 6(5): 141-145 (1977) - 1976
- [j19]Don Eric Heller, D. K. Stevenson, Joseph F. Traub:
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers. J. ACM 23(4): 636-654 (1976) - [j18]Joseph F. Traub:
Some general observations on Ph.D. production in computer science. ACM SIGCSE Bull. 8(4): 8-9 (1976) - 1975
- [j17]Michael A. Jenkins, Joseph F. Traub:
Principles for Testing Polynomial Zerofinding Programs. ACM Trans. Math. Softw. 1(1): 26-34 (1975) - 1974
- [j16]Mary Shaw
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. J. ACM 21(1): 161-167 (1974) - [j15]H. T. Kung, Joseph F. Traub:
Optimal Order of One-Point and Multipoint Iteration. J. ACM 21(4): 643-651 (1974) - [c9]Joseph F. Traub:
Parallel Algorithms and Parallel Comnputational Complexity. IFIP Congress 1974: 685-687 - 1973
- [c8]D. K. Stevenson, Joseph F. Traub:
Iterative solution of block tridiagonal systems on parallel or vector computers. ACM Annual Conference 1973 - [c7]Joseph F. Traub:
Invited speaker. ACM Conference on Computer Science 1973: 39 - 1972
- [j14]Michael A. Jenkins, Joseph F. Traub:
Zeros of a Complex Polynomial [C2] (Algorithm 419). Commun. ACM 15(2): 97-99 (1972) - [j13]Joseph F. Traub:
Numerical Mathematics and Computer Science. Commun. ACM 15(7): 537-541 (1972) - [j12]Joseph F. Traub:
Computational Complexity of Iterative Processes. SIAM J. Comput. 1(2): 167-179 (1972) - [c6]Donald G. M. Anderson, William Kahan, Joseph F. Traub:
George Forsythe memorial lecture (Panel Session). ACM Annual Conference (2) 1972: 663 - [c5]Mary Shaw
On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives. SWAT 1972: 105-107 - 1971
- [j11]W. S. Brown, Joseph F. Traub:
On Euclid's Algorithm and the Theory of Subresultants. J. ACM 18(4): 505-514 (1971) - [c4]Joseph F. Traub:
Optimal Iterative Processes: Theorems and Conjectures. IFIP Congress (2) 1971: 1273-1277 - 1970
- [j10]George E. Forsythe, Bernard A. Galler, Juris Hartmanis, Alan J. Perlis, Joseph F. Traub:
Computer science and mathematics. ACM SIGCSE Bull. 2(4): 19-29 (1970)
1960 – 1969
- 1969
- [j9]W. S. Brown, Joseph F. Traub:
MERCURY: H system for the computer-aided distribution of technical reports. J. ACM 16(1): 13-25 (1969) - 1968
- [c3]W. Morven Gentleman, Joseph F. Traub:
The bell laboratories numerical mathematics program library project. ACM National Conference 1968: 485-490 - 1966
- [j8]Joseph F. Traub:
Notice: Newsletter for Numerical Analysts. Comput. J. 8(4): 340 (1966) - 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]Joseph 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]Joseph F. Traub:
USA participation in an international standard glossary on information processing. Commun. ACM 6(11): 658-659 (1963) - 1962
- [j3]Joseph F. Traub:
IFIP-62: Comments. Commun. ACM 5(10): 500-501 (1962) - [c2]Joseph F. Traub:
Invited papers: The theory of multipoint iteration functions. ACM National Conference 1962: 80-81 - 1961
- [j2]Joseph F. Traub:
On a class of iteration formulas and some historical notes. Commun. ACM 4(6): 276-278 (1961) - [c1]Joseph F. Traub:
On functional iteration and the calculation of roots. ACM National Meeting 1961: 51 - 1960
- [j1]Joseph F. Traub:
Comments on "A New Method of Computation of Square Roots Without Using Division". Commun. ACM 3(2): 86 (1960)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: