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

Vimitha A. Kuruvilla

dblp:61/146 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › timing analysis › statistical timing analysis
statistical static timing analysis
0.212013
Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization · DAC 2013
Electronic design automation › timing analysis
statistical timing analysis
0.212013
Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization · DAC 2013
Electronic design automation
timing analysis
0.212013
Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization · DAC 2013

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

moment matching · 0.2clark's approach · 0.2
YearPublicationVenuePosition
2013 Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization
abstract
Statistical static timing analysis (SSTA) involves computation of maximum (max) and minimum (min) of Gaussian random variables. Typically, the max or min of a set of Gaussians is performed iteratively in a pair-wise fashion, wherein the result of each pair-wise max or min operation is approximated to a Gaussian by matching moments of the true result obtained using Clark's approach [1]. The approximation error in the final result is thus a function of the order in which the pair-wise operations are performed.
Vimitha A. Kuruvilla, Debjit Sinha, Jeff Piaget, Chandu Visweswariah, Nitin Chandrachoodan
DAC1
2008 Optimization of BLAS on the Cell Processor
Vaibhav Saxena, Prashant Agrawal, Yogish Sabharwal, Vijay K. Garg, Vimitha A. Kuruvilla, John A. Gunnels
HiPC5