Timothy J. Long

According to our database, Timothy J. Long authored at least 33 papers between 1978 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Which pointer errors do students make?

Bruce M. Adcock, Paolo Bucci, Wayne D. Heym, Joseph E. Hollingsworth, Timothy J. Long, Bruce W. Weide

Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

2002

Teaching Component-Based Software Engineering: A Formal Approach and Its Evaluation.

Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang

Comput. Sci. Educ., 2002

Algorithms and object-oriented programming: bridging the gap.

Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide

Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

2001

Do we really teach abstraction?

Paolo Bucci, Timothy J. Long, Bruce W. Weide

Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

A Formal Approach to Component-Based Software Engineering: Education and Evaluation.

Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang

Proceedings of the 23rd International Conference on Software Engineering, 2001

2000

Reasoning about Software-Component Behavior.

Murali Sitaraman, Steven Atkinson, Gregory Kulczycki, Bruce W. Weide, Timothy J. Long, Paolo Bucci, Wayne D. Heym, Scott M. Pike, Joseph E. Hollingsworth

Proceedings of the Software Reuse: Advances in Software Reusability, 2000

1999

Client view first: an exodus from implementation-biased teaching.

Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman

Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

1998

Teaching software architecture principles in CS1/CS2.

Paolo Bucci, Timothy J. Long, Bruce W. Weide

Proceedings of the Third International Workshop on Software Architecture, 1998

Providing intellectual focus to CS1/CS2.

Timothy J. Long, Bruce W. Weide, Paolo Bucci, David S. Gibson, Joseph E. Hollingsworth, Murali Sitaraman, Stephen H. Edwards

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

A Data Abstraction Alternative to Data Structure/Algorithm Modularization.

Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden

Proceedings of the Generic Programming, 1998

1996

UP and the Low and High Hierarchies: A Relativized Separatin.

Ming-Jye Sheu, Timothy J. Long

Math. Syst. Theory, 1996

Characterizing observability and controllability of software components.

Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden

Proceedings of Fourth IEEE International Conference on Software Reuse, 1996

1995

A Refinement of the Low and High Hierarchies.

Timothy J. Long, Ming-Jye Sheu

Math. Syst. Theory, 1995

1994

Part II: specifying components in RESOLVE.

Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, Murali Sitaraman, Bruce W. Weide

ACM SIGSOFT Softw. Eng. Notes, 1994

The Extended Low Hierarchy is an Infinite Hierarchy.

Ming-Jye Sheu, Timothy J. Long

SIAM J. Comput., 1994

1992

UP and the Low and High Hierarchies: A Relativized Separation.

Ming-Jye Sheu, Timothy J. Long

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1988

Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles.

Timothy J. Long

SIAM J. Comput., 1988

1987

Honest Polynomial Degrees and P=?NP.

Steven Homer, Timothy J. Long

Theor. Comput. Sci., 1987

1986

On One-Way Functions and Polynomial-Time Isomorphisms.

Ker-I Ko, Timothy J. Long, Ding-Zhu Du

Theor. Comput. Sci., 1986

Relativizing complexity classes with sparse oracles.

Timothy J. Long, Alan L. Selman

J. ACM, 1986

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)

Ker-I Ko, Timothy J. Long, Ding-Zhu Du

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

A Note on One- Way Functions and Polynomial Time Isomorphisms.

Ker-I Ko, Timothy J. Long, Ding-Zhu Du

Proceedings of the Structure in Complexity Theory, 1986

1985

On Restricting the Size of Oracles Compared with Restricting Access to Oracles.

Timothy J. Long

SIAM J. Comput., 1985

Qualitative Relativizations of Complexity Classes.

Ronald V. Book, Timothy J. Long, Alan L. Selman

J. Comput. Syst. Sci., 1985

1984

Quantitative Relativizations of Complexity Classes.

Ronald V. Book, Timothy J. Long, Alan L. Selman

SIAM J. Comput., 1984

Sparse Oracles and Uniform Complexity Classes

José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Controlled relativizations of P and NP.

Ronald V. Book, Timothy J. Long, Alan L. Selman

Proceedings of the Theoretical Computer Science, 1983

1982

Strong Nondeterministic Polynomial-Time Reducibilities.

Timothy J. Long

Theor. Comput. Sci., 1982

A Note on Sparse Oracles for NP.

Timothy J. Long

J. Comput. Syst. Sci., 1982

A Note on Deterministic and Nondeterministic Time Complexity

Shimon Even, Timothy J. Long, Yacov Yacobi

Inf. Control., 1982

1981

On gamma-Reducibility Versus Polynomial Time Many-One Reducibility.

Timothy J. Long

Theor. Comput. Sci., 1981

1979

On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)

Timothy J. Long

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

On some polynomial time reducibilities.

Timothy J. Long

PhD thesis, 1978