Timothy J. Long

Affiliations:
  • Ohio State University, Columbus, USA


According to our database1, Timothy J. Long authored at least 32 papers between 1979 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Which pointer errors do students make?
Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

2002
Teaching Component-Based Software Engineering: A Formal Approach and Its Evaluation.
Comput. Sci. Educ., 2002

Algorithms and object-oriented programming: bridging the gap.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

2001
Do we really teach abstraction?
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

A Formal Approach to Component-Based Software Engineering: Education and Evaluation.
Proceedings of the 23rd International Conference on Software Engineering, 2001

2000
Reasoning about Software-Component Behavior.
Proceedings of the Software Reuse: Advances in Software Reusability, 2000

1999
Client view first: an exodus from implementation-biased teaching.
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

1998
Teaching software architecture principles in CS1/CS2.
Proceedings of the Third International Workshop on Software Architecture, 1998

Providing intellectual focus to CS1/CS2.
Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

A Data Abstraction Alternative to Data Structure/Algorithm Modularization.
Proceedings of the Generic Programming, 1998

1996
UP and the Low and High Hierarchies: A Relativized Separatin.
Math. Syst. Theory, 1996

Characterizing observability and controllability of software components.
Proceedings of Fourth IEEE International Conference on Software Reuse, 1996

1995
A Refinement of the Low and High Hierarchies.
Math. Syst. Theory, 1995

1994
Part II: specifying components in RESOLVE.
ACM SIGSOFT Softw. Eng. Notes, 1994

The Extended Low Hierarchy is an Infinite Hierarchy.
SIAM J. Comput., 1994

1992
UP and the Low and High Hierarchies: A Relativized Separation.
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.
SIAM J. Comput., 1988

1987
Honest Polynomial Degrees and P=?NP.
Theor. Comput. Sci., 1987

1986
On One-Way Functions and Polynomial-Time Isomorphisms.
Theor. Comput. Sci., 1986

Relativizing complexity classes with sparse oracles.
J. ACM, 1986

A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

A Note on One- Way Functions and Polynomial Time Isomorphisms.
Proceedings of the Structure in Complexity Theory, 1986

1985
On Restricting the Size of Oracles Compared with Restricting Access to Oracles.
SIAM J. Comput., 1985

Qualitative Relativizations of Complexity Classes.
J. Comput. Syst. Sci., 1985

1984
Quantitative Relativizations of Complexity Classes.
SIAM J. Comput., 1984

Sparse Oracles and Uniform Complexity Classes
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Controlled relativizations of P and NP.
Proceedings of the Theoretical Computer Science, 1983

1982
Strong Nondeterministic Polynomial-Time Reducibilities.
Theor. Comput. Sci., 1982

A Note on Sparse Oracles for NP.
J. Comput. Syst. Sci., 1982

A Note on Deterministic and Nondeterministic Time Complexity
Inf. Control., 1982

1981
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility.
Theor. Comput. Sci., 1981

1979
On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979


  Loading...