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 VLDB 2026 / reviewers in the wild / expert

Stephen Glicksman

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

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

Applied, interdisciplinary, general and emerging computing · 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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms › sorting
external sorting		 0.011965
Concerning the Merging of Equal Length Tape Files · J. ACM 1965
Algorithms and data structures › sorting and selection
multiway merging		 0.011965
Concerning the Merging of Equal Length Tape Files · J. ACM 1965
Algorithms and data structures
sorting and merging		 0.011965
Concerning the Merging of Equal Length Tape Files · J. ACM 1965
Storage systems › magnetic storage
tape storage		 0.011965
Concerning the Merging of Equal Length Tape Files · J. ACM 1965

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

combinatorial optimization · 0.0
YearPublicationVenuePosition
1965 Concerning the Merging of Equal Length Tape Files
abstract
Consider a procedure for merging ]c given equal length tape files into one tai, ~ file by a series of at most r~way merges.This paper gives a proof that such a procedure minimizes tape reading and writing when and only when the data from b of the original file,, is merged n-1 times and the data from the other k-b original files is merged n times, wt~er~: n is the least integer such that r ~ > k and b is the integral part, of (r ~k)/(r -1).
Stephen Glicksman
 J. ACM1