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

Sandeep Badida

dblp:13/1140 · DBLP profile ↗
← Back
1ranked-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 · 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
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing › multilayer routing
3d routing		 0.011994
Algorithmic Aspects of Three Dimensional MCM Routing · DAC 1994
Electronic design automation › physical design
routing		 0.011994
Algorithmic Aspects of Three Dimensional MCM Routing · DAC 1994

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

tower decomposition · 0.0spectral partitioning · 0.0
YearPublicationVenuePosition
1994 Algorithmic Aspects of Three Dimensional MCM Routing
abstract
Abstract- In this paper, we present a new routing approach for MCMs in which the routing space is partitioned into several towers. The routing is carried out in three steps. In the rst step, the routing density is uniformly distributed over the three dimensional routing space. In the next step, the exact locations of nets on the faces of each tower are determined. Finally, the exact paths for the nets in each tower are determined and routed. Unlike the traditional MCM routing which converts the three dimensional routing problem into a set of two dimensional routing problems, our approach decomposes the problem into a set of smaller, yet three dimensional tower routing problems. Experimental results show the validity of our methodology. 1
Qiong Yu, Sandeep Badida, Naveed A. Sherwani
 DAC2