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 SIGIR 2026 / reviewers in the wild / expert

Anna Pogosyants

dblp:p/APogosyants · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2Computer networks · 1Theory of computation · 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
Distributed computing theory · 57% Logic in computer science · 43%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory › distributed algorithms
randomized distributed algorithms		 0.011995
Formal Verification of Timed Properties for Randomized Distributed Algorithms · PODC 1995

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

formal verification · 0.0expected time complexity analysis · 0.0simulation · 0.0computer-assisted proof · 0.0
YearPublicationVenuePosition
2000 Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
 Distributed Comput.1
1996 Computer-Assisted Verification of an Algorithm for Concurrent Timestamps
Tsvetomir P. Petrov, Anna Pogosyants, Stephen J. Garland, Victor Luchangco, Nancy A. Lynch
 FORTE2
1995 Formal Verification of Timed Properties for Randomized Distributed Algorithms
abstract
In [11] a method for the analysis of the expected time complexity of a randomized distributed algorithm is presented.
Anna Pogosyants, Roberto Segala
 PODC1
1993 Computer-Assisted Simulation Proofs
Jørgen F. Søgaard-Andersen, Stephen J. Garland, John V. Guttag, Nancy A. Lynch, Anna Pogosyants
 CAV5