The SCEAS System
| |||||||

## Search the dblp DataBase
J. F. Traub:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- J. F. Traub
**Information-Based Complexity: Recent Results and Open Problems.**[Citation Graph (0, 0)][DBLP] FCT, 1991, pp:86-88 [Conf] - Mary Shaw, J. F. Traub
**On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives**[Citation Graph (0, 0)][DBLP] FOCS, 1972, pp:105-107 [Conf] - J. F. Traub
**Optimal Iterative Processes: Theorems and Conjectures.**[Citation Graph (0, 0)][DBLP] IFIP Congress (2), 1971, pp:1273-1277 [Conf] - J. F. Traub
**Parallel Algorithms and Parallel Comnputational Complexity.**[Citation Graph (0, 0)][DBLP] IFIP Congress, 1974, pp:685-687 [Conf] - Peter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, J. F. Traub
**A Discipline in Crisis.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1981, v:24, n:6, pp:370-374 [Journal] - Michael A. Jenkins, J. F. Traub
**Zeros of a Complex Polynomial [C2] (Algorithm 419).**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1972, v:15, n:2, pp:97-99 [Journal] - J. F. Traub
**Comments on "A New Method of Computation of Square Roots Without Using Division".**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1960, v:3, n:2, pp:86- [Journal] - J. F. Traub
**On a class of iteration formulas and some historical notes.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1961, v:4, n:6, pp:276-278 [Journal] - J. F. Traub
**IFIP-62: Comments.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1962, v:5, n:10, pp:500-501 [Journal] - J. F. Traub
**USA participation in an international standard glossary on information processing.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1963, v:6, n:11, pp:658-659 [Journal] - J. F. Traub
**The new program of work for the international standard vocabulary in computers and information processing.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1964, v:7, n:11, pp:662- [Journal] - J. F. Traub
**Numerical Mathematics and Computer Science.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1972, v:15, n:7, pp:537-541 [Journal] - J. F. Traub
**Quo Vadimus: Computer Science in a Decade.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1981, v:24, n:6, pp:351-369 [Journal] - Stephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler
**Meeting the Crisis in Comuter Science.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1983, v:26, n:12, pp:1046-1050 [Journal] - Stephen S. Yau, Robert W. Ritchie, Warren Semon, J. F. Traub, Andries van Dam, Stanley Winkler
**Meeting the Crisis in Computer Science.**[Citation Graph (0, 0)][DBLP] IEEE Computer, 1983, v:16, n:12, pp:83-87 [Journal] - J. F. Traub
**A Continuous Model of Computation**[Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal] - Mary Shaw, J. F. Traub
**Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1977, v:6, n:5, pp:141-145 [Journal] - W. S. Brown, J. F. Traub
**MERCURY: H system for the computer-aided distribution of technical reports.**[Citation Graph (0, 0)][DBLP] J. ACM, 1969, v:16, n:1, pp:13-25 [Journal] - W. S. Brown, J. F. Traub
**On Euclid's Algorithm and the Theory of Subresultants.**[Citation Graph (0, 0)][DBLP] J. ACM, 1971, v:18, n:4, pp:505-514 [Journal] - D. E. Heller, D. K. Stevenson, J. F. Traub
**Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers.**[Citation Graph (0, 0)][DBLP] J. ACM, 1976, v:23, n:4, pp:636-654 [Journal] - H. T. Kung, J. F. Traub
**Optimal Order of One-Point and Multipoint Iteration.**[Citation Graph (0, 0)][DBLP] J. ACM, 1974, v:21, n:4, pp:643-651 [Journal] - H. T. Kung, J. F. Traub
**All Algebraic Functions Can Be Computed Fast.**[Citation Graph (0, 0)][DBLP] J. ACM, 1978, v:25, n:2, pp:245-260 [Journal] - Mary Shaw, J. F. Traub
**On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives.**[Citation Graph (0, 0)][DBLP] J. ACM, 1974, v:21, n:1, pp:161-167 [Journal] - Richard P. Brent, J. F. Traub
**On the Complexity of Composition and Generalized Composition of Power Series.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1980, v:9, n:1, pp:54-66 [Journal] - J. F. Traub
**Computational Complexity of Iterative Process.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1972, v:1, n:2, pp:167-179 [Journal] - Michael A. Jenkins, J. F. Traub
**Principles for Testing Polynomial Zerofinding Programs.**[Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 1975, v:1, n:1, pp:26-34 [Journal]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |