WorldCat Identities

Traub, J. F. (Joseph Frederick) 1932-

Overview
Works: 99 works in 200 publications in 4 languages and 7,148 library holdings
Genres: Periodicals  Conference proceedings 
Roles: Author, Editor, Honoree, Creator
Classifications: QA297, 005.3
Publication Timeline
.
Most widely held works about J. F Traub
 
moreShow More Titles
fewerShow Fewer Titles
Most widely held works by J. F Traub
Supercomputers directions in technology and applications by National Research Council Staff( )
4 editions published in 1989 in English and held by 1,262 WorldCat member libraries worldwide
Scaling up a research agenda for software engineering by National Research Council (U.S.)( )
2 editions published in 1989 in English and held by 1,192 WorldCat member libraries worldwide
Large and growing opportunity costs are resulting from the inability to produce sophisticated, reliable software in a timely manner. Software engineering presents stubborn problems, but in this book, a group of experts suggest several constructive directions for research. Together, they support the need for greater interaction between researchers and practitioners and more aggressive efforts to share and reuse software engineering knowledge
The national challenge in computer science and technology by National Research Council (U.S.)( )
3 editions published in 1988 in English and held by 834 WorldCat member libraries worldwide
Iterative methods for the solution of equations by J. F Traub( Book )
12 editions published between 1964 and 1982 in English and Undetermined and held by 736 WorldCat member libraries worldwide
Complexity and information by J. F Traub( Book )
18 editions published between 1998 and 2000 in English and Japanese and held by 518 WorldCat member libraries worldwide
A general theory of optimal algorithms by J. F Traub( Book )
12 editions published between 1980 and 1983 in 3 languages and held by 474 WorldCat member libraries worldwide
Information, uncertainty, complexity by J. F Traub( Book )
6 editions published in 1983 in English and Undetermined and held by 352 WorldCat member libraries worldwide
Analytic computational complexity by Symposium on Analytic Computational Complexity( Book )
10 editions published in 1976 in English and Undetermined and held by 319 WorldCat member libraries worldwide
Information-based complexity by J. F Traub( Book )
9 editions published in 1988 in English and Undetermined and held by 307 WorldCat member libraries worldwide
Complexity of sequential and parallel numerical algorithms [proceedings] by J. F Traub( Book )
9 editions published in 1973 in English and Italian and held by 305 WorldCat member libraries worldwide
Cohabiting with computers ( Book )
10 editions published between 1984 and 1987 in English and Japanese and held by 270 WorldCat member libraries worldwide
Algorithms and complexity for continuous problems Dagstuhl seminar ; 06391 abstracts collection ( )
2 editions published in 2007 in English and held by 17 WorldCat member libraries worldwide
Annual review of computer science : Vol. 1, 1986 ( Book )
1 edition published in 1986 in English and held by 14 WorldCat member libraries worldwide
Annual review of computer science : Vol. 2, 1987 ( Book )
1 edition published in 1987 in English and held by 10 WorldCat member libraries worldwide
Annual review of computer science : vol. 4, 1989-1990 ( Book )
1 edition published in 1990 in English and held by 9 WorldCat member libraries worldwide
Annual review of computer science : Vol. 3, 1988 ( Book )
1 edition published in 1988 in English and held by 7 WorldCat member libraries worldwide
Annual review of computer science ( )
in English and held by 7 WorldCat member libraries worldwide
All algebraic functions can be computed fast by H. T Kung( Book )
1 edition published in 1976 in English and held by 6 WorldCat member libraries worldwide
The expansions of algebraic functions can be computed 'fast' using the Newton Polygon Process and any 'normal' iteration. Let M(j) be the number of operations sufficient to multiply two jth degree polynomials. It is shown that the first N terms of an expansion of any algebraic function defined by an nth degree polynomial can be computed in O(n(M(N)) operations, while the classical method needs O(N sup n) operations. Among the numerous applications of algebraic functions are symbolic mathematics and combinatorial analysis. Reversion, reciprocation, and nth root of a polynomial are all special cases of algebraic functions
Accelerated iterative methods for the solution of tridiagonal systems on parallel computers by D. E Heller( Book )
1 edition published in 1974 in English and held by 5 WorldCat member libraries worldwide
The authors consider iterative methods for the solution of tridiagonal systems and present a new iteration whose rate of convergence is comparable to that of the optimal two-cyclic Chebyshev iteration but which does not require the calculation of optimal parameters. The theory has a natural extension to block tridiagonal systems. Numerical experiments suggest that on a parallel computer this new algorithm is the best of the iterative algorithms considered
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.61 (from 0.00 for Oral histo ... to 1.00 for Oral histo ...)
Alternative Names
Traub, Dž.
Traub, Džozef Fredrik 1932-
Traub, J. F.
Traub, J. F. 1932-
Traub, Joe Fred.
Traub Joe Fred 1932-....
Traub, Joseph F.
Traub, Joseph F. 1932-
Traub, Joseph F. (Joseph Frederick), 1932-
Traub, Joseph Frederick.
Traub, Joseph Frederick 1932-
Трауб, Дж 1932-
トラウブ, ジョセフ・F
Languages
English (108)
Japanese (3)
Italian (2)
Russian (2)
Covers