Timothy J. Long

Publication Activity (10 Years)

Years Active: 1979-2007
Publications (10 Years): 0

Publications

Bruce M. Adcock, Paolo Bucci, Wayne D. Heym, Joseph E. Hollingsworth, Timothy J. Long, Bruce W. Weide
Which pointer errors do students make? SIGCSE (2007)
Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide
Algorithms and object-oriented programming: bridging the gap. SIGCSE (2002)
Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang
Teaching Component-Based Software Engineering: A Formal Approach and Its Evaluation. Comput. Sci. Educ. 12 (1-2) (2002)
Paolo Bucci, Timothy J. Long, Bruce W. Weide
Do we really teach abstraction? SIGCSE (2001)
Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang
A Formal Approach to Component-Based Software Engineering: Education and Evaluation. ICSE (2001)
Murali Sitaraman, Steven Atkinson, Gregory Kulczycki, Bruce W. Weide, Timothy J. Long, Paolo Bucci, Wayne D. Heym, Scott M. Pike, Joseph E. Hollingsworth
Reasoning about Software-Component Behavior. ICSR (2000)
Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman
Client view first: an exodus from implementation-biased teaching. SIGCSE (1999)
Timothy J. Long, Bruce W. Weide, Paolo Bucci, David S. Gibson, Joseph E. Hollingsworth, Murali Sitaraman, Stephen H. Edwards
Providing intellectual focus to CS1/CS2. SIGCSE (1998)
Paolo Bucci, Timothy J. Long, Bruce W. Weide
Teaching software architecture principles in CS1/CS2. ISAW@FSE (1998)
Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden
A Data Abstraction Alternative to Data Structure/Algorithm Modularization. Generic Programming (1998)
Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden
Characterizing observability and controllability of software components. ICSR (1996)
Ming-Jye Sheu, Timothy J. Long
UP and the Low and High Hierarchies: A Relativized Separatin. Math. Syst. Theory 29 (5) (1996)
Timothy J. Long, Ming-Jye Sheu
A Refinement of the Low and High Hierarchies. Math. Syst. Theory 28 (4) (1995)
Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, Murali Sitaraman, Bruce W. Weide
Part II: specifying components in RESOLVE. ACM SIGSOFT Softw. Eng. Notes 19 (4) (1994)
Ming-Jye Sheu, Timothy J. Long
The Extended Low Hierarchy is an Infinite Hierarchy. SIAM J. Comput. 23 (3) (1994)
Ming-Jye Sheu, Timothy J. Long
The Extended Low Hierarchy Is an Infinite Hierarchy. STACS (1992)
Ming-Jye Sheu, Timothy J. Long
UP and the Low and High Hierarchies: A Relativized Separation. ICALP (1992)
Timothy J. Long
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 17 (3) (1988)
Steven Homer, Timothy J. Long
Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. 51 (1987)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One- Way Functions and Polynomial Time Isomorphisms. Computational Complexity Conference (1986)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) STOC (1986)
Timothy J. Long, Alan L. Selman
Relativizing complexity classes with sparse oracles. J. ACM 33 (3) (1986)
Ker-I Ko, Timothy J. Long, Ding-Zhu Du
On One-Way Functions and Polynomial-Time Isomorphisms. Theor. Comput. Sci. 47 (3) (1986)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30 (3) (1985)
Timothy J. Long
On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 14 (3) (1985)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13 (3) (1984)
José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
Sparse Oracles and Uniform Complexity Classes FOCS (1984)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Controlled relativizations of P and NP. Theoretical Computer Science (1983)
Timothy J. Long
A Note on Sparse Oracles for NP. J. Comput. Syst. Sci. 24 (2) (1982)
Shimon Even, Timothy J. Long, Yacov Yacobi
A Note on Deterministic and Nondeterministic Time Complexity Inf. Control. 55 (1-3) (1982)
Timothy J. Long
Strong Nondeterministic Polynomial-Time Reducibilities. Theor. Comput. Sci. 21 (1982)
Timothy J. Long
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. Theor. Comput. Sci. 14 (1981)
Timothy J. Long
On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) STOC (1979)