EDBT 2026 Demo / reviewers in the wild / expert
Theodore S. Norvell
dblp:71/6988
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2009
0000-0002-2361-8490ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 2 · 1 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › aggregation
aggregate functions |
0.0 | 1 | 1989 | Aggregative Closure: An Extension of Transitive Closure · ICDE 1989 |
Query processing and optimization › query execution
relational operators |
0.0 | 1 | 1989 | Aggregative Closure: An Extension of Transitive Closure · ICDE 1989 |
Query processing and optimization › recursive query
transitive closure |
0.0 | 1 | 1989 | Aggregative Closure: An Extension of Transitive Closure · ICDE 1989 |
Methods — techniques the papers use, named apart from their topics
closed semiring · 0.0aggregate closure algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Rich content plug-ins for the teaching machineabstractIn this paper, we describe a pedagogical tool for providing rich content in early programming courses. Theodore S. Norvell, Michael Bruce-Lockhart |
ITiCSE | 1 |
| 2009 | Adding Test Generation to the Teaching MachineabstractWe propose an extension of the Teaching Machine project, called Quiz Generator, that allows instructors to produce assessment quizzes in the field of algorithm and data structures quite easily. This extension makes use of visualization techniques and is based on new features of the Teaching Machine that allow third-party visualizers to be added as plugins and on new scripting capabilities. Using these new capabilities, five quiz types have already been produced, which can be applied to any algorithm and/or data structure for which the necessary visualizer plugins exist. Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi |
ACM Trans. Comput. Educ. | 2 |
| 2006 | Interactive embedded examples: a demonstrationabstractA demonstration of the integration of a program animation tool into a set of web based notes used by instructors for lecturing and students for studying. Standard, conventionally prepared C++ and Java examples are dynamically incorporated into the class notes and can be interactively run in the animation tool directly from within the notes. Michael Bruce-Lockhart, Theodore S. Norvell |
ITiCSE | 2 |
| 1993 | Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
Theodore S. Norvell |
FSTTCS | 1 |
| 1992 | Logical Specifications for Functional Programs
Theodore S. Norvell, Eric C. R. Hehner |
MPC | 1 |
| 1989 | Aggregative Closure: An Extension of Transitive ClosureabstractThe aggregative closure operator is defined and its usefulness is demonstrated in a wide variety of applications. The concepts and definitions of closed semirings and the aggregating relational operators provide a mathematical framework for the presentation of algorithms for these applications. A novel algorithm is also presented which is intended for the computation of the aggregate closure. All of these algorithms but the last are generalizations of existing algorithms intended for transitive closure.> Isabel F. Cruz, Theodore S. Norvell |
ICDE | 2 |