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

Eilon Reshef

dblp:47/3401 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 3Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Approximation and online algorithms · 58% Distributed computing theory · 33% Mathematical optimization · 9%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
approximation algorithms
0.011998
Deterministic Polylog Approximation for Minimum Communication Spanning Trees · ICALP 1998
Approximation and online algorithms › approximation algorithms › network design
optimum communication spanning tree
0.011998
Deterministic Polylog Approximation for Minimum Communication Spanning Trees · ICALP 1998
Distributed systems
distributed coordination
0.011999
A Variant of the Arrow Distributed Directory with Low Average Complexity · ICALP 1999
Mathematical optimization
distributed optimization
0.011998
Deterministic Polylog Approximation for Minimum Communication Spanning Trees · ICALP 1998
YearPublicationVenuePosition
2019 GECKO - A Tool for Effective Annotation of Human Conversations
Golan Levy, Raquel Sitman, Ido Amir, Eduard Golshtein, Ran Mochary, Eilon Reshef, Roi Reichart, Omri Allouche
INTERSPEECH6
2001 Low Complexity Variants of the Arrow Distributed Directory
David Peleg, Eilon Reshef
J. Comput. Syst. Sci.2
1999 A Variant of the Arrow Distributed Directory with Low Average Complexity
David Peleg, Eilon Reshef
ICALP2
1998 Deterministic Polylog Approximation for Minimum Communication Spanning Trees
David Peleg, Eilon Reshef
ICALP2