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

Mark M. Rochkind

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

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

Systems, architecture and hardware · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms › sorting › in-place sorting
shellsort		 0.011970
Transferable FORTRAN Subroutine for Rapid Extended Sorting · IEEE Trans. Computers 1970
Algorithms and data structures › sequence algorithms
sorting		 0.011970
Transferable FORTRAN Subroutine for Rapid Extended Sorting · IEEE Trans. Computers 1970
YearPublicationVenuePosition
1970 Transferable FORTRAN Subroutine for Rapid Extended Sorting
abstract
A transferable, utility grade, FORTRAN subroutine is described which sorts lists of arbitrary length and simultaneously resequences up to ten additional lists so as to retain a one-to-one correspondence between the elements of these additional lists and those of the list being sorted. Lists within lists may be sorted. A simple CALL permits all options and parameters to be specified. The code is based on the algorithm SHELLSORT.
Mark M. Rochkind
 IEEE Trans. Computers1