Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
EDBT 2026 Demo / reviewers in the wild / expert

Alan Skelley

dblp:63/1620 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 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.

Theoretical computer science
1 paper
Computational complexity · 67% Automated reasoning and model checking · 33%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
proof complexity		 0.012004
Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas · ICALP 2004
Computational complexity › proof complexity
propositional proof systems		 0.012004
Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas · ICALP 2004
Automated reasoning and model checking › satisfiability
quantified boolean formula		 0.012004
Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas · ICALP 2004
Database system architecture and tuning
index recommendation		 0.012000
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes · ICDE 2000
Database system architecture and tuning › database design › physical database design
index selection		 0.012000
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes · ICDE 2000
Database system architecture and tuning › database design
physical database design		 0.012000
DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes · ICDE 2000

Methods — techniques the papers use, named apart from their topics

proof complexity · 0.0PSPACE reasoning · 0.0knapsack problem formulation · 0.0cost-benefit optimization · 0.0
YearPublicationVenuePosition
2007 NP search problems in low fragments of bounded arithmetic
abstract
Abstract We give combinatorial and computational characterizations of the NP search problems definable in the bounded arithmetic theories and .
Jan Krajícek, Alan Skelley, Neil Thapen
 J. Symb. Log.2
2007 Third-Order Computation and Bounded Arithmetic
abstract
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characterizations of several large complexity classes. We then present a number of third-order theories of bounded arithmetic whose definable functions are the classes of the EXP-time hierarchy in the third-order setting.
Alan Skelley
 J. Log. Comput.1
2004 Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas
Alan Skelley
 ICALP1
2000 DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes
abstract
This paper introduces the concept of letting an RDBMS optimizer optimize its own environment. In our project, we have used the DB2 optimizer to tackle the index selection problem, a variation of the knapsack problem. This paper discusses our implementation of index recommendation, the user interface, and provide measurements on the quality of the recommended indexes.
Gary Valentin, Michael Zuliani, Daniel C. Zilio, Guy M. Lohman, Alan Skelley
 ICDE5