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

Proshanto Mukherji

dblp:11/3673 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—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
Automata and formal languages · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
context-free languages		 0.112005
Context-free languages can be accepted with absolutely no space overhead · Inf. Comput. 2005
Computational complexity
space complexity		 0.112005
Context-free languages can be accepted with absolutely no space overhead · Inf. Comput. 2005
YearPublicationVenuePosition
2005 Context-free languages can be accepted with absolutely no space overhead
Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
 Inf. Comput.2
2003 Computation with Absolutely No Space Overhead
Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau
 Developments in Language Theory2