Author

Derick Wood

📖 Overview

Derick Wood (1940-2021) was a prominent British-Canadian computer scientist and mathematician who specialized in formal languages, algorithms, and data structures. His work significantly influenced theoretical computer science and computational mathematics. Wood served as a professor at multiple institutions including McMaster University and the Hong Kong University of Science and Technology. He authored several foundational textbooks in computer science, with "Theory of Computation" and "Data Structures, Algorithms, and Performance" being among his most influential works. His research made substantial contributions to pattern matching, text algorithms, and computational geometry. Wood developed key theoretical frameworks for XML and markup languages, which helped advance document processing technologies. Wood was a fellow of the Royal Society of Canada and received numerous academic honors for his contributions to computer science education and research. His work continues to influence modern approaches to algorithm design and formal language theory.

👀 Reviews

Reviews of Derick Wood's academic texts focus primarily on their use as teaching materials and technical references. What Readers Liked: - Clear explanations of complex computational concepts - Rigorous mathematical presentations - Comprehensive coverage of formal languages and algorithms - Detailed example problems with solutions What Readers Disliked: - Dense technical writing style that can be difficult for beginners - Limited practical programming examples - High level of mathematical prerequisites needed - Some readers found the notation conventions challenging to follow Ratings: "Theory of Computation" (1987) - Goodreads: 3.8/5 (42 ratings) - Amazon: 4.1/5 (15 ratings) "Data Structures, Algorithms, and Performance" (1993) - Goodreads: 3.9/5 (28 ratings) Most reader reviews come from computer science students and academics. Several graduate students noted Wood's texts helped them prepare for qualifying exams, though undergraduates often struggled with the advanced mathematical content.

📚 Books by Derick Wood

Theory of Computation (2014) A mathematics-focused textbook covering automata theory, formal languages, and computability with detailed proofs and examples.

Data Structures, Algorithms, and Performance (1993) A comprehensive guide to fundamental data structures and algorithms, including analysis of their performance characteristics.

Introduction to the Theory of Parsing, Translation and Compiling: Volume 1: Parsing (1974) An examination of parsing techniques and theory for programming language implementation.

Introduction to the Theory of Parsing, Translation and Compiling: Volume 2: Compiling (1976) A technical exploration of compiler design principles and translation techniques for programming languages.

Algorithmic and Computational Complexity Issues of VLSI (1984) An analysis of algorithms and computational complexity related to Very Large Scale Integration circuit design.

👥 Similar authors

Donald Knuth focuses on algorithms, computer programming, and mathematical analysis like Wood. His multi-volume series "The Art of Computer Programming" covers similar theoretical computer science topics that appear in Wood's work.

Alfred Aho specializes in programming languages, compilers, and automata theory. He co-authored "The Design and Analysis of Computer Algorithms" which parallels Wood's research interests in formal languages and computation.

Jeffrey Ullman writes extensively about database theory and formal languages. His work on parsing algorithms and computational theory aligns with Wood's research on pattern matching and text algorithms.

John Hopcroft publishes on theoretical computer science and abstract machines. His contributions to automata theory and formal languages complement Wood's work on string algorithms and pattern matching.

Mehryar Mohri researches machine learning, automata theory, and algorithms. His publications on weighted automata and string processing relate directly to Wood's contributions in text algorithms and pattern matching.