Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Home
Proceedings
VTEST
VTEST 2000
Generate Citations
Proceedings 18th IEEE VLSI Test Symposium
April 30 2000 to May 4 2000
Montreal, Quebec, Canada
Table of Contents
The left edge algorithm and the tree growing technique in block-test scheduling under power constraints
Full-text access may be available. Sign in or learn about subscription options.
pp. 417-422
by
Valentin Muresan
,
X. Wang
,
Valentina Muresan
,
M. Vladutiu
Showing 1 out of 1