Search the dblp DataBase
Timothy J. Long: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One- Way Functions and Polynomial Time Isomorphisms. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1986, pp:196-196 [Conf] - Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden
A Data Abstraction Alternative to Data Structure/Algorithm Modularization. [Citation Graph (0, 0)][DBLP]
Generic Programming, 1998, pp:102-113 [Conf] - José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
Sparse Oracles and Uniform Complexity Classes [Citation Graph (0, 0)][DBLP]
FOCS, 1984, pp:308-311 [Conf] - Ming-Jye Sheu, Timothy J. Long
UP and the Low and High Hierarchies: A Relativized Separation. [Citation Graph (0, 0)][DBLP]
ICALP, 1992, pp:174-185 [Conf] - Murali Sitaraman, Timothy J. Long, Bruce W. Weide, E. James Harner, Liqing Wang
A Formal Approach to Component-Based Software Engineering: Education and Evaluation. [Citation Graph (0, 0)][DBLP]
ICSE, 2001, pp:601-609 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
ICSR, 2000, pp:266-283 [Conf] - Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide
Algorithms and object-oriented programming: bridging the gap. [Citation Graph (0, 0)][DBLP]
SIGCSE, 2002, pp:302-306 [Conf] - Paolo Bucci, Timothy J. Long, Bruce W. Weide
Do we really teach abstraction? [Citation Graph (0, 0)][DBLP]
SIGCSE, 2001, pp:26-30 [Conf] - Timothy J. Long, Bruce W. Weide, Paolo Bucci, David S. Gibson, Joseph E. Hollingsworth, Murali Sitaraman, Steven Edwards
Providing intellectual focus to CS1/CS2. [Citation Graph (0, 0)][DBLP]
SIGCSE, 1998, pp:252-256 [Conf] - Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman
Client view first: an exodus from implementation-biased teaching. [Citation Graph (0, 0)][DBLP]
SIGCSE, 1999, pp:136-140 [Conf] - Bruce M. Adcock, Paolo Bucci, Wayne D. Heym, Joseph E. Hollingsworth, Timothy J. Long, Bruce W. Weide
Which pointer errors do students make? [Citation Graph (0, 0)][DBLP]
SIGCSE, 2007, pp:9-13 [Conf] - Ming-Jye Sheu, Timothy J. Long
The Extended Low Hierarchy Is an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
STACS, 1992, pp:187-198 [Conf] - Ker-I Ko, Timothy J. Long, Ding-Zhu Du
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
STOC, 1986, pp:295-303 [Conf] - Timothy J. Long
On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) [Citation Graph (0, 0)][DBLP]
STOC, 1979, pp:278-287 [Conf] - Ronald V. Book, Timothy J. Long, Alan L. Selman
Controlled relativizations of P and NP. [Citation Graph (0, 0)][DBLP]
Theoretical Computer Science, 1983, pp:85-90 [Conf] - Shimon Even, Timothy J. Long, Yacov Yacobi
A Note on Deterministic and Nondeterministic Time Complexity [Citation Graph (0, 0)][DBLP]
Information and Control, 1982, v:55, n:1-3, pp:117-124 [Journal] - Timothy J. Long, Alan L. Selman
Relativizing complexity classes with sparse oracles. [Citation Graph (0, 0)][DBLP]
J. ACM, 1986, v:33, n:3, pp:618-627 [Journal] - Ronald V. Book, Timothy J. Long, Alan L. Selman
Qualitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1985, v:30, n:3, pp:395-413 [Journal] - Timothy J. Long
A Note on Sparse Oracles for NP. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1982, v:24, n:2, pp:224-232 [Journal] - Timothy J. Long, Ming-Jye Sheu
A Refinement of the Low and High Hierarchies. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1995, v:28, n:4, pp:299-327 [Journal] - Ming-Jye Sheu, Timothy J. Long
UP and the Low and High Hierarchies: A Relativized Separatin. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1996, v:29, n:5, pp:423-449 [Journal] - Ronald V. Book, Timothy J. Long, Alan L. Selman
Quantitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1984, v:13, n:3, pp:461-487 [Journal] - Timothy J. Long
On Restricting the Size of Oracles Compared with Restricting Access to Oracles. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1985, v:14, n:3, pp:585-597 [Journal] - Timothy J. Long
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1988, v:17, n:3, pp:628- [Journal] - Ming-Jye Sheu, Timothy J. Long
The Extended Low Hierarchy is an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1994, v:23, n:3, pp:488-509 [Journal] - Steven Homer, Timothy J. Long
Honest Polynomial Degrees and P=?NP. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1987, v:51, n:, pp:265-280 [Journal] - Ker-I Ko, Timothy J. Long, Ding-Zhu Du
On One-Way Functions and Polynomial-Time Isomorphisms. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1986, v:47, n:3, pp:263-276 [Journal] - Timothy J. Long
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1981, v:14, n:, pp:91-101 [Journal] - Timothy J. Long
Strong Nondeterministic Polynomial-Time Reducibilities. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:21, n:, pp:1-25 [Journal]
Search in 0.002secs, Finished in 0.305secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002