EDBT 2026 Demo / reviewers in the wild / expert

Armin Friedli

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

Theoretical computer science
1 paper
Mathematical optimization · 33% Algorithms and data structures · 33% Graph algorithms and graph theory · 33%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
covering algorithm		 0.011973
Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations · J. ACM 1973
Mathematical optimization
numerical analysis		 0.011973
Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations · J. ACM 1973
Algorithms and data structures › symbolic computation › computational algebra › polynomial evaluation
polynomial root finding		 0.011973
Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations · J. ACM 1973

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

probabilistic analysis · 0.0deterministic analysis · 0.0
YearPublicationVenuePosition
1973 Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations
abstract
Covering algorithms utilized in methods of search for finding zeros of complex polynomials are investigated from both a deterministic and a probabilistic point of view. q -coverings are found to be optimal, and numerical examples of this and other types of coverings are given.
Armin Friedli
 J. ACM1