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

Nishith Krishna

dblp:82/4146 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consensus		 0.112005
Brief announcement: exploring the consistency problem space · PODC 2005
Distributed systems
consistency models		 0.112005
Brief announcement: exploring the consistency problem space · PODC 2005
Distributed systems
distributed coordination and fault tolerance		 0.112005
Brief announcement: exploring the consistency problem space · PODC 2005
Distributed systems › replication
replica consistency		 0.112005
Brief announcement: exploring the consistency problem space · PODC 2005
Distributed systems › replication
replica control		 0.112005
Brief announcement: exploring the consistency problem space · PODC 2005

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

action-constraint framework · 0.1
YearPublicationVenuePosition
2005 Brief announcement: exploring the consistency problem space
abstract
We study formally the consistency problem, for replicated shared data, in the Action-Constraint framework (ACF). ACF can describe a large range of application semantics and replication protocols, including optimistic and/or partial replication. ACF is used to decompose the consistency problem into simpler sub-problems. Each is easily understood. Existing algorithms from the literature can be explained as combinations of concrete sub-problem implementations. Using ACF, we design a new serialisation algorithm that does not cause aborts and only needs pairwise agreement (not global consensus).
Nishith Krishna, Marc Shapiro 0001, Karthikeyan Bhargavan
 PODC1
2004 A Constraint-Based Formalism for Consistency in Replicated Systems
Marc Shapiro 0001, Karthikeyan Bhargavan, Nishith Krishna
 OPODIS3