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

L. Gotlieb

dblp:31/2871 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none

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

Theory of computation · 1 · 1 first-author

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
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
dynamic programming		 0.011981
Optimal Multi-Way Search Trees · SIAM J. Comput. 1981
Algorithms and data structures › data structure design › search structures › search trees
multiway search trees		 0.011981
Optimal Multi-Way Search Trees · SIAM J. Comput. 1981
Algorithms and data structures › data structure design › search structures › search trees
optimal binary search tree		 0.011981
Optimal Multi-Way Search Trees · SIAM J. Comput. 1981
Algorithms and data structures › data structure design › search structures
search trees		 0.011981
Optimal Multi-Way Search Trees · SIAM J. Comput. 1981

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

dynamic programming · 0.0
YearPublicationVenuePosition
1981 Optimal Multi-Way Search Trees
abstract
Given a set of N weighted keys, $N + 1$ missing-key weights and a page capacity m, we describe an algorithm for constructing a multi-way lexicographic search tree with minimum cost. The program runs in time $O(N^3 m)$ and requires $O(N^2 m)$ storage locations. If the missing-key weights are zero, the time can be reduced to $O(N^2 m)$. A further refinement enables the factor m in the above costs to be replaced by log m.
L. Gotlieb
 SIAM J. Comput.1