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

G. M. Prabhu

dblp:30/6107 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 1994
0000-0001-5662-5219ORCID · corroborated

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

Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 30% Hardware reliability and fault tolerance · 30% Electronic design automation · 30%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
regression trees		 0.011994
Induction of Multivariate Regression Trees for Design Optimization · AAAI 1994
Interconnection networks and networks-on-chip › switching network
multistage interconnection network		 0.011988
The Kappa Network with Fault-Tolerant Destination Tag Algorithm · IEEE Trans. Computers 1988
Hardware reliability and fault tolerance
network fault tolerance		 0.011988
The Kappa Network with Fault-Tolerant Destination Tag Algorithm · IEEE Trans. Computers 1988
Electronic design automation › physical design
routing		 0.011988
The Kappa Network with Fault-Tolerant Destination Tag Algorithm · IEEE Trans. Computers 1988
Mathematical optimization
design optimization		 0.011994
Induction of Multivariate Regression Trees for Design Optimization · AAAI 1994
Distributed systems
fault tolerance		 0.011988
The Kappa Network with Fault-Tolerant Destination Tag Algorithm · IEEE Trans. Computers 1988

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

multivariate regression trees · 0.0induction · 0.0
YearPublicationVenuePosition
1994 Induction of Multivariate Regression Trees for Design Optimization
B. Forouraghi, L. W. Schmerr, G. M. Prabhu
 AAAI3
1988 Performance analysis of multistage interconnection networks with redundant links
Suresh C. Kothari, G. M. Prabhu, Anita Jhunjhunwala, Robert S. Roberts
 Inf. Sci.2
1988 A Multipath Network with Cross Links
Suresh C. Kothari, G. M. Prabhu, Robert S. Roberts
 J. Parallel Distributed Comput.2
1988 The Kappa Network with Fault-Tolerant Destination Tag Algorithm
abstract
The design of the Gamma network is analyzed in terms of block structure. The analysis reveals the asymmetry of its duplicate links, and an alternate design in the form of the Kappa network is proposed. Its novel feature is the symmetry of duplicate links at the block level. This symmetry results in a simple control algorithm and enhanced fault tolerance. The relationship between the Kappa network and other existing fault-tolerant networks is briefly discussed.>
Suresh C. Kothari, G. M. Prabhu, Robert S. Roberts
 IEEE Trans. Computers2
1982 Algorithms for Generating Fundamental Cycles in a Graph
abstract
The following problem is considered: Given an undirected, connected graph G, find a spanning tree in G such that the sum of the lengths of the fundamental cycles (with respect to this tree) is minimum.This problem, besides being interesting in its own right, is useful in a variety of situations It is shown that this problem is NP-complete.A number of polynomial-time, heuristic algorithms which yield "good" suboptimal solutions are presented and their performances are discussed.Finally, it is shown that for regular graphs of order n the expected value of the total length of a minimum fundamentalcycle set does not exceed O(n2).
Narsingh Deo, G. M. Prabhu, Mukkai S. Krishnamoorthy
 ACM Trans. Math. Softw.2