Information-based complexity
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Complexity and information
MERCURY: H system for the computer-aided distribution of technical reports
Journal of the ACM (JACM)
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
Journal of the ACM (JACM)
All Algebraic Functions Can Be Computed Fast
Journal of the ACM (JACM)
Complexity of Sequential and Parallel Numerical Algorithms
Complexity of Sequential and Parallel Numerical Algorithms
Quantum computation and quantum information
Quantum computation and quantum information
Algorithms in modern mathematics and computer science
Proceedings on Algorithms in Modern Mathematics and Computer Science
On functional iteration and the calculation of roots
ACM '61 Proceedings of the 1961 16th ACM national meeting
| Hi-index | 0.01 |
Joseph F. Traub is the Edwin Howard Armstrong Professor of Computer Science at Columbia University and External Professor, Santa Fe Institute. In this wide-ranging interview, he discusses his early research, organizations and other entities he has created, and offers his view on several open-ended topics on the future of computing. --Editor