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

Maya Koifman

dblp:89/4157 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Theory of computation · 2Software 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
1 paper
Automated reasoning and model checking · 87% Graph algorithms and graph theory · 13%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
satisfiability
0.112006
Deriving Small Unsatisfiable Cores with Dominators · CAV 2006
Automated reasoning and model checking › satisfiability
unsatisfiable cores
0.112006
Deriving Small Unsatisfiable Cores with Dominators · CAV 2006
Graph algorithms and graph theory › directed graph › directed graph algorithms
dominator computation
0.012006
Deriving Small Unsatisfiable Cores with Dominators · CAV 2006

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

dominator analysis · 0.1
YearPublicationVenuePosition
2008 An approach for extracting a small unsatisfiable core
Roman Gershman, Maya Koifman, Ofer Strichman
Formal Methods Syst. Des.2
2006 Deriving Small Unsatisfiable Cores with Dominators
Roman Gershman, Maya Koifman, Ofer Strichman
CAV2