Theoretical Computer Sciences
Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 9-17, 1975
1st Edition
Published on 10. June 2011
184 pages
978-3-642-11120-4 (ISBN)
Description
R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.
More details
Other editions
Additional editions
F. Preparata
Theoretical Computer Sciences
Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 9-17, 1975
Book
05/2011
Springer
€29.95
Shipment within 7-9 days
Content
- Intro
- Theoretical Computer Science
- PARALLEL PROGRAM SCHEMATA
- Configurable Computers and the Data FlowModel Transformation
- Configurable Computers
- Interconnection Mode Configurab1es
- Data Sequenced Program Transformation
- An Example of Data Flow Model Transformation
- REFERENCES
- Computation Graphs and Petri Nets
- References
- Parallel Program Schemata
- REFERENCES
- Relationships fiehieelf Various Mode1.sof Parallelism and Synchronization
- Vector AdClTITon anaVector Replacement Systems
- Computation Graphs andUnshared Producer-Consumer Systems
- Generalized Petri Nets and Vector Additionand Vector Replacemet Systems
- References
- THEORY OF AUTOMATA
- References
- COMPUTATIONAL COMPLEXITY OF COMBINATORIALAND GRAPH-THEORETIC PROBLEMS
- 1. Basic Terminology
- 2. Depth-First Search and Its Applications [58]
- 3. Computing Shortest Paths [13],[15]
- 4. Computing Maximum Flows [14J,[19J
- 5. Matching Theory' [3],[16],[18],[22],[26],[32]
- 6. On the Computational Complexity of Combinatorial Prob1emst
- 7. The Fast Approximate Solution of Hard Combinatorial Problems
