Timothy J. Long - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2007

Which pointer errors do students make?Bruce M. Adcock, Paolo Bucci, Wayne D. Heym, Joseph E. Hollingsworth, Timothy J. Long, Bruce W. Weide. sigcse 2007: 9-13 [doi]

2002

Algorithms and object-oriented programming: bridging the gapPaolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide. sigcse 2002: 302-306 [doi]

Teaching Component-Based Software Engineering: A Formal Approach and Its EvaluationMurali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang. csedu, 12(1-2):11-36, 2002. [doi]

2001

Do we really teach abstraction?Paolo Bucci, Timothy J. Long, Bruce W. Weide. sigcse 2001: 26-30 [doi]

A Formal Approach to Component-Based Software Engineering: Education and EvaluationMurali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang. ICSE 2001: 601-609

2000

Reasoning about Software-Component BehaviorMurali Sitaraman, Steven Atkinson, Gregory Kulczycki, Bruce W. Weide, Timothy J. Long, Paolo Bucci, Wayne D. Heym, Scott M. Pike, Joseph E. Hollingsworth. icsr 2000: 266-283

1999

Client view first: an exodus from implementation-biased teachingTimothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman. sigcse 1999: 136-140 [doi]

1998

1996

UP and the Low and High Hierarchies: A Relativized SeparatinMing-Jye Sheu, Timothy J. Long. mst, 29(5):423-449, 1996.

Characterizing observability and controllability of software componentsBruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden. icsr 1996: 62-71 [doi]

1995

A Refinement of the Low and High HierarchiesTimothy J. Long, Ming-Jye Sheu. mst, 28(4):299-327, 1995.

1994

Part II: specifying components in RESOLVEStephen H. Edwards, Wayne D. Heym, Timothy J. Long, Murali Sitaraman, Bruce W. Weide. sigsoft, 19(4):29-39, 1994. [doi]

The Extended Low Hierarchy is an Infinite HierarchyMing-Jye Sheu, Timothy J. Long. SICOMP, 23(3):488-509, 1994.

1992

The Extended Low Hierarchy Is an Infinite HierarchyMing-Jye Sheu, Timothy J. Long. STACS 1992: 187-198

UP and the Low and High Hierarchies: A Relativized SeparationMing-Jye Sheu, Timothy J. Long. icalp 1992: 174-185

1988

Erratum: On Restricting the Size of Oracles Compared with Restricting Access to OraclesTimothy J. Long. SICOMP, 17(3):628, 1988.

1987

Honest Polynomial Degrees and P=?NPSteven Homer, Timothy J. Long. TCS, 51:265-280, 1987.

1986

1985

Qualitative Relativizations of Complexity ClassesRonald V. Book, Timothy J. Long, Alan L. Selman. jcss, 30(3):395-413, 1985.

On Restricting the Size of Oracles Compared with Restricting Access to OraclesTimothy J. Long. SICOMP, 14(3):585-597, 1985.

1984

Sparse Oracles and Uniform Complexity ClassesJosé L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman. focs 1984: 308-311

Quantitative Relativizations of Complexity ClassesRonald V. Book, Timothy J. Long, Alan L. Selman. SICOMP, 13(3):461-487, 1984.

1983

Controlled relativizations of P and NPRonald V. Book, Timothy J. Long, Alan L. Selman. tcs 1982: 85-90

1982

A Note on Sparse Oracles for NPTimothy J. Long. jcss, 24(2):224-232, 1982.

Strong Nondeterministic Polynomial-Time ReducibilitiesTimothy J. Long. TCS, 21:1-25, 1982.

1981

On gamma-Reducibility Versus Polynomial Time Many-One ReducibilityTimothy J. Long. TCS, 14:91-101, 1981.

1979

On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)Timothy J. Long. stoc 1979: 278-287

Sign in or sign up to see more results.

runs on WebDSL