Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Selected Works (8)
- Loyola University Chicago (5)
- University of Dayton (4)
- Nova Southeastern University (3)
- Old Dominion University (2)
-
- Air Force Institute of Technology (1)
- East Tennessee State University (1)
- Edith Cowan University (1)
- Rhode Island College (1)
- San Jose State University (1)
- University of Denver (1)
- University of Missouri, St. Louis (1)
- University of Nebraska - Lincoln (1)
- University of Nebraska at Omaha (1)
- University of San Diego (1)
- Publication Year
- Publication
-
- Computer Science Faculty Publications (5)
- Computer Science: Faculty Publications and Other Works (5)
- Ronald Greenberg (5)
- CCE Theses and Dissertations (3)
- Zhongmei Yao (3)
-
- Undergraduate Honors Theses (2)
- Electrical & Computer Engineering Faculty Publications (1)
- Electronic Theses and Dissertations (1)
- Faculty Publications, Computer Science (1)
- Honors Projects (1)
- Honors Theses (1)
- Theses (1)
- Theses and Dissertations (1)
- Theses/Capstones/Creative Projects (1)
- Theses: Doctorates and Masters (1)
- Publication Type
Articles 31 - 32 of 32
Full-Text Articles in Entire DC Network
Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih
Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih
Computer Science: Faculty Publications and Other Works
The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Computer Science: Faculty Publications and Other Works
We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.