Algorithms and Data Structures in VLSI Design
โ Scribed by Meinel Christoph
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Leaves
- 279
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
<p>One of the main problems in chip design is the huge number of possible combinations of individual chip elements, leading to a combinatorial explosion as chips become more complex. New key results in theoretical computer science and in the design of data structures and efficient algorithms can be
1. Introduction -- 2. Recursion and backtracking -- 3. Linked lists -- 4. Stacks -- 5. Queues -- 6. Trees -- 7. Priority queues and Heaps -- 8. Disjoint set ADT -- 9. Graph algorithms -- 10. Sorting -- 11. Searching -- 12. Selection algorithms [medians] -- 13. Symbol tables -- 14. Hashing -- 15. Str