Combinatorial Algorithms for Integrated Circuit Layout
Series: Wiley Teubner Series on Applicable Theory in Computer Science;
- Publisher's listprice GBP 288.75
-
146 136 Ft (139 177 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 14 614 Ft off)
- Discounted price 131 522 Ft (125 259 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
146 136 Ft
Availability
Out of print
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher John Wiley & Sons
- Date of Publication 25 July 1990
- ISBN 9780471928386
- Binding Hardback
- No. of pages726 pages
- Size 58x35x15 mm
- Weight 1260 g
- Language English 0
Categories
Short description:
The explosive growth of integrated circuitry has created a need for a one-stop reference source that combines practical with theoretical aspects of the subject. This work takes a major step in this direction by offering a unified compilation that will be useful for both practitioners and theoreticians interested in circuit layout.
MoreLong description:
The explosive growth of integrated circuitry has created a need for a one-stop reference source that combines practical with theoretical aspects of the subject. This work takes a major step in this direction by offering a unified compilation that will be useful for both practitioners and theoreticians interested in circuit layout. It presents an overview of what are currently the most important combinatorial problems in circuit layout and describes their solutions. Discussions cover algorithms currently used in layout systems, as well as some new algorithmic developments that hold promise of stimulating the improvement of layout systems in the future.
MoreTable of Contents:
Optimization Problems.
Graph Algorithms.
Operations Research and Statistics.
COMBINATORIAL LAYOUT PROBLEMS.
The Layout Problem.
Circuit Partitioning.
Placement, Assignment, and Floorplanning.
Global Routing and Area Routing.
Detailed Routing.
Compaction.
Bibliography.
Author Index.
Subject Index.
