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

Pradyut Shah

dblp:11/2407 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
—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
Computational complexity · 67% Graph algorithms and graph theory · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity
circuit complexity		 0.012000
A Lower Bound for the Shortest Path Problem · CCC 2000
Computational complexity › parallel complexity
PRAM lower bounds		 0.012000
A Lower Bound for the Shortest Path Problem · CCC 2000
Graph algorithms and graph theory
shortest path		 0.012000
A Lower Bound for the Shortest Path Problem · CCC 2000
Parallel and multicore computing
parallel algorithms		 0.012000
A Lower Bound for the Shortest Path Problem · CCC 2000

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

lower bound arguments · 0.0lower bound argument · 0.0
YearPublicationVenuePosition
2001 A Lower Bound for the Shortest Path Problem
Ketan Mulmuley, Pradyut Shah
 J. Comput. Syst. Sci.2
2000 A Lower Bound for the Shortest Path Problem
abstract
We show that the shortest path problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of the weights on the edges are restricted to be of size O(log/sup 3/ n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations.
Ketan Mulmuley, Pradyut Shah
 CCC2