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

Venkatraman Viswanathan

dblp:99/4720 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 2Theory of computation · 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
Algorithms and data structures · 87% Computational complexity · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms
dynamic programming		 0.011994
Parallel Dynamic Programming · IEEE Trans. Parallel Distributed Syst. 1994
Parallel and multicore computing
parallel algorithms		 0.011994
Parallel Dynamic Programming · IEEE Trans. Parallel Distributed Syst. 1994
Algorithms and data structures
dynamic programming		 0.011994
Parallel Dynamic Programming · IEEE Trans. Parallel Distributed Syst. 1994
Algorithms and data structures › parallel algorithms
PRAM algorithms		 0.011994
Parallel Dynamic Programming · IEEE Trans. Parallel Distributed Syst. 1994

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

parallel algorithm · 0.0CREW PRAM · 0.0
YearPublicationVenuePosition
1994 Parallel Dynamic Programming
abstract
Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming problems. The algorithm uses O(n/sup 6//log n) processors and runs in O(log/sup 2/ n) time. In this article, a modified algorithm is presented that reduces the processor requirement to O(n/sup 6//log /sup 5/n) while maintaining the same time complexity of O(log/sup 2/ n).>
Shou-Hsuan Stephen Huang, Venkatraman Viswanathan
 IEEE Trans. Parallel Distributed Syst.3
1992 A Sublinear Parallel Algorithm for Some Dynamic Programming Problems
Shou-Hsuan Stephen Huang, Venkatraman Viswanathan
 Theor. Comput. Sci.3
1990 A Sub-linear Parallel Algorithm for Some Dynamic Programming Problems
Shou-Hsuan Stephen Huang, Venkatraman Viswanathan
 ICPP (3)3