C.J. Alpert, G. Gandham, M. Hrkic, J. Hu, A.B. Kahng, J. Lillis, B. Liu, S.T. Quay, S.S. Sapatnekar, and A.J. Sullivan. Buffered Steiner trees for difficult instances. IEEE Transactions on Computer-Aided Design, 21(1):3--14, January 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
S-Tree: A Technique for Buffered Routing Tree Synthesis - Hrkic, Lillis (2002) (Correct)
....it may be preferable to disregard (to a limited degree) the physical locality of such sinks at the expense of additional wire length so that they may be tapped off with a single buffer. A similar phenomenon occurs when sinks have specified signal polarity requirements as pointed out recently in [1]. The algorithm presented herein is designed to deal with both issues. Ability to Handle Relatively High Fanout Nets It is often the case that in a typical modern design flow we see some signal nets with relatively high fanout (e.g. 15 pins or more) Such nets may result from the removal of ....
C. Alpert, et. al. "Buffered Steiner Trees for Difficult Instances," ISPD-01, pp. 4-9.
Porosity Aware Buffered Steiner Tree Construction - Alpert, Gandham, Hrkic, Hu.. (2003) Self-citation (Alpert Gandham Hrkic Hu Quay) (Correct)
No context found.
C.J. Alpert, G. Gandham, M. Hrkic, J. Hu, A.B. Kahng, J. Lillis, B. Liu, S.T. Quay, S.S. Sapatnekar, and A.J. Sullivan. Buffered Steiner trees for difficult instances. IEEE Transactions on Computer-Aided Design, 21(1):3--14, January 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC