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

Ran Adler

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

Computer networks
1 paper
Routing and switching · 50% Internet architecture and protocols · 50%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › signaling
call control		 0.011999
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms · SODA 1999
Routing and switching › multipath routing
disjoint paths		 0.011999
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms · SODA 1999
Approximation and online algorithms
online algorithms		 0.011999
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms · SODA 1999

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

randomization · 0.0
YearPublicationVenuePosition
1999 Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
Ran Adler, Yossi Azar
 SODA1