New Performance-Driven FPGA Routing Algorithms
Author:
- Michael J. AlexanderMAMichael J. Alexander
- 1 December 1995
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the 39th conference on Design automation - DAC '02
- p. 562-567
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On Optimal Interconnections for VLSI1995
- Closing the gap: near-optimal Steiner trees in polynomial timeIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Field-Programmable Gate Array Technology1994
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- Performance-driven interconnect design based on distributed RC delay model1993
- A new class of iterative Steiner tree heuristics with good performanceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- The rectilinear steiner arborescence problemAlgorithmica, 1992
- Field-Programmable Gate Arrays1992
- A fast algorithm for Steiner treesActa Informatica, 1981
- A note on two problems in connexion with graphsNumerische Mathematik, 1959