Timothy J. Long

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