A few more trouble spots in ALGOL 60. - Derick Wood (Commun. ACM, 1969)

The normal form theorem - another proof. - Derick Wood (Comput. J., 1969)

The theory of left factored languages: Part 1. - Derick Wood (Comput. J., 1969)

The Theory of Left Factored Languages: Part 2. - Derick Wood (Comput. J., 1970)

A Generalised Normal Form Theorem for Context-Free Grammars. - Derick Wood (Comput. J., 1970)

A Further Note on Top-Down Deterministic Languages. - Derick Wood (Comput. J., 1971)

A Factor Theorem for Subsets of a Free Monoid - Derick Wood (Inf. Control., 1972)

A Characterization Theorem for n-Parallel Right Linear Languages. - Robert D. Rosebrugh; Derick Wood (J. Comput. Syst. Sci., 1973)

Bounded Parallelism and Regular Languages. - Derick Wood (L Systems, 1974)

Generative Models for Parallel Processes. - Grzegorz Rozenberg; Derick Wood (Comput. J., 1974)

Szilard Languages of L-Systems. - Hermann A. Maurer; Derick Wood (Automata, Languages, Development, 1975)

A note on Lindenmayer systems, Szilard languages, spectra, and equivalence. - Derick Wood (Int. J. Parallel Program., 1975)

Time-delayed OL languages and sequences. - Derick Wood (Inf. Sci., 1975)

Image Theorems for Simple Matrix Languages and n-Parallel Languages. - Robert D. Rosebrugh; Derick Wood (Math. Syst. Theory, 1975)

On Grammar Forms with Terminal Context. - Hermann A. Maurer; Derick Wood (Acta Informatica, 1976)

Locally Balanced Binary Trees. - A. Walker; Derick Wood (Comput. J., 1976)

A Note on K-Iteration Grammars. - Grzegorz Rozenberg; Derick Wood (Inf. Process. Lett., 1976)

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. - Jan van Leeuwen; Derick Wood (Theor. Comput. Sci., 1976)

Iterated a-NGSM Maps and Gamma Systems - Derick Wood (Inf. Control., 1976)

EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Acta Informatica, 1977)

Two Variations on n-Parallel Finite State Generators. - Derick Wood (Comput. J., 1977)

Generalized time-delayed OL languages. - Derick Wood (Inf. Sci., 1977)

Precedence Relations in Grammar Forms. - Seymour Ginsburg; Derick Wood (Acta Informatica, 1978)

Right Brother Trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Commun. ACM, 1978)

Speed-varying OL systems. - Karel Culík II; Derick Wood (Inf. Sci., 1978)

An approach to a unified theory of grammar and L forms. - Vijay K. Vaishnavi; Derick Wood (Inf. Sci., 1978)

Relative Goodness for EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1978)

ETOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1978)

On Good E0L Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (SIAM J. Comput., 1978)

One-sided height-balanced search trees. - Derick Wood (SIGACT News, 1978)

Uniform Interpretations of L Forms - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1978)

A Uniform Approach to Balanced Binary and Multiway Trees. - Thomas Ottmann; Derick Wood (MFCS, 1979)

A Survey of Grammar and L Forms-1978. - Derick Wood (MFCS, 1979)

Node-Visit Optimal 1-2 Brother Trees. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (Theoretical Computer Science, 1979)

On the correspondence between AVL trees and brother trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1979)

One-sided k-height-balanced trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1979)

Height balanced 2-3 trees. - Vijay K. Vaishnavi; Hans-Peter Kriegel; Derick Wood (Computing, 1979)

Pure interpretations for EOL forms. - Hermann A. Maurer; Grzegorz Rozenberg; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1979)

On Non Context-Free Grammar Forms. - Hermann A. Maurer; Martti Penttonen; Arto Salomaa; Derick Wood (Math. Syst. Theory, 1979)

Storage Representations for Tree-Like Data Structures. - Arnold L. Rosenberg; Derick Wood; Zvi Galil (Math. Syst. Theory, 1979)

Context-Dependent L Forms - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1979)

A Mathematical Investigation of Propagating Graph 0L Systems - Karel Culík II; Derick Wood (Inf. Control., 1979)

Grammars and L Forms: An Introduction - Derick Wood (Springer, 1980)

Approaches to Concurrency in B-Trees. - Yat-Sang Kwong; Derick Wood (MFCS, 1980)

Concurrent Operations in Large Ordered Indexes. - Yat-Sang Kwong; Derick Wood (Symposium on Programming, 1980)

On B-Trees: Routing Schemes and Concurrency. - Yat-Sang Kwong; Derick Wood (SIGMOD Conference, 1980)

The Analysis of Search Trees: A Survey. - Thomas Ottmann; Hans-Werner Six; Derick Wood (WG, 1980)

On Generators and Generative Capacity of EOL Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Acta Informatica, 1980)

Context-Free Grammars With Selective Rewriting. - Grzegorz Rozenberg; Derick Wood (Acta Informatica, 1980)

Optimum Multiway Search Trees. - Vijay K. Vaishnavi; Hans-Peter Kriegel; Derick Wood (Acta Informatica, 1980)

The Rectangle Intersection Problem Revisited. - Hans-Werner Six; Derick Wood (BIT, 1980)

1-2 Brother Trees or AVL Trees Revisited. - Thomas Ottmann; Derick Wood (Comput. J., 1980)

Dynamization of Decomposable Searching Problems. - Jan van Leeuwen; Derick Wood (Inf. Process. Lett., 1980)

Space and time optimal algorithms for a class of rectangle intersection problems. - Vijay K. Vaishnavi; Hans-Peter Kriegel; Derick Wood (Inf. Sci., 1980)

Context-Free Grammar Forms with Strict Interpretations. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1980)

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. - Jon Louis Bentley; Derick Wood (IEEE Trans. Computers, 1980)

Synchronized E0L Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1980)

Pure Grammars - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1980)

MSW Spaces - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1980)

On Structural Similarity of Context-Free Grammars. - Eljas Soisalon-Soininen; Derick Wood (MFCS, 1981)

A Realistic Cost Measure for Binary Search Trees. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (WG, 1981)

The implementation of insertion and deletion algorithms for 1-2 brother trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1981)

Colorings and interpretations: a connection between graphs and grammar forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Discret. Appl. Math., 1981)

Decidability and density in two-symbol grammar forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Discret. Appl. Math., 1981)

Cut point languages of markov DTOL systems. - Helmut Jürgensen; David E. Matthews 002; Derick Wood (Int. J. Parallel Program., 1981)

Sub-Regular Grammar Forms. - Thomas Ottmann; Arto Salomaa; Derick Wood (Inf. Process. Lett., 1981)

Synchronized EOL Forms Under Uniform Interpretation. - Hermann A. Maurer; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1981)

The Measure Problem for Rectangular Ranges in d-Space. - Jan van Leeuwen; Derick Wood (J. Algorithms, 1981)

Completeness of Context-Free Grammar Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. Comput. Syst. Sci., 1981)

Uniform Interpretations of Grammar Forms. - Hermann A. Maurer; Arto Salomaa; Derick Wood (SIAM J. Comput., 1981)

Dense Multiway Trees. - Karel Culík II; Thomas Ottmann; Derick Wood (ACM Trans. Database Syst., 1981)

Life and Death in Markov Deterministic Tabled OL Systems - Helmut Jürgensen; David E. Matthews 002; Derick Wood (Inf. Control., 1981)

On the Complete Simulation of DOL Schemes and Locally Catenative Schemes - Youichi Kobuchi; Derick Wood (Inf. Control., 1981)

On Predecessors of Finite Languages - Hermann A. Maurer; Arto Salomaa; Derick Wood (Inf. Control., 1981)

A Note on Recurrent Words - Karel Culík II; Derick Wood (Inf. Control., 1981)

An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. - Eljas Soisalon-Soininen; Derick Wood (PODS, 1982)

On a Covering Relation for Context-Free Grammars. - Eljas Soisalon-Soininen; Derick Wood (Acta Informatica, 1982)

Stabbing Line Segments. - Herbert Edelsbrunner; Hermann A. Maurer; Franco P. Preparata; Arnold L. Rosenberg; Emo Welzl; Derick Wood (BIT, 1982)

Self-regulating L Systems. - Helmut Jürgensen; Derick Wood (J. Inf. Process. Cybern., 1982)

The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees - Bernhard Eisenbarth; Nivio Ziviani; Gaston H. Gonnet; Kurt Mehlhorn; Derick Wood (Inf. Control., 1982)

A comparison of iterative and defined classes of search trees. - Thomas Ottmann; Derick Wood (Int. J. Parallel Program., 1982)

A Note on Some Tree Similarity Measures. - Karel Culík II; Derick Wood (Inf. Process. Lett., 1982)

A Three-Restricted Normal Form Theorem for ET0L Languages. - Takashi Yokomori; Derick Wood; Klaus-Jörn Lange (Inf. Process. Lett., 1982)

The parenthesis tree. - Ralf Hartmut Güting; Derick Wood (Inf. Sci., 1982)

Dense Hierarchies of Grammatical Families. - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. ACM, 1982)

Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. - Vijay K. Vaishnavi; Derick Wood (J. Algorithms, 1982)

Finitary and Infinitary Interpretations of Languages. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Math. Syst. Theory, 1982)

Counting and Reporting Intersections of d-Ranges. - Hans-Werner Six; Derick Wood (IEEE Trans. Computers, 1982)

A New Method for Concurrency in B-Trees. - Yat-Sang Kwong; Derick Wood (IEEE Trans. Software Eng., 1982)

Height-Ratio-Balanced Trees. - Gaston H. Gonnet; Henk J. Olivié; Derick Wood (Comput. J., 1983)

Direct dynamic structures for some line segment problems. - Gaston H. Gonnet; J. Ian Munro; Derick Wood (Comput. Vis. Graph. Image Process., 1983)

Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. - Jürgen Albert; Derick Wood (J. Comput. Syst. Sci., 1983)

L Codes and Number Systems. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1983)

A Supernormal-Form Theorem for Context-Free Grammars - Hermann A. Maurer; Arto Salomaa; Derick Wood (J. ACM, 1983)

The Complexity and Decidability of Separation. - Bernard Chazelle; Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (ICALP, 1984)

Binary search trees with binary comparison cost. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (Int. J. Parallel Program., 1984)

Inverse Morphic Equivalence on Languages. - Juhani Karhumäki; Derick Wood (Inf. Process. Lett., 1984)

The Contour Problem for Rectilinear Polygons. - Derick Wood (Inf. Process. Lett., 1984)

On the Definition and Computation of Rectlinear Convex Hulls. - Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (Inf. Sci., 1984)

An Inverse Homomorphic Characterization of Full Principal AFL. - Takashi Yokomori; Derick Wood (Inf. Sci., 1984)

Systolic Tree Acceptors. - Karel Culík II; Arto Salomaa; Derick Wood (RAIRO Theor. Informatics Appl., 1984)

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. - Herbert Edelsbrunner; Jan van Leeuwen; Thomas Ottmann; Derick Wood (RAIRO Theor. Informatics Appl., 1984)

Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. - Eljas Soisalon-Soininen; Derick Wood (J. Algorithms, 1984)

Minimal-Cost Brother Trees. - Thomas Ottmann; Douglas Stott Parker Jr.; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (SIAM J. Comput., 1984)

Finding Rectangle Intersections by Divide-and Conquer. - Ralf Hartmut Güting; Derick Wood (IEEE Trans. Computers, 1984)

Computing a convex skill of an orthogonal polygon. - Derick Wood; Chee-Keng Yap (SCG, 1985)

Purely Top-Down Updating Algorithms for Stratified Search Trees. - Thomas Ottmann; Michael Schrapp; Derick Wood (Acta Informatica, 1985)

A fast algorithm for the Boolean masking problem. - Thomas Ottmann; Peter Widmayer; Derick Wood (Comput. Vis. Graph. Image Process., 1985)

Weight-balanced trees are not stratified. - Thomas Ottmann; Michael Schrapp; Derick Wood (Bull. EATCS, 1985)

Search Trees and Bubble Memories. - Philippe Flajolet; Thomas Ottmann; Derick Wood (RAIRO Theor. Informatics Appl., 1985)

Optimal Dynamic Solutions for Fixed Windowing Problems. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (SCG, 1986)

Space-economical plane-sweep algorithms. - Thomas Ottmann; Derick Wood (Comput. Vis. Graph. Image Process., 1986)

Theory of computation. - Derick Wood (Wiley, 1987)

Variations on Visibility. - J. Ian Munro; Mark H. Overmars; Derick Wood (SCG, 1987)

Concurrency Control in Database Structures with Relaxed Balance. - Otto Nurmi; Eljas Soisalon-Soininen; Derick Wood (PODS, 1987)

Time- and Space-Optimal Contour Computation for a Set of Rectangles. - Peter Widmayer; Derick Wood (Inf. Process. Lett., 1987)

Partitioning and separating sets of orthogonal polygons. - Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (Inf. Sci., 1987)

Optimal Computation of Finitely Oriented Convex Hulls - Gregory J. E. Rawlins; Derick Wood (Inf. Comput., 1987)

The Node Visit Cost of Brother Trees - Rolf Klein; Derick Wood (Inf. Comput., 1987)

On the Maximum Path Length of AVL Trees. - Rolf Klein; Derick Wood (CAAP, 1988)

The Riches of Rectangles. - Derick Wood (IMYCS, 1988)

The increasing role of computer theory in undergraduate curricula. - Donald J. Bagert; Daniel I. A. Cohen; Gary Ford 001; Donald K. Friesen; Daniel D. McCracken; Derick Wood (SIGCSE, 1988)

Voronoi Diagrams Based on General Metrics in the Plane. - Rolf Klein; Derick Wood (STACS, 1988)

Implicit Selection. - Tony W. Lai; Derick Wood (SWAT, 1988)

Extremal Cost Tree Data Structures. - Derick Wood (SWAT, 1988)

The Orthogonal Convex Skull Problem. - Derick Wood; Chee-Keng Yap (Discret. Comput. Geom., 1988)

Drawing Trees Nicely with TeX. - Anne Brüggemann-Klein; Derick Wood (Electron. Publ., 1988)

On Rectangular Visibility. - Mark H. Overmars; Derick Wood (J. Algorithms, 1988)

Hole Problems for Rectangles in the Plane. - Gregory J. E. Rawlins; Peter Widmayer; Derick Wood (SIAM J. Discret. Math., 1988)

On Binary Trees. - Rolf Klein; Derick Wood (IFIP Congress, 1989)

A Dynamic Fixed Windowing Problem. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (Algorithmica, 1989)

SEPARATION in d dimensions or strip mining in asteroid fields. - Michel P. Devine; Derick Wood (Comput. Graph., 1989)

On the path length of binary trees. - Rolf Klein; Derick Wood (J. ACM, 1989)

A New Measure of Presortedness - Vladimir Estivill-Castro; Derick Wood (Inf. Comput., 1989)

Updating Almost Complete Trees or One Level Makes All the Difference. - Tony W. Lai; Derick Wood (STACS, 1990)

How to Update a Balanced Binary Tree with a Constant Number of Rotations. - Thomas Ottmann; Derick Wood (SWAT, 1990)

A Tight Upper Bound for the Path Length of AVL Trees. - Rolf Klein; Derick Wood (Theor. Comput. Sci., 1990)

Sorting, Measures of Disorder, and Worst-Case Performance. - Vladimir Estivill-Castro; Derick Wood (New Results and New Trends in Computer Science, 1991)

A Generalization of Staircase Visibility. - Sven Schuierer; Gregory J. E. Rawlins; Derick Wood (Workshop on Computational Geometry, 1991)

How Costly Can Red-Black Trees Be? - Helen Cameron; Derick Wood (ICCI, 1991)

Balance in AVL Trees. - Helen Cameron; Derick Wood (ICCI, 1991)

Practical Adaptive Sorting. - Vladimir Estivill-Castro; Derick Wood (ICCI, 1991)

A Relationship Between Self-Organizing Lists and Binary Search Trees. - Tony W. Lai; Derick Wood (ICCI, 1991)

Defining families of trees with E0L grammars. - Thomas Ottmann; Derick Wood (Discret. Appl. Math., 1991)

Restricted-oriented convex sets. - Gregory J. E. Rawlins; Derick Wood (Inf. Sci., 1991)

Bounded Delay L Codes. - Hermann A. Maurer; Arto Salomaa; Derick Wood (Theor. Comput. Sci., 1991)

Deterministic Regular Languages. - Anne Brüggemann-Klein; Derick Wood (STACS, 1992)

A Generic Adaptive Sorting Algorithm. - Vladimir Estivill-Castro; Derick Wood (Comput. J., 1992)

A Survey of Adaptive Sorting Algorithms. - Vladimir Estivill-Castro; Derick Wood (ACM Comput. Surv., 1992)

Updating Binary Trees with Constant Linkage Cost. - Thomas Ottmann; Derick Wood (Int. J. Found. Comput. Sci., 1992)

A Note on the Path Length of Red-Black Trees. - Helen Cameron; Derick Wood (Inf. Process. Lett., 1992)

Data structures, algorithms, and performance. - Derick Wood (Addison-Wesley, 1993)

Generalized Kernels of Polygons with Holes. - Sven Schuierer; Derick Wood (CCCG, 1993)

Dent and Staircase Visibility. - Derick Wood; Peter Yamamoto (CCCG, 1993)

Structural Equivalences and ET0L Grammars (Extended Abstract). - Kai Salomaa; Derick Wood; Sheng Yu 001 (FCT, 1993)

On Efficient Entreeings. - Paul S. Amerins; Ricardo A. Baeza-Yates; Derick Wood (Acta Informatica, 1993)

Approximate String Matching with Suffix Automata. - Esko Ukkonen; Derick Wood (Algorithmica, 1993)

Interval Heaps. - Jan van Leeuwen; Derick Wood (Comput. J., 1993)

Right Invariant Metrics and Measures of Presortedness. - Vladimir Estivill-Castro; Heikki Mannila; Derick Wood (Discret. Appl. Math., 1993)

A Top-Down Updating Algorithm for Weight-Balanced Trees. - Tony W. Lai; Derick Wood (Int. J. Found. Comput. Sci., 1993)

Pm Numbers, Ambiguity, and Regularity. - Helen Cameron; Derick Wood (RAIRO Theor. Informatics Appl., 1993)

Randomized Adative Sorting. - Vladimir Estivill-Castro; Derick Wood (Random Struct. Algorithms, 1993)

Rediscovering Pushdown Machines. - Kai Salomaa; Derick Wood; Sheng Yu 001 (Results and Trends in Theoretical Computer Science, 1994)

Foundations for Faster External Sorting (Extended Abstract). - Vladimir Estivill-Castro; Derick Wood (FSTTCS, 1994)

Maximal Path Length of Binary Trees. - Helen Cameron; Derick Wood (Discret. Appl. Math., 1994)

Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. - Helen Cameron; Derick Wood (Inf. Sci., 1994)

Updating Approximately Complete Trees. - Tony W. Lai; Derick Wood (RAIRO Theor. Informatics Appl., 1994)

Pumping and Pushdown Machines. - Kai Salomaa; Derick Wood; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 1994)

Grail: A C++ Library for Automata and Expressions. - Darrell R. Raymond; Derick Wood (J. Symb. Comput., 1994)

Balance in AVL Trees and Space Cost of Brother Trees. - Helen Cameron; Derick Wood (Theor. Comput. Sci., 1994)

Standard Generalized Markup Language: Mathematical and Philosophical Issues. - Derick Wood (Computer Science Today, 1995)

Document Processing, Theory, and Practice (Abstract). - Derick Wood (COCOON, 1995)

Staircase Visibility and Computation of Kernels. - Sven Schuierer; Derick Wood (Algorithmica, 1995)

Preset two-head automata and morphological analysis of natural language. - Chet Creider; Jorge Hankamer; Derick Wood (Int. J. Comput. Math., 1995)

Binary Trees, Fringe Thickness and Minimum Path Length. - Helen Cameron; Derick Wood (RAIRO Theor. Informatics Appl., 1995)

Complexity of E0L Structural Equivalence. - Kai Salomaa; Derick Wood; Sheng Yu 001 (RAIRO Theor. Informatics Appl., 1995)

Generalizing Halfspaces. - Eugene Fink; Derick Wood (CCCG, 1996)

Three-dimensional Restricted-Orient at Ion Convexity. - Eugene Fink; Derick Wood (CCCG, 1996)

O-Convexity Computing Hulls Approximations and Orientation Sets. - V. Martynchik; Nikolai N. Metelski; Derick Wood (CCCG, 1996)

SGML and Exceptions. - Pekka Kilpeläinen; Derick Wood (PODP, 1996)

Tabular Formatting Problems. - Xinxin Wang; Derick Wood (PODP, 1996)

Instruction Computation in Subset Construction. - J. Howard Johnson; Derick Wood (Workshop on Implementing Automata, 1996)

From data representation to data model: Meta-semantic issues in the evolution of SGML. - Darrell R. Raymond; Frank Wm. Tompa; Derick Wood (Comput. Stand. Interfaces, 1996)

An adaptive generic sorting algorithm that uses variable partitioning. - Vladimir Estivill-Castro; Derick Wood (Int. J. Comput. Math., 1996)

Relaxed avl trees, main-memory databases and concurrency. - Otto Nurmi; Eljas Soisalon-Soininen; Derick Wood (Int. J. Comput. Math., 1996)

Fundamentals of Restricted-Orientation Convexity. - Eugene Fink; Derick Wood (Inf. Sci., 1996)

Structural Equivalence and ET0L Grammars. - Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 1996)

WIA and Theory and Practice. - Derick Wood (Workshop on Implementing Automata, 1997)

Context and Caterpillars and Structured Documents. - Anne Brüggemann-Klein; Stefan Hermann; Derick Wood (PODDP, 1998)

A Conceptual Model for Tables. - Xinxin Wang; Derick Wood (PODDP, 1998)

Extended Context-Free Grammars and Normal Form Algorithms. - Jürgen Albert; Dora Giammarresi; Derick Wood (Workshop on Implementing Automata, 1998)

One-Unambiguous Regular Languages. - Anne Brüggemann-Klein; Derick Wood (Inf. Comput., 1998)

Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. - Tony W. Lai; Derick Wood (SIAM J. Comput., 1998)

The Visual Specification of Context. - Anne Brüggemann-Klein; Stefan Hermann; Derick Wood (ADL, 1999)

Thompson Languages. - Dora Giammarresi; Jean-Luc Ponty; Derick Wood (Jewels are Forever, 1999)

Caterpillars, context, tree automata and tree pattern matching. - Anne Brüggemann-Klein; Derick Wood (Developments in Language Theory, 1999)

Visually Specifying Context. - Stefan Hermann; Anne Brüggemann-Klein; Derick Wood (ELPUB, 1999)

Thompson Digraphs: A Characterization. - Dora Giammarresi; Jean-Luc Ponty; Derick Wood (WIA, 1999)

A Conceptual Model for XML. - Anne Brüggemann-Klein; Derick Wood (DDEP/PODDP, 2000)

Regularly Extended Two-Way Nondeterministic Tree Automata. - Anne Brüggemann-Klein; Derick Wood (CIAA, 2000)

Caterpillars: A Context Specification Technique. - Anne Brüggemann-Klein; Derick Wood (Markup Lang., 2000)

Block-Deterministic Regular Languages. - Dora Giammarresi; Rosa Montalbano; Derick Wood (ICTCS, 2001)

SGML and XML Document Grammars and Exceptions. - Pekka Kilpeläinen; Derick Wood (Inf. Comput., 2001)

Normal form algorithms for extended context-free grammars. - Jürgen Albert; Dora Giammarresi; Derick Wood (Theor. Comput. Sci., 2001)

On Predictive Parsing and Extended Context-Free Grammars. - Anne Brüggemann-Klein; Derick Wood (CIAA, 2002)

The Regularity of Two-Way Nondeterministic Tree Automata Languages. - Anne Brüggemann-Klein; Derick Wood (Int. J. Found. Comput. Sci., 2002)

On the Optimality of Holistic Algorithms for Twig Queries. - Byron Choi; Malika Mahoui; Derick Wood (DEXA, 2003)

Planar Strong Visibility. - Eugene Fink; Derick Wood (Int. J. Comput. Geom. Appl., 2003)

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. - Kai Salomaa; Derick Wood (Theory Is Forever, 2004)

Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata. - Anne Brüggemann-Klein; Derick Wood (Extreme Markup Languages®, 2004)

A characterization of Thompson digraphs. - Dora Giammarresi; Jean-Luc Ponty; Derick Wood; Djelloul Ziadi (Discret. Appl. Math., 2004)

On the state complexity of reversals of regular languages. - Arto Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2004)

Introduction. - Bruce W. Watson; Derick Wood (Theor. Comput. Sci., 2004)

Restricted-Orientation Convexity - Eugene Fink; Derick Wood (Springer, 2004)

Prefix-Free Regular-Expression Matching. - Yo-Sub Han; Yajun Wang; Derick Wood (CPM, 2005)

A New Linearizing Restriction in the Pattern Matching Problem. - Yo-Sub Han; Derick Wood (FCT, 2005)

Shorter Regular Expressions from Finite-State Automata. - Yo-Sub Han; Derick Wood (CIAA, 2005)

The generalization of generalized automata: expression automata. - Yo-Sub Han; Derick Wood (Int. J. Found. Comput. Sci., 2005)

Overlap-Free Regular Languages. - Yo-Sub Han; Derick Wood (COCOON, 2006)

State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (DCFS, 2006)

Prime Decompositions of Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Developments in Language Theory, 2006)

Infix-free Regular Expressions and Languages. - Yo-Sub Han; Yajun Wang; Derick Wood (Int. J. Found. Comput. Sci., 2006)

Generalizations of One-Deterministic Regular Languages. - Yo-Sub Han; Derick Wood (LATA, 2007)

Intercode Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2007)

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. - Yo-Sub Han; Derick Wood (Fundam. Informaticae, 2007)

Simple-Regular Expressions and Languages. - Yo-Sub Han; Gerhard Trippen; Derick Wood (J. Autom. Lang. Comb., 2007)

On the existence of prime decompositions. - Yo-Sub Han; Arto Salomaa; Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2007)

Obtaining shorter regular expressions from finite-state automata. - Yo-Sub Han; Derick Wood (Theor. Comput. Sci., 2007)

Prefix-free regular languages and pattern matching. - Yo-Sub Han; Yajun Wang; Derick Wood (Theor. Comput. Sci., 2007)

Generalizations of 1-deterministic regular languages. - Yo-Sub Han; Derick Wood (Inf. Comput., 2008)

Operational State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Automata, Formal Languages, and Related Topics, 2009)

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2009)