Demo Data from SIGIR 2026 / reviewers in the wild / expert
Zeynep Dayar
dblp:10/2972
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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 |
Logic in computer science · 88% Information theory · 12% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
semantics |
0.0 | 1 | 1999 | Testing Preorders for Probabilistic Processes · Inf. Comput. 1999 |
Logic in computer science › concurrency theory
testing preorders |
0.0 | 1 | 1999 | Testing Preorders for Probabilistic Processes · Inf. Comput. 1999 |
Logic in computer science
process algebra |
0.0 | 1 | 1999 | Testing Preorders for Probabilistic Processes · Inf. Comput. 1999 |
Information theory › probability theory
stochastic processes |
0.0 | 1 | 1999 | Testing Preorders for Probabilistic Processes · Inf. Comput. 1999 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Testing Preorders for Probabilistic Processes
Rance Cleaveland, Zeynep Dayar, Scott A. Smolka, Shoji Yuen |
Inf. Comput. | 2 |
| 1994 | Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
Shoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka |
CONCUR | 3 |