default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy J. Long
Person information
- affiliation: Ohio State University, Columbus, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1978
[b1]Timothy J. Long:
On some polynomial time reducibilities. Purdue University, USA, 1978
Journal Articles
- 2002
- [j16]Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang:
Teaching Component-Based Software Engineering: A Formal Approach and Its Evaluation. Comput. Sci. Educ. 12(1-2): 11-36 (2002) - 1996
- [j15]Ming-Jye Sheu, Timothy J. Long:
UP and the Low and High Hierarchies: A Relativized Separatin. Math. Syst. Theory 29(5): 423-449 (1996) - 1995
- [j14]Timothy J. Long, Ming-Jye Sheu:
A Refinement of the Low and High Hierarchies. Math. Syst. Theory 28(4): 299-327 (1995) - 1994
- [j13]Ming-Jye Sheu, Timothy J. Long:
The Extended Low Hierarchy is an Infinite Hierarchy. SIAM J. Comput. 23(3): 488-509 (1994) - [j12]Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, Murali Sitaraman, Bruce W. Weide:
Part II: specifying components in RESOLVE. ACM SIGSOFT Softw. Eng. Notes 19(4): 29-39 (1994) - 1988
- [j11]Timothy J. Long:
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 17(3): 628 (1988) - 1987
- [j10]Steven Homer, Timothy J. Long:
Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. 51: 265-280 (1987) - 1986
- [j9]Timothy J. Long, Alan L. Selman:
Relativizing complexity classes with sparse oracles. J. ACM 33(3): 618-627 (1986) - [j8]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
- [j7]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30(3): 395-413 (1985) - [j6]Timothy J. Long:
On Restricting the Size of Oracles Compared with Restricting Access to Oracles. SIAM J. Comput. 14(3): 585-597 (1985) - 1984
- [j5]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13(3): 461-487 (1984) - 1982
- [j4]Shimon Even, Timothy J. Long, Yacov Yacobi:
A Note on Deterministic and Nondeterministic Time Complexity. Inf. Control. 55(1-3): 117-124 (1982) - [j3]Timothy J. Long:
A Note on Sparse Oracles for NP. J. Comput. Syst. Sci. 24(2): 224-232 (1982) - [j2]Timothy J. Long:
Strong Nondeterministic Polynomial-Time Reducibilities. Theor. Comput. Sci. 21: 1-25 (1982) - 1981
- [j1]Timothy J. Long:
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. Theor. Comput. Sci. 14: 91-101 (1981)
Conference and Workshop Papers
- 2007
- [c17]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
- [c16]Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide:
Algorithms and object-oriented programming: bridging the gap. SIGCSE 2002: 302-306 - 2001
- [c15]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 - [c14]Paolo Bucci, Timothy J. Long, Bruce W. Weide:
Do we really teach abstraction? SIGCSE 2001: 26-30 - 2000
- [c13]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
- [c12]Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman:
Client view first: an exodus from implementation-biased teaching. SIGCSE 1999: 136-140 - 1998
- [c11]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 - [c10]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 - [c9]Paolo Bucci, Timothy J. Long, Bruce W. Weide:
Teaching software architecture principles in CS1/CS2. ISAW@FSE 1998: 9-12 - 1996
- [c8]Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden:
Characterizing observability and controllability of software components. ICSR 1996: 62-71 - 1992
- [c7]Ming-Jye Sheu, Timothy J. Long:
UP and the Low and High Hierarchies: A Relativized Separation. ICALP 1992: 174-185 - [c6]Ming-Jye Sheu, Timothy J. Long:
The Extended Low Hierarchy Is an Infinite Hierarchy. STACS 1992: 187-198 - 1986
- [c5]Ker-I Ko, Timothy J. Long, Ding-Zhu Du:
A Note on One- Way Functions and Polynomial Time Isomorphisms. SCT 1986: 196-196 - [c4]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 - 1984
- [c3]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 - 1983
- [c2]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Controlled relativizations of P and NP. Theoretical Computer Science 1983: 85-90 - 1979
- [c1]Timothy J. Long:
On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract). STOC 1979: 278-287
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
