Joseph F. Traub

According to our database1, Joseph F. Traub authored at least 80 papers between 1960 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

ACM Fellow

ACM Fellow 1994, "For pioneering research on information-based complexity, computational finance, optimal iteration theory, parallel computing, national science policy, and for leadership in computing education.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award.
J. Complex., 2015

Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award.
J. Complex., 2015

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391).
Dagstuhl Reports, 2015

2014
Announcement.
J. Complex., 2014

Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award.
J. Complex., 2014

Frances Kuo Wins the 2014 Information-Based Complexity Prize.
J. Complex., 2014

Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award.
J. Complex., 2014

2013
A fast algorithm for approximating the ground state energy on a quantum computer.
Math. Comput., 2013

2012
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award.
J. Complex., 2012

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391).
Dagstuhl Reports, 2012

What is the Right Computational Model for Continuous Scientific Problems?
Comput. J., 2012

2011
Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems?
Ubiquity, 2011

Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award.
J. Complex., 2011

2009
Information-based Complexity and Information-based Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Quantum Information Science, Introduction to.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Quantum Algorithms and Complexity for Continuous Problems.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Our Silver Anniversary.
J. Complex., 2009

Editorial Board Changes.
J. Complex., 2009

Changes to the Editorial Board.
J. Complex., 2009

09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems.
Proceedings of the Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009, 2009

2006
06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems.
Proceedings of the Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006, 2006

2005
Guest editors' preface.
J. Complex., 2005

2004
From the Editors.
J. Complex., 2004

04401 Abstracts Collection - Algorithms and Complexity for Continuous.
Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

04401 Summary - Algorithms and Complexity for Continuous Problems.
Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

2002
Path Integration on a Quantum Computer.
Quantum Inf. Process., 2002

2001 Best Paper Award.
J. Complex., 2002

2001
Quantum Computing.
J. Complex., 2001

ANNOUNCEMENT: 2000 Best Paper Award.
J. Complex., 2001

A Continuous Model of Computation
CoRR, 2001

Computing: Yesterday, today, and tomorrow.
Complex., 2001

2000
Faster Evaluation of Multidimensional Integrals
CoRR, 2000

1999
From the Editor.
J. Complex., 1999

1998
Varieties of limits to scientific knowledge.
Complex., 1998

Complexity and information.
Lezioni Lincee, Cambridge University Press, ISBN: 978-0-521-48005-5, 1998

1997
A Note from the Editor.
J. Complex., 1997

Best Paper Award.
J. Complex., 1997

Do negative results from formal systems limit scientific knowledge?
Complex., 1997

Editorial.
Complex., 1997

1993
Recent progress in information-based complexity.
Bull. EATCS, 1993

1992
Measures of uncertainty and information in computation.
Inf. Sci., 1992

1991
Solvability of III-posed problems: An historical note.
J. Complex., 1991

Information-Based Complexity: Recent Results and Open Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1988
Information-based complexity.
Computer science and scientific computing, Academic Press, ISBN: 978-0-12-697545-1, 1988

1985
Complexity of approximately solved problems.
J. Complex., 1985

Why a journal of complexity?
J. Complex., 1985

1984
The Statistical Security of a Statistical Database.
ACM Trans. Database Syst., 1984

Average Case Optimality for Linear Problems.
Theor. Comput. Sci., 1984

On the Optimal Solution of Large Linear Systems.
J. ACM, 1984

Information and Computation.
Adv. Comput., 1984

1983
Meeting the Crisis in Computer Science.
Computer, 1983

1982
Complexity of linear programming.
Oper. Res. Lett., 1982

1981
Quo Vadimus: Computer Science in a Decade.
Commun. ACM, 1981

A Discipline in Crisis.
Commun. ACM, 1981

1980
On the Complexity of Composition and Generalized Composition of Power Series.
SIAM J. Comput., 1980

A general theory of optimal algorithms.
ACM monograph series, Academic Press, ISBN: 978-0-12-697650-2, 1980

1979
Convergence and Complexity of Newton Iteration for Operator Equations.
J. ACM, 1979

1978
All Algebraic Functions Can Be Computed Fast.
J. ACM, 1978

1977
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation.
Inf. Process. Lett., 1977

1976
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers.
J. ACM, 1976

1975
Principles for Testing Polynomial Zerofinding Programs.
ACM Trans. Math. Softw., 1975

1974
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives.
J. ACM, 1974

Optimal Order of One-Point and Multipoint Iteration.
J. ACM, 1974

Parallel Algorithms and Parallel Comnputational Complexity.
Proceedings of the Information Processing, 1974

1973
Iterative solution of block tridiagonal systems on parallel or vector computers.
Proceedings of the ACM annual conference, Atlanta, Georgia, USA, August 27-29, 1973, 1973

1972
Computational Complexity of Iterative Processes.
SIAM J. Comput., 1972

Numerical Mathematics and Computer Science.
Commun. ACM, 1972

Zeros of a Complex Polynomial [C2] (Algorithm 419).
Commun. ACM, 1972

On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

1971
On Euclid's Algorithm and the Theory of Subresultants.
J. ACM, 1971

Optimal Iterative Processes: Theorems and Conjectures.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971

1969
MERCURY: H system for the computer-aided distribution of technical reports.
J. ACM, 1969

1966
Notice: Newsletter for Numerical Analysts.
Comput. J., 1966

1965
American standard and IFIP / ICC vocabularies compared.
Commun. ACM, 1965

Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchange.
Commun. ACM, 1965

1964
The new program of work for the international standard vocabulary in computers and information processing.
Commun. ACM, 1964

1963
USA participation in an international standard glossary on information processing.
Commun. ACM, 1963

1962
IFIP-62: Comments.
Commun. ACM, 1962

1961
On a class of iteration formulas and some historical notes.
Commun. ACM, 1961

1960
Comments on "A New Method of Computation of Square Roots Without Using Division".
Commun. ACM, 1960


  Loading...