Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
VLSID
/
Paper
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing.
Rajat Kumar Pal
,
Sudebkumar Prasant Pal
,
Ajit Pal
Venue
National
VLSID
Year
1997
Proceedings
VLSI Design
DBLP record
conf/vlsid/PalPP97 ↗
Browse the full
VLSID paper archive
.