Yehuda Hassin

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

dblp:54/1126 · DBLP profile ↗

← Back

8ranked-venue papers

7as first author

0since 2021 · last 2008

0000-0002-5447-758XORCID · corroborated

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

Theory of computation · 4 · 4 first-authorSystems, architecture and hardware · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 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 3 papers		Distributed computing theory · 100%
Computer networks 1 paper		Routing and switching · 67% Network optimization and economics · 33%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Distributed systems · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Distributed computing theory consensus	0.1	2	2001	Distributed Probabilistic Polling and Applications to Proportionate Agreement · Inf. Comput. 2001 Distributed Probabilistic Polling and Applications to Proportionate Agreement · ICALP 1999
Distributed computing theory › quorum systems coteries	0.0	1	2001	Average probe complexity in quorum systems · PODC 2001
Distributed computing theory quorum systems	0.0	1	2001	Average probe complexity in quorum systems · PODC 2001
Routing and switching geographic routing	0.0	1	2000	Sparse communication networks and efficient routing in the plane (extended abstract) · PODC 2000
Network optimization and economics network design	0.0	1	2000	Sparse communication networks and efficient routing in the plane (extended abstract) · PODC 2000
Routing and switching › routing routing schemes	0.0	1	2000	Sparse communication networks and efficient routing in the plane (extended abstract) · PODC 2000
Distributed systems distributed coordination	0.0	1	2001	Distributed Probabilistic Polling and Applications to Proportionate Agreement · Inf. Comput. 2001

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

probabilistic analysis · 0.1randomized algorithm · 0.0combinatorial bounds · 0.0network topology design · 0.0

Year	Publication	Venue	Position
2008	Collective Reuse of Software Components Speeds-Up Reliability Iaakov Exman, Guy Zohar, Yehuda Hassin	ICSR	3
2006	Average probe complexity in quorum systems Yehuda Hassin, David Peleg	J. Comput. Syst. Sci.	1
2001	Average probe complexity in quorum systems abstract This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of non-dominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes. Yehuda Hassin, David Peleg	PODC	1
2001	Sparse communication networks and efficient routing in the plane Yehuda Hassin, David Peleg	Distributed Comput.	1
2001	Distributed Probabilistic Polling and Applications to Proportionate Agreement Yehuda Hassin, David Peleg	Inf. Comput.	1
2000	Sparse communication networks and efficient routing in the plane (extended abstract) abstract Traditional approaches to network design separate the issues of designing the network itself and designing its management and control subsystems. This paper proposes an approach termed routing-oriented network design, which is based on designing the network topology and its routing scheme together, attempting to optimize some of the relevant parameters of both simultaneously. Yehuda Hassin, David Peleg	PODC	1
2000	Extremal bounds for probabilistic polling in graphs Yehuda Hassin, David Peleg	SIROCCO	1
1999	Distributed Probabilistic Polling and Applications to Proportionate Agreement Yehuda Hassin, David Peleg	ICALP	1