search for books and compare prices
Tables of Contents for Current Trends in Theoretical Computer Science
Chapter/Section Title
Page #
Page Count
Computational Complexity
1
114
Introductory Remarks
2
2
A Machine Model for the Complexity of NP-Approximation Problems
4
21
Some Pointed Questions Concerning Asymptotic Lower Bounds, and News from the Isomorphism Front
25
17
Propositional Proof Complexity: Past, Present, and Future
42
29
Progress in Descriptive Complexity
71
12
Twelve Problems in Resource-Bounded Measure
83
19
Diagonalization
102
13
Formal Specification
115
118
Introductory Remarks
116
2
Theory and Practice of Software Development: A Review of Driving Forces and Expectations of TAPSOFT from 1985 to 1997
118
13
On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000
131
3
Algebraic Techniques in Software Development: A Review of Progress up to the Mid Nineties
134
19
CoFI: The Common Framework Initiative for Algebraic Specification and Development
153
11
Getgrats and Appligraph: Theory and Applications of Graph Transformation
164
7
Classification of Petri Nets Using Adjoint Functors
171
9
Dynamic Abstract Data Types: An Informal Proposal in 1994
180
12
Integration Paradigm for Data Type and Process Specification Techniques
192
10
From Basic Views and Aspects to Integration of Specification Formalisms
202
13
On a Reference Model for the Formalization and Integration of Software Specification Languages
215
11
On Formal Semantics and Integration of Object-Oriented Modeling Languages
226
7
Logic in Computer Science
233
204
Introductory Remarks
234
1
Characterizations of Regular Languages in Low Level Complexity Classes
235
12
AMAST'91 Banquet Talk
247
7
Logic on Words
254
20
The Value, if Any, of Decidability
274
7
Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand
281
22
Herbrand's Theorem and Equational Reasoning: Problems and Solutions
303
24
From Invariants to Canonization
327
5
The Complexity of Propositional Proofs
332
11
Functions Versus Algorithms
343
20
The Sequential ASM Thesis
363
30
Why are Modal Logics so Robustly Decidable?
393
16
The Underlying Logic of Hoare Logic
409
28
Concurrency
437
106
Introductory Remarks
438
1
Does Concurrency Theory Have Anything to Say About Parallel Programming?
439
8
Homotopy and Concurrency
447
13
Towards Global Computations Guided by Concurrency Theory
460
9
What is Branching Time Semantics and Why to Use it?
469
11
More Infinite Results
480
24
Conservative Extension in Structural Operational Semantics
504
21
Security Analysis Using Flow Logics
525
18
Natural Computing
543
148
Introductory Remarks
544
2
Theory of Genetic Algorithms
546
33
Why Evolutionary Algorithms?
579
24
Natural Data Mining Techniques
603
11
Theoretical and Experimental DNA Computation
614
17
The Genomics Revolution and its Challenges for Algorithmic Research
631
12
An Introduction to Quantum Computing
643
21
Quantum Computing and Communication Complexity
664
16
Neural Computation: A Research Topic for Theoretical Computer Science? Some Thoughts and Pointers
680
11
Formal Language Theory
691
176
Introductory Remarks
692
1
Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring
693
15
On Slender Languages
708
9
Simple Words in Equality Sets
717
17
The DOL Problem Revisited
734
6
Lindenmayer and DNA: Watson-Crick DOL Systems
740
12
Words on Trajectories
752
19
Networks of Language Processors
771
20
Networks of Language Processors: Parallel Communicating Systems
791
20
DNA Computers: Tomorrow's Reality
811
19
Splicing: A Challenge for Formal Language Theorists
830
15
Computing with Membranes (P Systems): An Introduction
845
22
About the Editors
867