|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 |
DBLP DOI BibTeX RDF |
data structures, C++, CS2, pointers, references, linked list |
| 1 | Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce W. Weide |
Algorithms and object-oriented programming: bridging the gap.  |
SIGCSE  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Bucci, Timothy J. Long, Bruce W. Weide |
Do we really teach abstraction?  |
SIGCSE  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long, Bruce W. Weide, Paolo Bucci, Murali Sitaraman |
Client view first: an exodus from implementation-biased teaching.  |
SIGCSE  |
1999 |
DBLP DOI BibTeX RDF |
programming languages, recursion |
| 1 | Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden |
A Data Abstraction Alternative to Data Structure/Algorithm Modularization.  |
Generic Programming  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Jye Sheu, Timothy J. Long |
UP and the Low and High Hierarchies: A Relativized Separatin.  |
Mathematical Systems Theory  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long, Ming-Jye Sheu |
A Refinement of the Low and High Hierarchies.  |
Mathematical Systems Theory  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Jye Sheu, Timothy J. Long |
The Extended Low Hierarchy is an Infinite Hierarchy.  |
SIAM J. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Jye Sheu, Timothy J. Long |
UP and the Low and High Hierarchies: A Relativized Separation.  |
ICALP  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Jye Sheu, Timothy J. Long |
The Extended Low Hierarchy Is an Infinite Hierarchy.  |
STACS  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles.  |
SIAM J. Comput.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Timothy J. Long |
Honest Polynomial Degrees and P=?NP.  |
Theor. Comput. Sci.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ker-I Ko, Timothy J. Long, Ding-Zhu Du |
On One-Way Functions and Polynomial-Time Isomorphisms.  |
Theor. Comput. Sci.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long, Alan L. Selman |
Relativizing complexity classes with sparse oracles.  |
J. ACM  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ker-I Ko, Timothy J. Long, Ding-Zhu Du |
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)  |
STOC  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Qualitative Relativizations of Complexity Classes.  |
J. Comput. Syst. Sci.  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
On Restricting the Size of Oracles Compared with Restricting Access to Oracles.  |
SIAM J. Comput.  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Quantitative Relativizations of Complexity Classes.  |
SIAM J. Comput.  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman |
Sparse Oracles and Uniform Complexity Classes  |
FOCS  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Controlled relativizations of P and NP.  |
Theoretical Computer Science  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
Strong Nondeterministic Polynomial-Time Reducibilities.  |
Theor. Comput. Sci.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Timothy J. Long, Yacov Yacobi |
A Note on Deterministic and Nondeterministic Time Complexity  |
Information and Control  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
A Note on Sparse Oracles for NP.  |
J. Comput. Syst. Sci.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility.  |
Theor. Comput. Sci.  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long |
On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)  |
STOC  |
1979 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|