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.
EDBT 2026 Demo / reviewers in the wild / expert

Martin H. Ellis

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

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

Theory of computation · 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 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms › sorting
comparison sorting		 0.011981
Fast Sorting of Weyl Sequences Using Comparisons · SIAM J. Comput. 1981
Algorithms and data structures › sequence algorithms
sorting		 0.011981
Fast Sorting of Weyl Sequences Using Comparisons · SIAM J. Comput. 1981

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

lower bound · 0.0comparison-based algorithm · 0.0
YearPublicationVenuePosition
1981 Fast Sorting of Weyl Sequences Using Comparisons
abstract
An algorithm is given which makes only $O(\log n)$ comparisons, and which will determine the ordering of the uniformly distributed (pseudo random) Weyl sequences given by $\{ (k\alpha )\bmod 1:1 \leqq k \leqq n\} $, where $\alpha $ is an unspecified irrational number. This result is shown to be best possible in the sense that no algorithm can perform the same task with fewer than $ \Omega (\log n)$ comparisons.
Martin H. Ellis, J. Michael Steele
 SIAM J. Comput.1