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

Madhav Natarajan H

dblp:439/4883 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0004-7947-9495ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021

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
Distributed computing theory · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory › fault tolerance › byzantine fault tolerance
byzantine agreement		 1.012026
Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity · PODC 2026
Distributed computing theory
fault tolerance		 1.012026
Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity · PODC 2026

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

cryptographic domain extension · 2.0
YearPublicationVenuePosition
2026 Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity
Ashish Choudhury, Madhav Natarajan H
 PODC2