Timothy J. Long

	2007
29		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: 9-13
	2002
28		Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide: Algorithms and object-oriented programming: bridging the gap. SIGCSE 2002: 302-306
	2001
27		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: 601-609
26		Paolo Bucci, Timothy J. Long, Bruce W. Weide: Do we really teach abstraction? SIGCSE 2001: 26-30
	2000
25		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: 266-283
	1999
24		Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman: Client view first: an exodus from implementation-biased teaching. SIGCSE 1999: 136-140
	1998
23		Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden: A Data Abstraction Alternative to Data Structure/Algorithm Modularization. Generic Programming 1998: 102-113
22		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: 252-256
	1996
21		Ming-Jye Sheu, Timothy J. Long: UP and the Low and High Hierarchies: A Relativized Separatin. Mathematical Systems Theory 29(5): 423-449 (1996)
	1995
20		Timothy J. Long, Ming-Jye Sheu: A Refinement of the Low and High Hierarchies. Mathematical Systems Theory 28(4): 299-327 (1995)
	1994
19		Ming-Jye Sheu, Timothy J. Long: The Extended Low Hierarchy is an Infinite Hierarchy. SIAM J. Comput. 23(3): 488-509 (1994)
	1992
18		Ming-Jye Sheu, Timothy J. Long: UP and the Low and High Hierarchies: A Relativized Separation. ICALP 1992: 174-185
17		Ming-Jye Sheu, Timothy J. Long: The Extended Low Hierarchy Is an Infinite Hierarchy. STACS 1992: 187-198
	1988
16		Timothy J. Long: Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 17(3): 628 (1988)
	1987
15		Steven Homer, Timothy J. Long: Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. 51: 265-280 (1987)
	1986
14		Ker-I Ko, Timothy J. Long, Ding-Zhu Du: A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) STOC 1986: 295-303
13		Ker-I Ko, Timothy J. Long, Ding-Zhu Du: A Note on One- Way Functions and Polynomial Time Isomorphisms. Structure in Complexity Theory Conference 1986: 196-196
12		Timothy J. Long, Alan L. Selman: Relativizing complexity classes with sparse oracles. J. ACM 33(3): 618-627 (1986)
11		Ker-I Ko, Timothy J. Long, Ding-Zhu Du: On One-Way Functions and Polynomial-Time Isomorphisms. Theor. Comput. Sci. 47(3): 263-276 (1986)
	1985
10		Ronald V. Book, Timothy J. Long, Alan L. Selman: Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30(3): 395-413 (1985)
9		Timothy J. Long: On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 14(3): 585-597 (1985)
	1984
8		José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman: Sparse Oracles and Uniform Complexity Classes FOCS 1984: 308-311
7		Ronald V. Book, Timothy J. Long, Alan L. Selman: Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13(3): 461-487 (1984)
	1983
6		Ronald V. Book, Timothy J. Long, Alan L. Selman: Controlled relativizations of P and NP. Theoretical Computer Science 1983: 85-90
	1982
5		Shimon Even, Timothy J. Long, Yacov Yacobi: A Note on Deterministic and Nondeterministic Time Complexity Information and Control 55(1-3): 117-124 (1982)
4		Timothy J. Long: A Note on Sparse Oracles for NP. J. Comput. Syst. Sci. 24(2): 224-232 (1982)
3		Timothy J. Long: Strong Nondeterministic Polynomial-Time Reducibilities. Theor. Comput. Sci. 21: 1-25 (1982)
	1981
2		Timothy J. Long: On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. Theor. Comput. Sci. 14: 91-101 (1981)
	1979
1		Timothy J. Long: On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) STOC 1979: 278-287

Coauthor Index

1	Bruce M. Adcock	[29]
2	Steven Atkinson	[25]
3	José L. Balcázar	[8]
4	Ronald V. Book	[6] [7] [8] [10]
5	Paolo Bucci	[22] [24] [25] [26] [28] [29]
6	Ding-Zhu Du	[11] [13] [14]
7	Stephen H. Edwards	[22]
8	Shimon Even	[5]
9	David S. Gibson	[22]
10	E. James Harner	[27]
11	Wayne D. Heym	[25] [28] [29]
12	Joseph E. Hollingsworth	[22] [25] [29]
13	Steven Homer	[15]
14	Ker-I Ko	[11] [13] [14]
15	Gregory Kulczycki	[25]
16	William F. Ogden	[23]
17	Scott M. Pike	[25]
18	Uwe Schöning	[8]
19	Alan L. Selman	[6] [7] [8] [10] [12]
20	Ming-Jye Sheu	[17] [18] [19] [20] [21]
21	Murali Sitaraman	[22] [23] [24] [25] [27]
22	Liqing Wang	[27]
23	Bruce W. Weide	[22] [23] [24] [25] [26] [27] [28] [29]
24	Yacov Yacobi	[5]

Colors in the list of coauthors