Derick Wood

发表

Optimum multiway search trees

Vijay K. Vaishnavi, Derick Wood, H. Kriegel, 1980, Acta Informatica.

Uniform Interpretations of L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, Inf. Control..

Gluskov and Thompson constructions : a synthesis

Derick Wood, Dora Giammarresi, Jean-Luc Ponty, 1998 .

Generalizing Halfspaces

Derick Wood, Eugene Fink, 1996, CCCG.

Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization

Vijay K. Vaishnavi, Derick Wood, D. Wood, 1982, J. Algorithms.

Document engineering with extensible abstract document structures

Derick Wood, Anne Brüggemann-Klein, 2000 .

Node-Visit Optimal 1-2 Brother Trees

Arnold L. Rosenberg, Derick Wood, Thomas Ottmann, 1979, Theoretical Computer Science.

Preset two-head automata and morphological analysis of natural language

Derick Wood, Chet A. Creider, Jorge Hankamer, 1995, Int. J. Comput. Math..

Regular Tree Languages Over Non-Ranked Alphabets

Derick Wood, Anne Brüggemann-Klein, 1998 .

Relaxed avl trees, main-memory databases and concurrency

Derick Wood, Eljas Soisalon-Soininen, Otto Nurmi, 1996, Int. J. Comput. Math..

Balance in AVL Trees

Derick Wood, Helen Cameron, D. Wood, 1991, ICCI.

An Inverse Homomorphic Characterization of Full Principal AFL

Derick Wood, Takashi Yokomori, 1984, Inf. Sci..

A New Measure of Presortedness

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1989, Inf. Comput..

Concurrency control in database structures with relaxed balance

Derick Wood, Eljas Soisalon-Soininen, Otto Nurmi, 1987, PODS '87.

The parsing of extended context-free grammars

Derick Wood, Anne Brüggemann-Klein, 2002 .

Bounded Parallelism and Regular Languages

Derick Wood, 1974, L Systems.

A Tight Upper Bound for the Path Length of AVL Trees

Derick Wood, Rolf Klein, 1990, Theor. Comput. Sci..

Data structures, algorithms, and performance

Derick Wood, D. Wood, 1992 .

Concurrent Operations in Large Ordered Indexes

Derick Wood, Yat-Sang Kwong, 1980, Symposium on Programming.

A Generalised Normal Form Theorem for Context-Free Grammars

Derick Wood, D. Wood, 1970, Computer/law journal.

Uniform Interpretations of Grammar Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, SIAM J. Comput..

Randomized sorting of shuffled monotone sequences

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1992 .

Defining families of trees with E0L grammars

Derick Wood, Thomas Ottmann, 1991, Discret. Appl. Math..

Regular tree and regular hedge languages over unranked alphabets

Derick Wood, Anne Brüggemann-Klein, Makoto Murata, 2001 .

Decidability and density in two-symbol grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Discret. Appl. Math..

Precedence relations in grammar forms

Derick Wood, Seymour Ginsburg, 2004, Acta Informatica.

Interval Heaps

Jan van Leeuwen, Derick Wood, D. Wood, 1993, Comput. J..

On Good E0L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, SIAM J. Comput..

One-sided k-height-balanced trees

Derick Wood, Thomas Ottmann, Hans-Werner Six, 2005, Computing.

Implicit Selection

Derick Wood, Tony W. Lai, D. Wood, 1988, SWAT.

Complexity of E0L Structural Equivalence

Derick Wood, Sheng Yu, Kai Salomaa, 1994, RAIRO Theor. Informatics Appl..

Iterated a-NGSM Maps and \Gamma Systems

Derick Wood, 1976, Inf. Control..

A note on Lindenmayer systems, Szilard languages, spectra, and equivalence

Derick Wood, 2004, International Journal of Computer & Information Sciences.

On Rectangular Visibility

Derick Wood, Mark H. Overmars, 1988, J. Algorithms.

Synchronized EOL Forms Under Uniform Interpretation

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, RAIRO Theor. Informatics Appl..

Purely top-down updating algorithms for stratified search trees

Derick Wood, Thomas Ottmann, Michael Schrapp, 2004, Acta Informatica.

Intercode Regular Languages

Derick Wood, Yo-Sub Han, Kai Salomaa, 2007, Fundam. Informaticae.

The theory of left factored languages: Part 1

Derick Wood, 1969, Comput. J..

A few more trouble spots in ALGOL 60

Derick Wood, 1969, CACM.

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

Derick Wood, Yo-Sub Han, 2007, Fundam. Informaticae.

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Derick Wood, Yo-Sub Han, Kai Salomaa, 2009, Fundam. Informaticae.

Systolic Tree Acceptors

Derick Wood, Arto Salomaa, Karel Culik, 1984, RAIRO Theor. Informatics Appl..

On Structural Similarity of Context-Free Grammars

Derick Wood, Eljas Soisalon-Soininen, 1981, MFCS.

Staircase visibility and computation of kernels

Derick Wood, Sven Schuierer, 2005, Algorithmica.

Minimal-Cost Brother Trees

Arnold L. Rosenberg, Derick Wood, Thomas Ottmann, 1984, SIAM J. Comput..

Principles of document processing : Third International Workshop, PODP '96, Palo Alto, California, USA, September 23, 1996 : proceedings

Derick Wood, Charles Nicholas, Podp, 1997 .

An adaptive generic sorting algorithm that uses variable partitioning

Derick Wood, Vladimir Estivill-Castro, 1996, Int. J. Comput. Math..

Operational State Complexity of Prefix-Free Regular Languages

Derick Wood, Yo-Sub Han, Kai Salomaa, 2009, Automata, Formal Languages, and Related Topics.

The validation of SGML content models

Derick Wood, Anne Brüggemann-Klein, 1997 .

On generators and generative capacity of EOL forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2004, Acta Informatica.

EOL forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2004, Acta Informatica.

A Realistic Cost Measure for Binary Search Trees

Arnold L. Rosenberg, Derick Wood, Thomas Ottmann, 1981, International Workshop on Graph-Theoretic Concepts in Computer Science.

Synchronized E0L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Theor. Comput. Sci..

Grail: A C++ Library for Automata and Expressions

Derick Wood, Darrell R. Raymond, 1994, J. Symb. Comput..

Revised Papers from the Second International Workshop on Implementing Automata

Derick Wood, Sheng Yu, Darrell R. Raymond, 1996 .

On the state complexity of reversals of regular languages

Derick Wood, Arto Salomaa, Sheng Yu, 2004, Theor. Comput. Sci..

Foundations for Faster External Sorting (Extended Abstract)

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1994, FSTTCS.

Instruction Computation in Subset Construction

Derick Wood, J. Howard Johnson, D. Wood, 1996, Workshop on Implementing Automata.

On non context-free grammar forms

Derick Wood, Martti Penttonen, Hermann A. Maurer, 2005, Mathematical systems theory.

A Supernormal-Form Theorem for Context-Free Grammars

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983, JACM.

The normal form theorem - another proof

Derick Wood, 1969, Comput. J..

Dense multiway trees

Derick Wood, Karel Culik, Thomas Ottmann, 1981, TODS.

Practical Adaptive Sorting

Derick Wood, Vladimir Estivill-Castro, 1991, ICCI.

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

Derick Wood, Jon Louis Bentley, J. Bentley, 1980, IEEE Transactions on Computers.

Xtable : a tabular editor and formatter

Derick Wood, Xinxin Wang, D. Wood, 1996 .

On the path length of binary trees

Derick Wood, Rolf Klein, 1989, JACM.

Adaptive heuristics for binary search trees and constant linkage cost

Derick Wood, Tony W. Lai, 1991, SODA '91.

The Complexity and Decidability of Separation

Bernard Chazelle, Derick Wood, Eljas Soisalon-Soininen, 1984, ICALP.

A New Linearizing Restriction in the Pattern Matching Problem

Derick Wood, Yo-Sub Han, 2005, FCT.

On Binary Trees

Derick Wood, Rolf Klein, 1989, IFIP Congress.

A Characterization Theorem for n-Parallel Right Linear Languages

Derick Wood, Robert D. Rosebrugh, 1973, J. Comput. Syst. Sci..

Skip sort —an adaptive randomized algorithm: or, expected time adaptivity is best

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1992 .

Two Variations on n-Parallel Finite State Generators

Derick Wood, 1977, Comput. J..

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof

Derick Wood, Kai Salomaa, D. Wood, 2004, Theory Is Forever.

Generative Models for Parallel Processes

Derick Wood, Grzegorz Rozenberg, 1974, Comput. J..

Prime Decompositions of Regular Languages

Derick Wood, Yo-Sub Han, Kai Salomaa, 2006, Developments in Language Theory.

The generalization of generalized automata: expression automata

Derick Wood, Yo-Sub Han, 2005, Int. J. Found. Comput. Sci..

Fundamentals of Restricted-Orientation Convexity

Derick Wood, Eugene Fink, Eugene Fink, 1996, Inf. Sci..

Pm Numbers, Ambiguity, and Regularity

Derick Wood, Helen Cameron, D. Wood, 1993, RAIRO Theor. Informatics Appl..

A Top-Down Updating Algorithm for Weight-Balanced Trees

Derick Wood, Tony W. Lai, 1993, Int. J. Found. Comput. Sci..

On the Definition and Computation of Rectlinear Convex Hulls

Derick Wood, Eljas Soisalon-Soininen, Thomas Ottmann, 1984, Inf. Sci..

One-Unambiguous Regular Languages

Derick Wood, Anne Brüggemann-Klein, D. Wood, 1998, Inf. Comput..

Grail : engineering automata in C++, version 2.5

Derick Wood, Darrell R. Raymond, D. Wood, 1996 .

Generalizations of 1-deterministic regular languages

Derick Wood, Yo-Sub Han, 2007, Inf. Comput..

On B-trees: routing schemes and concurrency

Derick Wood, Yat-Sang Kwong, 1980, SIGMOD '80.

Principles of Digital Document Processing

Derick Wood, Ethan V. Munson, Charles Nicholas, 2000, Lecture Notes in Computer Science.

Revised Papers from the 6th International Conference on Implementation and Application of Automata

Derick Wood, Bruce W. Watson, B. Watson, 2001 .

Finitary and infinitary interpretations of languages

Derick Wood, Hermann A. Maurer, Arto Salomaa, 2005, Mathematical systems theory.

Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2004, Extreme Markup Languages®.

Cut point languages of markov DTOL systems

Derick Wood, Helmut Jürgensen, David E. Matthews, 2004, International Journal of Computer & Information Sciences.

The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees

Kurt Mehlhorn, Gaston H. Gonnet, Derick Wood, 1982, Inf. Control..

On the existence of prime decompositions

Derick Wood, Arto Salomaa, Sheng Yu, 2007, Theor. Comput. Sci..

Context-free grammars with selective rewriting

Derick Wood, Grzegorz Rozenberg, 2004, Acta Informatica.

Right Invariant Metrics and Measures of Presortedness

Derick Wood, Heikki Mannila, Vladimir Estivill-Castro, 1993, Discret. Appl. Math..

On the correspondence between AVL trees and brother trees

Derick Wood, Thomas Ottmann, Hans-Werner Six, 2005, Computing.

Self-regulating L Systems

Derick Wood, Helmut Jürgensen, 1982, J. Inf. Process. Cybern..

Completeness of Context-Free Grammar Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, J. Comput. Syst. Sci..

Dent and Staircase Visibility

Derick Wood, Peter Yamamoto, 1993, CCCG.

Thompson Digraphs: A Characterization

Derick Wood, Dora Giammarresi, Jean-Luc Ponty, 1999, WIA.

The generalization of generalized automata: expression automata

Derick Wood, Yo-Sub Han, D. Wood, 2004, Int. J. Found. Comput. Sci..

Variations on visibility

Derick Wood, Mark H. Overmars, J. Ian Munro, 1987, SCG '87.

Caterpillars: A Context Specification Technique

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2000, Markup languages.

Generalized Kernels of Polygons with Holes

Derick Wood, Sven Schuierer, S. Schuierer, 1993, Canadian Conference on Computational Geometry.

Restricted-Orientation Convexity

Derick Wood, Eugene Fink, Eugene Fink, 2004, Monographs in Theoretical Computer Science. An EATCS Series.

From data representation to data model: Meta-semantic issues in the evolution of SGML

Derick Wood, Frank Wm. Tompa, Darrell R. Raymond, 1996, Comput. Stand. Interfaces.

State Complexity of Prefix-Free Regular Languages

Derick Wood, Yo-Sub Han, Kai Salomaa, 2006, DCFS.

On predictive parsing and extended context-free grammars

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2002, CIAA'02.

Finding Rectangle Intersections by Divide-and-Conquer

Derick Wood, Ralf Hartmut Güting, 1984, IEEE Transactions on Computers.

Relative Goodness for EOL Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, RAIRO Theor. Informatics Appl..

Three-dimensional strong convexity and visibility

Derick Wood, Eugene Fink, 1995, Optics & Photonics.

The Riches of Rectangles

Derick Wood, D. Wood, 1988, IMYCS.

Simple-Regular Expressions and Languages

Derick Wood, Yo-Sub Han, Gerhard Trippen, 2005, DCFS.

Principles of Document Processing

Derick Wood, Charles Nicholas, 1996, Lecture Notes in Computer Science.

A Uniform Approach to Balanced Binary and Multiway Trees

Derick Wood, Thomas Ottmann, T. Ottmann, 1979, International Symposium on Mathematical Foundations of Computer Science.

Block-Deterministic Regular Languages

Derick Wood, Dora Giammarresi, Rosa Montalbano, 2001, ICTCS.

Approaches to Concurrency in B-Trees

Derick Wood, Yat-Sang Kwong, D. Wood, 1980, MFCS.

Sub-Regular Grammar Forms

Derick Wood, Arto Salomaa, Thomas Ottmann, 1981, Inf. Process. Lett..

Voronoi Diagrams Based on General Metrics in the Plane

Derick Wood, Rolf Klein, R. Klein, 1988, STACS.

Visually Specifying Context

Derick Wood, Anne Brüggemann-Klein, Stefan Hermann, 1999, ELPUB.

Height-Ratio-Balanced Trees

Gaston H. Gonnet, Derick Wood, Henk J. Olivié, 1983, Comput. J..

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space

Jan van Leeuwen, Derick Wood, Herbert Edelsbrunner, 1984, RAIRO Theor. Informatics Appl..

Complexity of E0L Structural Equivalence

Derick Wood, Sheng Yu, Kai Salomaa, 1995, RAIRO Theor. Informatics Appl..

A Conceptual Model for Tables

Derick Wood, Xinxin Wang, 1998, PODDP.

Pure Grammars

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Inf. Control..

A Survey of Grammar and L Forms-1978

Derick Wood, 1979, MFCS.

Maximal Path Length of Binary Trees

Derick Wood, Helen Cameron, 1994, Discret. Appl. Math..

Proceedings of the 4th International Workshop on Principles of Digital Document Processing

Derick Wood, Ethan V. Munson, Charles K. Nicholas, 1998 .

The Visual Specification of Context

Derick Wood, D. Hermann, S. Brueggemann-klein, 2001 .

The orthogonal convex skull problem

Derick Wood, Chee-Keng Yap, 1988, Discret. Comput. Geom..

Overlap-Free Regular Languages

Derick Wood, Yo-Sub Han, 2006, COCOON.

Colorings and interpretations: a connection between graphs and grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Discret. Appl. Math..

Updating Approximately Complete Trees

Derick Wood, Tony W. Lai, 1994, RAIRO Theor. Informatics Appl..

Pumping and Pushdown Machines

Derick Wood, Sheng Yu, Kai Salomaa, 1994, RAIRO Theor. Informatics Appl..

Rediscovering Pushdown Machines

Derick Wood, Sheng Yu, Kai Salomaa, 1994, Results and Trends in Theoretical Computer Science.

A Half-Century of Automata Theory: Celebration and Inspiration

Derick Wood, Arto Salomaa, Sheng Yu, 2001, A Half-Century of Automata Theory.

Stabbing line segments

Arnold L. Rosenberg, Derick Wood, Herbert Edelsbrunner, 1982, BIT.

A characterization of Thompson digraphs

Derick Wood, Djelloul Ziadi, Dora Giammarresi, 2004, Discret. Appl. Math..

ETOL Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1978, J. Comput. Syst. Sci..

Computing a convex skill of an orthogonal polygon

Derick Wood, Chee-Keng Yap, 1985, SCG '85.

A Mathematical Investigation of Propagating Graph 0L Systems

Derick Wood, Karel Culik, D. Wood, 1979, Inf. Control..

An Abstract Model for Tables

Derick Wood, Xlnxin Wang, 1993 .

Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages

Derick Wood, Jürgen Albert, 1983, J. Comput. Syst. Sci..

Caterpillars, context, tree automata and tree pattern matching

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2000, Developments in Language Theory.

How to Update a Balanced Binary Tree with a Constant Number of Rotations

Derick Wood, Thomas Ottmann, T. Ottmann, 1990, SWAT.

Normal form algorithms for extended context-free grammars

Derick Wood, Dora Giammarresi, Jürgen Albert, 2001, Theor. Comput. Sci..

Document Processing, Theory, and Practice (Abstract)

Derick Wood, 1995, COCOON.

Simplifications of E0L Grammars

Derick Wood, Thomas Ottmann, 1992 .

Implementation and Application of Automata: 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers

Derick Wood, Bruce W. Watson, 2003 .

Weight-balanced trees are not stratified

Derick Wood, Thomas Ottmann, Michael Schrapp, 1985, Bull. EATCS.

Prefix-free regular languages and pattern matching

Derick Wood, Yajun Wang, Yo-Sub Han, 2007, Theor. Comput. Sci..

The Analysis of Search Trees: A Survey

Derick Wood, Thomas Ottmann, Hans-Werner Six, 1980, WG.

The Node Visit Cost of Brother Trees

Derick Wood, Rolf Klein, 1986, WG.

Roughly sorting: a generalization of sorting

Derick Wood, Yoshihide Igarashi, 1991 .

A Note on K-Iteration Grammars

Derick Wood, Grzegorz Rozenberg, G. Rozenberg, 1976, Inf. Process. Lett..

Shorter Regular Expressions from Finite-State Automata

Derick Wood, Yo-Sub Han, 2005, CIAA.

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families

Jan van Leeuwen, Derick Wood, 1976, Theor. Comput. Sci..

An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems

Derick Wood, Eljas Soisalon-Soininen, D. Wood, 1982, PODS.

The Regularity of Two-Way Nondeterministic Tree Automata Languages

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2002, Int. J. Found. Comput. Sci..

Structural Equivalences and ET0L Grammars (Extended Abstract)

Derick Wood, Sheng Yu, Kai Salomaa, 1993, FCT.

Prefix-Free Regular-Expression Matching

Derick Wood, Yajun Wang, Yo-Sub Han, 2005, CPM.

Thompson Languages

Derick Wood, Dora Giammarresi, Jean-Luc Ponty, 1999, Jewels are Forever.

Tabular Formatting Problems

Derick Wood, Xinxin Wang, 1996, PODP.

Generalized time-delayed OL languages

Derick Wood, 1977, Inf. Sci..

Proceedings of the Third International Workshop on Principles of Document Processing

Derick Wood, Charles Nicholas, 1996 .

Context-Dependent L Forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1979, Inf. Control..

Context-Free Grammar Forms with Strict Interpretations

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, J. Comput. Syst. Sci..

Document Design with HiTeX: A Step beyond LaTeX

Derick Wood, Anne Brueggemann-Klein, 1987 .

Partitioning and separating sets of orthogonal polygons

Derick Wood, Eljas Soisalon-Soininen, Thomas Ottmann, 1987, Inf. Sci..

Inverse Morphic Equivalence on Languages

Derick Wood, Juhani Karhumäki, 1984, Inf. Process. Lett..

The Theory of Left Factored Languages: Part 2

Derick Wood, D. Wood, 1970, Computer/law journal.

Automata implementation : First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996 : revised papers

Derick Wood, Sheng Yu, Darrell R. Raymond, 1997 .

Structural Equivalence and ET0L Grammars

Derick Wood, Kai Salomaa, Sheng Yu, 1996, Theor. Comput. Sci..

Counting and Reporting Intersections of d-Ranges

Derick Wood, Hans-Werner Six, D. Wood, 1982, IEEE Transactions on Computers.

Tabular abstraction for tabular editing and formatting

Derick Wood, Xinxin Wang, D. Wood, 1993 .

SGML and XML Document Grammars and Exceptions

Derick Wood, Pekka Kilpeläinen, D. Wood, 2001, Inf. Comput..

An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692.

Derick Wood, D. Wood, 1985 .

SEPARATION in d dimensions or strip mining in asteroid fields

Derick Wood, Michel P. Devine, 1989, Comput. Graph..

SGML and Exceptions

Derick Wood, Pekka Kilpeläinen, 1996, PODP.

On Predecessors of Finite Languages

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1981, Inf. Control..

An adaptive generic sorting algorithm that uses variable partitioning

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

Standard Generalized Markup Language: Mathematical and Philosophical Issues

Derick Wood, D. Wood, 1995, Computer Science Today.

Binary search trees with binary comparison cost

Arnold L. Rosenberg, Derick Wood, Thomas Ottmann, 1984, International Journal of Computer & Information Sciences.

1-2 Brother Trees or AVL Trees Revisited

Derick Wood, Thomas Ottmann, T. Ottmann, 1980, Comput. J..

The Grail papers: version 2.3

Derick Wood, Darrell R. Raymond, D. Wood, 1995 .

Adaptive parallel sorting

Derick Wood, Vladimir Estivill Castro, 1992 .

Time- and Space-Optimal Contour Computation for a Set of Rectangles

Derick Wood, Peter Widmayer, P. Widmayer, 1987, Inf. Process. Lett..

On the Maximum Path Length of AVL Trees

Derick Wood, Rolf Klein, 1988, CAAP.

Obtaining shorter regular expressions from finite-state automata

Derick Wood, Yo-Sub Han, 2007, Theor. Comput. Sci..

Implementation and Application of Automata

Derick Wood, Bruce W. Watson, B. Watson, 2002, Lecture Notes in Computer Science.

Updating Binary Trees with Constant Linkage Cost

Derick Wood, Thomas Ottmann, T. Ottmann, 1992, Int. J. Found. Comput. Sci..

Optimal dynamic solutions for fixed windowing problems

Derick Wood, Rolf Klein, Thomas Ottmann, 1986, SCG '86.

A dynamic fixed windowing problem

Derick Wood, Rolf Klein, Thomas Ottmann, 1989, Algorithmica.

A Note on the Path Length of Red-Black Trees

Derick Wood, Helen Cameron, 1992, Inf. Process. Lett..

Locally Balanced Binary Trees

Derick Wood, A. Walker, 1976, Comput. J..

MSW Spaces

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1980, Inf. Control..

A New Method for Concurrency in B-Trees

Derick Wood, Yat-Sang Kwong, D. Wood, 1982, IEEE Transactions on Software Engineering.

Image theorems for simple matrix languages andn-parallel languages

Derick Wood, Robert D. Rosebrugh, 2005, Mathematical systems theory.

The rectangle intersection problem revisited

Derick Wood, Hans-Werner Six, D. Wood, 1980, BIT.

How Costly Can Red-Black Trees Be?

Derick Wood, Helen Cameron, D. Wood, 1991, ICCI.

Life and Death in Markov Deterministic Tabled OL Systems

Derick Wood, Helmut Jürgensen, David E. Matthews, 1981, Inf. Control..

Context and Caterpillars and Structured Documents

Derick Wood, Anne Brüggemann-Klein, Stefan Hermann, 1998, PODDP.

A survey of adaptive sorting algorithms

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1992, CSUR.

On a covering relation for context-free grammars

Derick Wood, Eljas Soisalon-Soininen, 2004, Acta Informatica.

Hole Problems for Rectangles in the Plane

Derick Wood, Peter Widmayer, Gregory J. E. Rawlins, 1988, SIAM J. Discret. Math..

A Conceptual Model for XML

Derick Wood, Anne Brüggemann-Klein, 2000, DDEP/PODDP.

Right brother trees

Derick Wood, Thomas Ottmann, Hans-Werner Six, 1978, CACM.

Bounded Delay L Codes

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1991, Theor. Comput. Sci..

The parenthesis tree

Derick Wood, Ralf Hartmut Güting, 1982, Inf. Sci..

An approach to a unified theory of grammar and L forms

Vijay K. Vaishnavi, Derick Wood, 1978, Inf. Sci..

Randomized Adative Sorting

Derick Wood, Vladimir Estivill-Castro, 1993, Random Struct. Algorithms.

A New MethodforConcurrency inB-Trees

Derick Wood, 1982 .

Search Trees and Bubble Memories

Philippe Flajolet, Derick Wood, Thomas Ottmann, 1985, RAIRO Theor. Informatics Appl..

The Drought Impact Reporter: A Web-Based National Drought Impacts Reporting Tool

Derick Wood, Michael J. Hayes, Mark Svoboda, 2005 .

On the Optimality of Holistic Algorithms for Twig Queries

Derick Wood, Byron Choi, Malika Mahoui, 2003, DEXA.

A Note on Some Tree Similarity Measures

Derick Wood, Karel Culik, D. Wood, 1982, Inf. Process. Lett..

One-Unambiguous Regular Languages

Derick Wood, Anne Brüggemann-Klein, 1998, Inf. Comput..

Principles of digital document processing : 4th International Workshop, PODDP'98, Saint Malo, France, March 29-30, 1998 : proceedings

Derick Wood, Ethan V. Munson, Charles Nicholas, 1998 .

Restricted-orientation half-spaces

Derick Wood, Eugene Fink, 1996, Optics & Photonics.

Pure interpretations for EOL forms

Derick Wood, Grzegorz Rozenberg, Hermann A. Maurer, 1979, RAIRO Theor. Informatics Appl..

Theory of computation

Derick Wood, D. Wood, 1986 .

Deterministic Regular Languages

Derick Wood, Anne Brüggemann-Klein, D. Wood, 1991, STACS.

A Relationship Between Self-Organizing Lists and Binary Search Trees

Derick Wood, Tony W. Lai, 1991, ICCI.

WIA and Theory and Practice

Derick Wood, 1997, Workshop on Implementing Automata.

On grammar forms with terminal context

Derick Wood, Hermann A. Maurer, 2004, Acta Informatica.

Optimal Computation of Finitely Oriented Convex Hulls

Derick Wood, Gregory J. E. Rawlins, 1987, Inf. Comput..

A Further Note on Top-Down Deterministic Languages

Derick Wood, 1971, Comput. J..

Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees

Derick Wood, Helen Cameron, D. Wood, 1994, Inf. Sci..

The implementation of insertion and deletion algorithms for 1–2 brother trees

Derick Wood, Thomas Ottmann, Hans-Werner Six, 1981, Computing.

Grammar and L forms: An introduction

Derick Wood, D. Wood, 1980, Lecture Notes in Computer Science.

Structural Equivalence and ETOL grammars

Derick Wood, Sheng Yu, Kai Salomaa, 1993 .

On predictive parsing and extended context-free grammars

Derick Wood, Anne Brüggemann-Klein, 2002, CIAA'02.

Paradigms and programming with PASCAL

Derick Wood, D. Wood, 1984 .

Balance in AVL Trees and Space Cost of Brother Trees

Derick Wood, Helen Cameron, D. Wood, 1994, Theor. Comput. Sci..

Drawing Trees Nicely with TeX

Derick Wood, Anne Brüggemann-Klein, D. Wood, 1989, Electron. Publ..

On efficient entreeings

Derick Wood, Ricardo A. Baeza-Yates, Paul S. Amerins, 2005, Acta Informatica.

Height balanced 2–3 trees

Hans-Peter Kriegel, Vijay K. Vaishnavi, Derick Wood, 1979, Computing.

A Note on Recurrent Words

Derick Wood, Karel Culik, 1981, Inf. Control..

The increasing role of computer theory in undergraduate curricula

Gary Ford, Derick Wood, Daniel D. McCracken, 1988, SIGCSE '88.

Extremal Cost Tree Data Structures

Derick Wood, 1988, SWAT.

The Measure Problem for Rectangular Ranges in d-Space

Jan van Leeuwen, Derick Wood, D. Wood, 1981, J. Algorithms.

The Path Length of Binary Trees

Derick Wood, Rolf Klein, 1989, FODO.

Sorting, Measures of Disorder, and Worst-Case Performance

Derick Wood, Vladimir Estivill-Castro, 1991, New Results and New Trends in Computer Science.

A fast algorithm for the Boolean masking problem

Derick Wood, Thomas Ottmann, Peter Widmayer, 1985, Comput. Vis. Graph. Image Process..

Dynamization of Decomposable Searching Problems

Jan van Leeuwen, Derick Wood, 1980, Inf. Process. Lett..

Computational problems in strong visibility

Derick Wood, Eugene Fink, 1997, Optics & Photonics.

A Generalization of Staircase Visibility

Derick Wood, Gregory J. E. Rawlins, Sven Schuierer, 1991, Workshop on Computational Geometry.

Direct dynamic structures for some line segment problems

Gaston H. Gonnet, Derick Wood, J. Ian Munro, 1983, Comput. Vis. Graph. Image Process..

Space and time optimal algorithms for a class of rectangle intersection problems

Hans-Peter Kriegel, Vijay K. Vaishnavi, Derick Wood, 1980, Inf. Sci..

Binary Trees, Fringe Thickness and Minimum Path Length

Derick Wood, Helen Cameron, 1995, RAIRO Theor. Informatics Appl..

Storage representations for tree-like data structures

Arnold L. Rosenberg, Derick Wood, Zvi Galil, 1979, Mathematical systems theory.

Implementation and Application of Automata

Oscar H. Ibarra, Hans-Jörg Kreowski, Derick Wood, 2001, Lecture Notes in Computer Science.

The Contour Problem for Rectilinear Polygons

Derick Wood, 1984, Inf. Process. Lett..

Restricted-oriented convex sets

Derick Wood, Gregory J. E. Rawlins, 1991, Inf. Sci..

A Factor Theorem for Subsets of a Free Monoid

Derick Wood, 1972, Inf. Control..

A Generic Adaptive Sorting Algorithm

Derick Wood, Vladimir Estivill-Castro, D. Wood, 1992, Comput. J..

Updating Almost Complete Trees or One Level Makes All the Difference

Derick Wood, Tony W. Lai, 1990, STACS.

Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles

Derick Wood, Eljas Soisalon-Soininen, 1984, J. Algorithms.

O-Convexity Computing Hulls Approximations and Orientation Sets

Derick Wood, V. Martynchik, Nikolai N. Metelski, 1996, CCCG.

Time-delayed OL languages and sequences

Derick Wood, 1975, Inf. Sci..

A Three-Restricted Normal Form Theorem for ET0L Languages

Derick Wood, Takashi Yokomori, Klaus-Jörn Lange, 1982, Inf. Process. Lett..

Context-free grammar forms

Derick Wood, 1980 .

Space-economical plane-sweep algorithms

Derick Wood, Thomas Ottmann, 1986, Comput. Vis. Graph. Image Process..

Approximate string matching with suffix automata

Derick Wood, Esko Ukkonen, 2005, Algorithmica.

Planar Strong Visibility

Derick Wood, Eugene Fink, Eugene Fink, 2003, Int. J. Comput. Geom. Appl..

Bicolored digraph grammar systems

Derick Wood, D. Wood, 1973 .

Three-dimensional Restricted-Orient at Ion Convexity

Derick Wood, Eugene Fink, 1996, CCCG.

Regularly Extended Two-Way Nondeterministic Tree Automata

Derick Wood, Anne Brüggemann-Klein, D. Wood, 2000, CIAA.

Extended Context-Free Grammars and Normal Form Algorithms

Derick Wood, Dora Giammarresi, Jürgen Albert, 1998, Workshop on Implementing Automata.

Speed-varying OL systems

Derick Wood, Karel Culik, 1978, Inf. Sci..

The visual specification of context

Derick Wood, Anne Brüggemann-Klein, Stefan Hermann, 1999, Proceedings IEEE Forum on Research and Technology Advances in Digital Libraries.

WITHDRAWN: Planar strong visibility

Derick Wood, Eugene Fink, 2003 .

A comparison of iterative and defined classes of search trees

Derick Wood, Thomas Ottmann, 2005, International Journal of Computer & Information Sciences.

Automata Implementation: Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers

Derick Wood, Sheng Yu, 1998 .

The Node Visit Cost of Brother Trees

Derick Wood, Rolf Klein, 1987, Inf. Comput..

L Codes and Number Systems

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983, Theor. Comput. Sci..

Dense Hierarchies of Grammatical Families

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1982, JACM.

Data Structures (Dagstuhl Seminar 9145)

Derick Wood, Thomas Ottmann, Hartmut Noltemeier, 2021 .

Some remarks on the KH algorithm fors-grammars

Derick Wood, D. Wood, 1973 .

Denseness, maximality, and decidability of grammatical families

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1986 .

Strong Restricted-Orientation Convexity

Derick Wood, Eugene Fink, Eugene Fink, 1998 .

Encoding search trees in lists

Vijay K. Vaishnavi, Derick Wood, D. Wood, 1982 .

Fundamentals of Restricted-orientation Convexity Fundamentals of Restricted-orientation Convexity

Derick Wood, Eugene Fink, Eugene Fink, 1995 .

Restricted-Orientation Convexity (Monographs in Theoretical Computer Science)

Derick Wood, Eugene Fink, Eugene Fink, 2004 .

Visibility in semi-convex spaces

Derick Wood, Sven Schuierer, S. Schuierer, 1997 .

Generalized halfspaces in restricted-orientation convexity

Derick Wood, Eugene Fink, Eugene Fink, 1998 .

On finite grammar forms

Derick Wood, Hermann A. Maurer, Arto Salomaa, 1983 .

Restricted Orientation Visibility

Derick Wood, D. Wood, Sven Schuierery, 1991 .

Multiple-guard kernels of simple polygons

Derick Wood, Sven Schuierer, S. Schuierer, 1999 .

Computational geometry with restricted orientations

Derick Wood, Gregory J. E. Rawlins, 1988 .

A simple proof of the rectilinear art gallery theorem

Derick Wood, Heikki Mannila, H. Mannila, 1985 .

Ortho-Convexity and its Generalizations

Derick Wood, Gregory J. E. Rawlins, D. Wood, 1988 .

Tabular formatting

Derick Wood, Xinxin Wang, 1996 .

A note on a family of acceptors for some families of developmental languages

Derick Wood, D. Wood, Gregorz Rozenberg, 1975 .

A note on bicoloured digraph grammar systems

Derick Wood, 1972 .