- Author:
- Jan Van Leeuwen
From the Publisher:
Theoretical computer science provides the foundations for understanding and exploiting the concepts and mechanisms in computing and information processing. This handbook will provide professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. It consists of thirty-seven chapters in two volumes, all addressing core areas of theoretical computer science as it is practiced today. The material is written by leading American and European researchers, and each volume may be used independently.
Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B presents a choice of material on the theory of automata and rewriting systems, the foundations of modem programming languages, logics for program specification and verification, and several chapters on the theoretic modeling of advanced information processing. The organization of each volume reflects the development of theoretical computer science from its classical roots to the modem theoretical approaches in parallel and distributed computing. Extensive bibliographies, a subject index, and list of contributors are included in each volume.
Cited By
- Chattopadhyay E and Zuckerman D New extractors for interleaved sources Proceedings of the 31st Conference on Computational Complexity, (1-28)
Desnoyers M, McKenney P and Dagenais M (2013). Multi-core systems modeling for formal verification of parallel algorithms, ACM SIGOPS Operating Systems Review, 47:2, (51-65), Online publication date: 23-Jul-2013.- Cederquist J and Dashti M Complexity of fairness constraints for the Dolev-Yao attacker model Proceedings of the 2011 ACM Symposium on Applied Computing, (1502-1509)
- Shankar N (2009). Automated deduction for verification, ACM Computing Surveys (CSUR), 41:4, (1-56), Online publication date: 1-Oct-2009.
- Liu B, Lombardi F, Park N and Choi M (2004). Testing Layered Interconnection Networks, IEEE Transactions on Computers, 53:6, (710-722), Online publication date: 1-Jun-2004.
- Nalumasu R and Gopalakrishnan G (2019). An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation, Formal Methods in System Design, 20:3, (231-247), Online publication date: 1-May-2002.
- Nasuto S, Dautenhahn K and Bishop M Communication as an emergent metaphor for neuronal operation Computation for metaphors, analogy, and agents, (365-379)
- Droste S, Jansen T and Wegener I (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs, Evolutionary Computation, 6:2, (185-196), Online publication date: 1-Jun-1998.
- Ness L (2019). L.0, IEEE Transactions on Software Engineering, 19:4, (410-423), Online publication date: 1-Apr-1993.
