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

F. Prusker

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

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

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

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › memory hierarchy
external memory algorithms		 0.011974
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) · STOC 1974

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

optimal merge pattern · 0.0dynamic programming · 0.0
YearPublicationVenuePosition
1974 An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
abstract
In this paper, we present an algorithm which computes the optimal pattern for merging n equal size sorted sequences stored on a disk, in time O(log n) and constant space. The best previously known algorithm for solving this problem (Knuth [4], Schlumberger-Vuillemin [5]) takes time O(n2) and space O(n).
Laurent Hyafil, F. Prusker, Jean Vuillemin
 STOC2