W
Weiping Shi
Researcher at Texas A&M University
Publications - 97
Citations - 1867
Weiping Shi is an academic researcher from Texas A&M University. The author has contributed to research in topics: Very-large-scale integration & Automatic test pattern generation. The author has an hindex of 27, co-authored 97 publications receiving 1812 citations. Previous affiliations of Weiping Shi include University of North Texas & Michigan Technological University.
Papers
More filters
Proceedings ArticleDOI
K longest paths per gate (KLPG) test generation for scan-based sequential circuits
Wangqi Qiu,Jing Wang,Duncan M. Walker,D. Reddy,Xiang Lu,Zhuo Li,Weiping Shi,Hari Balachandran +7 more
TL;DR: Experiments show that testing transition faults through the longest paths can be done in reasonable test set size and the test generation efficiency is evaluated on ISCAS89 benchmark circuits and industrial designs.
Proceedings ArticleDOI
A fast hierarchical algorithm for 3-D capacitance extraction
TL;DR: A new algorithm for computing the capacitance of three-dimensional perfect electrical conductors of complex structures that is significantly faster and uses muc h less memory than previous best algorithms, and is kernel independent.
Journal ArticleDOI
A fast hierarchical algorithm for three-dimensional capacitance extraction
TL;DR: The authors present a new algorithm for computing the capacitance of three-dimensional electrical conductors of complex structures that is significantly faster and uses much less memory than previous best algorithms and is kernel independent.
Proceedings ArticleDOI
The rectilinear Steiner arborescence problem is NP-complete
Weiping Shi,Chen Su +1 more
TL;DR: This document summarizes current capabilities, research and operational priorities, and plans for further studies that were established at the 2015 USGS workshop on quantitative hazard assessments of earthquake-triggered landsliding and liquefaction.
Journal ArticleDOI
Fast Algorithms for Slew-Constrained Minimum Cost Buffering
TL;DR: A highly efficient algorithm based on dynamic programming is proposed to optimally solve slew buffering with discrete buffer locations and a new algorithm using the maximum matching technique is developed to handle the difficult cases in which no assumption is made on buffer input slew.