This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and organised by the editors.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Book Description
The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science.
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
The specification, design, construction, evaluation and maintenance of computing systems involve significant theoretical problems that are common to hardware and software. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
primitive computation graph, palindrome recognizer, user specification process, serial refinement, linear composition rule, linear retimings, synchronous concurrent algorithms, boolean streams, initial reference word, retiming property, complete reference word, stream transformer, guarded recursive specification, retiming transformations, service circuitry, systolic model, combinational complexity, systolic algorithms, graph signature, monotone complexity, applicative form, processor interpretation, abstraction phase, data flow representation, systolic systems Key Phrases - Capitalized Phrases (CAPs): (learn more)
Springer Verlag, Lecture Notes, Technical Report, University of Leeds, Academic Press, Working Conference, University of Cambridge, Computer Laboratory, Retiming Lemma, University of Strathclyde, Kluwer Academic Publishers, School of Computer Studies, North Holland, Proof Let, Proof Omitted, Cambridge University Press, Carnegie-Mellon University, Adam Hilger, Oxford University, Programming Research Group, Delgado Kloos, Department of Computer Studies, Department of Electrical Engineering, Englewood Cliffs, Fogelman Soulie New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
The specification, design, construction, evaluation and maintenance of computing systems involve significant theoretical problems that are common to hardware and software. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
primitive computation graph, palindrome recognizer, user specification process, serial refinement, linear composition rule, linear retimings, synchronous concurrent algorithms, boolean streams, initial reference word, retiming property, complete reference word, stream transformer, guarded recursive specification, retiming transformations, service circuitry, systolic model, combinational complexity, systolic algorithms, graph signature, monotone complexity, applicative form, processor interpretation, abstraction phase, data flow representation, systolic systems Key Phrases - Capitalized Phrases (CAPs): (learn more)
Springer Verlag, Lecture Notes, Technical Report, University of Leeds, Academic Press, Working Conference, University of Cambridge, Computer Laboratory, Retiming Lemma, University of Strathclyde, Kluwer Academic Publishers, School of Computer Studies, North Holland, Proof Let, Proof Omitted, Cambridge University Press, Carnegie-Mellon University, Adam Hilger, Oxford University, Programming Research Group, Delgado Kloos, Department of Computer Studies, Department of Electrical Engineering, Englewood Cliffs, Fogelman Soulie New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 61
books:
See all 61 books this book cites
33
books
cite this book:
See all 33 books citing this book
- Computer Science by Richard Jones on 5 pages
- Systolic Arrays, Papers presented at the First INT Workshop on Systolic Arrays, Oxford 2-4 July 1986 by Will Moore on 5 pages
- Computer Graphics by Acm Press on page 43, page 60, and page 401
- Mathematics and Computer Science by J. W. De Bakker in Front Matter, page 157, and page 158
- Fundamental algorithms for computer graphics (NATO ASI series. Series F, Computer and system sciences) on page 60, page 262, and page 401
See all 61 books this book cites
- Higher Order Logic and Hardware Verification (Cambridge Tracts in Theoretical Computer Science) by T. F. Melham on 4 pages
- Lectures in Parallel Computation (Cambridge International Series on Parallel Computation) by Alan Gibbons on page 318, page 328, and page 332
- Basic Simple Type Theory (Cambridge Tracts in Theoretical Computer Science) by J. Roger Hindley in Front Matter
- Belief Revision (Cambridge Tracts in Theoretical Computer Science) by Peter Gärdenfors in Front Matter
- Mathematical Theory of Domains (Cambridge Tracts in Theoretical Computer Science) by V. Stoltenberg-Hansen in Front Matter
See all 33 books citing this book
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
