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

A. Ecker

dblp:87/6691 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

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

Theory of computation · 1 · 1 first-authorApplied, 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
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › arithmetic codes
AN codes		 0.011980
How to Compute the Minimum Distance for Cyclic AN-Codes over an Arbitrary Base. I. Elementary Methods · Inf. Control. 1980
Coding theory › error-correcting codes
cyclic codes		 0.011980
How to Compute the Minimum Distance for Cyclic AN-Codes over an Arbitrary Base. I. Elementary Methods · Inf. Control. 1980
Coding theory › error-correcting codes
minimum distance computation		 0.011980
How to Compute the Minimum Distance for Cyclic AN-Codes over an Arbitrary Base. I. Elementary Methods · Inf. Control. 1980

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

elementary methods · 0.0
YearPublicationVenuePosition
1980 How to Compute the Minimum Distance for Cyclic AN-Codes over an Arbitrary Base. I. Elementary Methods
A. Ecker
 Inf. Control.1
1974 The Period of Search for the Quadratic and Related Hash Methods
abstract
This paper is a systematic approach to estimate the period of search for the quadratic hash method. A generalisation of that method is given and upper or lower bounds for the search period are evaluated. It turns out that contrary to what is normally believed in most cases of practical interest it is possible to search the complete table.
A. Ecker
 Comput. J.1