Joseph F. Traub - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 63 from 63

2015

2014

2013

A fast algorithm for approximating the ground state energy on a quantum computerAnargyros Papageorgiou, Iasonas Petras, Joseph F. Traub, Chi Zhang. moc, 82(284):2293-2304, 2013. [doi]

2012

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)Alexander Keller, Frances Y. Kuo, Andreas Neuenkirch, Joseph F. Traub. dagstuhl-reports, 2(9):200-225, 2012. [doi]

Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper AwardErich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski. jc, 28(5-6):519, 2012. [doi]

What is the Right Computational Model for Continuous Scientific Problems?Joseph F. Traub. cj, 55(7):836-837, 2012. [doi]

2011

Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper AwardErich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski. jc, 27(6):501, 2011. [doi]

Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems?Joseph F. Traub. ubiquity, 2011(January):2, 2011. [doi]

2009

2007

From the EditorsHarald Niederreiter, Joseph F. Traub, Henryk Wozniakowski. jc, 23(1):1, 2007. [doi]

2006

06391 Abstracts Collection -- Algorithms and Complexity for Continuous ProblemsStephan Dahlke, Klaus Ritter, Ian H. Sloan, Joseph F. Traub. Dagstuhl 2007: [doi]

2005

Guest editors prefaceAskold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub. jc, 21(1):4, 2005. [doi]

2004

2002

2001 Best Paper AwardHarald Niederreiter, Joseph F. Traub, Henryk Wozniakowski. jc, 18(3):680, 2002. [doi]

FROM THE EDITORJoseph F. Traub. jc, 18(3):679, 2002. [doi]

Path Integration on a Quantum ComputerJoseph F. Traub, Henryk Wozniakowski. qip, 1(5):365-388, 2002. [doi]

2001

ANNOUNCEMENT: 2000 Best Paper AwardHarald Niederreiter, Joseph F. Traub, Henryk Wozniakowski. jc, 17(3):494, 2001. [doi]

Quantum ComputingJoseph F. Traub. jc, 17(1):1, 2001. [doi]

Computing: Yesterday, today, and tomorrowJoseph F. Traub. complexity, 6(6):15-18, 2001. [doi]

2000

From the EditorJoseph F. Traub. jc, 16(4):639, 2000. [doi]

From the EditorJoseph F. Traub. jc, 16(3):525, 2000. [doi]

1999

From the EditorJoseph F. Traub. jc, 15(4):449, 1999. [doi]

1998

Varieties of limits to scientific knowledgePiet Hut, David Ruelle, Joseph F. Traub. complexity, 3(6):33-38, 1998. [doi]

Complexity and informationJoseph F. Traub, Arthur G. Werschulz. Lezioni Lincee, Cambridge University Press, 1998.

1997

EditorialJames B. Hartle, Piet Hut, Joseph F. Traub. complexity, 3(1):8, 1997. [doi]

A Note from the EditorJoseph F. Traub. jc, 13(4):385, 1997. [doi]

Best Paper AwardJoseph F. Traub. jc, 13(1):1, 1997. [doi]

1993

Recent progress in information-based complexityJoseph F. Traub, Henryk Wozniakowski. eatcs, 51:141-154, 1993.

1992

Measures of uncertainty and information in computationEdward W. Packel, Joseph F. Traub, Henryk Wozniakowski. isci, 65(3):253-273, 1992. [doi]

1991

Solvability of III-posed problems: An historical noteJoseph F. Traub. jc, 7(3):219, 1991. [doi]

1988

Information-based complexityJoseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski. Computer science and scientific computing, Academic Press, 1988.

1986

From the EditorJoseph F. Traub. jc, 2(1):1, 1986. [doi]

1985

Complexity of approximately solved problemsJoseph F. Traub. jc, 1(1):3-10, 1985. [doi]

From the editorJoseph F. Traub. jc, 1(2):169, 1985. [doi]

Why a journal of complexity?Joseph F. Traub. jc, 1(1):1, 1985. [doi]

1984

Information and ComputationJoseph F. Traub, Henryk Wozniakowski. ac, 23:35-92, 1984.

The Statistical Security of a Statistical DatabaseJoseph F. Traub, Yechiam Yemini, Henryk Wozniakowski. TODS, 9(4):672-679, 1984. [doi]

Average Case Optimality for Linear ProblemsJoseph F. Traub, Grzegorz W. Wasilkowski, Henryk Wozniakowski. TCS, 29:1-25, 1984.

On the Optimal Solution of Large Linear SystemsJoseph F. Traub, Henryk Wozniakowski. JACM, 31(3):545-559, 1984. [doi]

1982

Complexity of linear programmingJoseph F. Traub, Henryk Wozniakowski. orl, 1(2):59-62, 1982. [doi]

1980

A general theory of optimal algorithmsJoseph F. Traub, Henryk Wozniakowski. ACM monograph series, Academic Press, 1980.

1979

Convergence and Complexity of Newton Iteration for Operator EquationsJoseph F. Traub, Henryk Wozniakowski. JACM, 26(2):250-258, 1979. [doi]

1976

Some general observations on Ph.D. production in computer scienceJoseph F. Traub. SIGCSE, 8(4):8-9, 1976. [doi]

1973

Iterative solution of block tridiagonal systems on parallel or vector computersD. K. Stevenson, Joseph F. Traub. acm 1973: [doi]

Invited speakerJoseph F. Traub. acmcsc 1973: 39 [doi]

1972

George Forsythe memorial lecture (Panel Session)Donald G. M. Anderson, William Kahan, Joseph F. Traub. acm 1972: 663 [doi]

1970

Computer science and mathematicsGeorge E. Forsythe, Bernard A. Galler, Juris Hartmanis, Alan J. Perlis, Joseph F. Traub. SIGCSE, 2(4):19-29, 1970. [doi]

1968

The bell laboratories numerical mathematics program library projectW. Morven Gentleman, Joseph F. Traub. acm 1968: 485-490 [doi]

1966

Notice: Newsletter for Numerical AnalystsJoseph F. Traub. cj, 8(4):340, 1966. [doi]

1965

Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchangeE. L. Lohse, R. V. Smith, Joseph F. Traub, Saul Gorn. CACM, 8(9):553-556, 1965. [doi]

American standard and IFIP / ICC vocabularies comparedJoseph F. Traub. CACM, 8(6):361-362, 1965. [doi]

1962

Invited papers: The theory of multipoint iteration functionsJoseph F. Traub. acm 1962: 80-81 [doi]

1961

On functional iteration and the calculation of rootsJoseph F. Traub. acm 1961: 51 [doi]

Sign in or sign up to see more results.

runs on WebDSL