Sheldon Sobel

dblp:30/1941 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1962
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › sorting
merge sort
0.011962
Oscillating Sort - A New Sort Merging Technique · J. ACM 1962
Storage systems
sorting algorithms
0.011962
Oscillating Sort - A New Sort Merging Technique · J. ACM 1962

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

replacement sorting · 0.0n-way merge · 0.0
YearPublicationVenuePosition
1962 Oscillating Sort - A New Sort Merging Technique
abstract
Oscillating Sort, designed to gain an (N-1)-way merge with N merging tapes available, is further speeifieaUy designed for read-backwards tapes, and if read-write overlap is available, for cross channel switching, i.e. the ability for any tape to be read while any other tape is being written.Furthermore, this technique is compatible with replacement sorting techniques.
Sheldon Sobel
J. ACM1