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

Richard M. Nemes

dblp:59/3399 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorTheory 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 · 70% Approximation and online algorithms · 30%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms › online algorithms › list update
move-to-front		 0.011982
Two Spectra of Self-Organizing Sequential Search Algorithms · SIAM J. Comput. 1982
Algorithms and data structures › dynamic data structures › self-adjusting data structures
self-organizing lists		 0.011982
Two Spectra of Self-Organizing Sequential Search Algorithms · SIAM J. Comput. 1982
Algorithms and data structures › search algorithms
sequential search		 0.011982
Two Spectra of Self-Organizing Sequential Search Algorithms · SIAM J. Comput. 1982

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

stationary expected search cost · 0.0probabilistic analysis · 0.0
YearPublicationVenuePosition
1985 Modular Verification of Distributed Systems
Richard M. Nemes
 ICDCS1
1982 Two Spectra of Self-Organizing Sequential Search Algorithms
abstract
Two sets of algorithms for searching and dynamic reorganization of linear lists are presented. Each set forms a spectrum, with the well-known move-to-front and transposition algorithms at the extrema. A linear ordering on the stationary expected search cost of the algorithms in each of the two spectra is established over a restricted set of probability distributions.
Aaron M. Tenenbaum, Richard M. Nemes
 SIAM J. Comput.2