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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

D. J. Hajela

dblp:20/5253 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Theory of computation · 2

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
Approximation and online algorithms · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms › online algorithms › list update
move-to-front		 0.011985
Self-Organizing Sequential Search and Hilbert's Inequalities · STOC 1985
Approximation and online algorithms › online algorithms
self-organizing search		 0.011985
Self-Organizing Sequential Search and Hilbert's Inequalities · STOC 1985
Algorithms and data structures › search algorithms
sequential search		 0.011985
Self-Organizing Sequential Search and Hilbert's Inequalities · STOC 1985

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

hilbert's inequalities · 0.0
YearPublicationVenuePosition
1988 Self-organizing Sequential Search and Hilbert's Inequalities
Fan Chung Graham, D. J. Hajela, Paul D. Seymour
 J. Comput. Syst. Sci.2
1985 Self-Organizing Sequential Search and Hilbert's Inequalities
abstract
In this paper we describe a general technique which can be used to solve an old problem in analyzing self-organizing sequential search. We prove that the average time required for the move-to-front heuristic is no more than p/2 times that of the optimal order and this bound is best possible. Hilbert's inequalities will be used to derive large classes of inequalities some of which can be applied to obtain tight worst-case bounds for several self-organizing heuristics.
Fan Chung Graham, D. J. Hajela, Paul D. Seymour
 STOC2