J. F. Traub
J. F. Traub
Edwin Howard Armstrong Professor of Computer Science, Columbia University
Verified email at cs.columbia.edu - Homepage
Title
Cited by
Cited by
Year
Iterative methods for the solution of equations
JF Traub
American Mathematical Soc., 1982
30201982
Information-based complexity
JF Traub
Encyclopedia of Computer Science, 850-854, 2003
14462003
A general theory of optimal algorithms
JF Traub
7381980
Optimal order of one-point and multipoint iteration
HT Kung, JF Traub
Journal of the ACM (JACM) 21 (4), 643-651, 1974
7061974
Faster valuation of financial derivatives
S Paskov, JF Traub
5201996
On Euclid's algorithm and the theory of subresultants
WS Brown, JF Traub
Journal of the ACM (JACM) 18 (4), 505-514, 1971
3491971
Complexity and information
JF Traub, AG Werschulz
Cambridge University Press, 1998
3391998
Agent-based modeling
D Helbing
Social self-organization, 25-70, 2012
3032012
Information, uncertainty, complexity
JF Traub, GW Wasilkowski, H Woźniakowski
Addison-Wesley, 1983
233*1983
A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
MA Jenkins, JF Traub
Numerische Mathematik 14 (3), 252-263, 1970
2321970
The statistical security of a statistical database
JF Traub, Y Yemini, H Woźniakowski
ACM Transactions on Database Systems (TODS) 9 (4), 672-679, 1984
2191984
The uses of big data in cities
LMA Bettencourt
Big data 2 (1), 12-22, 2014
218*2014
A three-stage algorithm for real polynomials using quadratic iteration
MA Jenkins, JF Traub
SIAM Journal on Numerical Analysis 7 (4), 545-566, 1970
2001970
The algebraic theory of matrix polynomials
JE Dennis, Jr, JF Traub, RP Weber
SIAM Journal on Numerical Analysis 13 (6), 831-845, 1976
1971976
Convergence and complexity of Newton iteration for operator equations
JF Traub, H Woźniakowski
Journal of the ACM (JACM) 26 (2), 250-258, 1979
1611979
All algebraic functions can be computed fast
HT Kung, JF Traub
Journal of the ACM (JACM) 25 (2), 245-260, 1978
1361978
Estimation method and system for complex securities using low-discrepancy deterministic sequences
JF Traub, S Paskov, IF Vanderhoof
US Patent 5,940,810, 1999
1291999
Algorithm 419: zeros of a complex polynomial [C2]
MA Jenkins, JF Traub
Communications of the ACM 15 (2), 97-99, 1972
1171972
Editor's comments: does MIS have native theories?
D Straub
MIS quarterly, iii-xii, 2012
1132012
Beating monte carlo
A Papageorgiou, JF Traub
Risk 9 (6), 63-65, 1996
1031996
The system can't perform the operation now. Try again later.
Articles 1–20