| 2007 | LATA | Generalizations of One-Deterministic Regular Languages. | Yo-Sub Han, Derick Wood |
| 2006 | COCOON | Overlap-Free Regular Languages. | Yo-Sub Han, Derick Wood |
| 2006 | DLT | Prime Decompositions of Regular Languages. | Yo-Sub Han, Kai Salomaa, Derick Wood |
| 2005 | CPM | Prefix-Free Regular-Expression Matching. | Yo-Sub Han, Yajun Wang, Derick Wood |
| 2005 | FCT | A New Linearizing Restriction in the Pattern Matching Problem. | Yo-Sub Han, Derick Wood |
| 2005 | ICTAC | Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. | Yo-Sub Han, Derick Wood |
| 2003 | DEXA | On the Optimality of Holistic Algorithms for Twig Queries. | Byron Choi, Malika Mahoui, Derick Wood |
| 1999 | DLT | Caterpillars, context, tree automata and tree pattern matching. | Anne Brggemann-Klein, Derick Wood |
| 1995 | COCOON | Document Processing, Theory, and Practice (Abstract). | Derick Wood |
| 1994 | MFCS | Complexity of E0L Structural Equivalence. | Kai Salomaa, Derick Wood, Sheng Yu |
| 1993 | FCT | Structural Equivalences and ET0L Grammars (Extended Abstract). | Kai Salomaa, Derick Wood, Sheng Yu |
| 1993 | ICCI | An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. | Vladimir Estivill-Castro, Derick Wood |
| 1992 | STACS | Deterministic Regular Languages. | Anne Brggemann-Klein, Derick Wood |
| 1991 | ICCI | How Costly Can Red-Black Trees Be? | Helen Cameron, Derick Wood |
| 1991 | ICCI | Balance in AVL Trees. | Helen Cameron, Derick Wood |
| 1991 | ICCI | Practical Adaptive Sorting. | Vladimir Estivill-Castro, Derick Wood |
| 1991 | ICCI | A Relationship Between Self-Organizing Lists and Binary Search Trees. | Tony W. Lai, Derick Wood |
| 1991 | SODA | Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. | Tony W. Lai, Derick Wood |
| 1990 | STACS | Updating Almost Complete Trees or One Level Makes All the Difference. | Tony W. Lai, Derick Wood |
| 1988 | SIGCSE | The increasing role of computer theory in undergraduate curricula. | Donald J. Bagert, Daniel I. A. Cohen, Gary Ford, Donald K. Friesen, Daniel D. McCracken, Derick Wood |
| 1988 | STACS | Voronoi Diagrams Based on General Metrics in the Plane. | Rolf Klein, Derick Wood |
| 1987 | PODS | Concurrency Control in Database Structures with Relaxed Balance. | Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood |
| 1986 | WG | The Node Visit Cost of Brother Trees. | Rolf Klein, Derick Wood |
| 1984 | ICALP | The Complexity and Decidability of Separation. | Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood |
| 1982 | PODS | An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. | Eljas Soisalon-Soininen, Derick Wood |
| 1981 | MFCS | On Structural Similarity of Context-Free Grammars. | Eljas Soisalon-Soininen, Derick Wood |
| 1981 | WG | A Realistic Cost Measure for Binary Search Trees. | Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood |
| 1980 | MFCS | Approaches to Concurrency in B-Trees. | Yat-Sang Kwong, Derick Wood |
| 1980 | SIGMOD | On B-Trees: Routing Schemes and Concurrency. | Yat-Sang Kwong, Derick Wood |
| 1980 | WG | The Analysis of Search Trees: A Survey. | Thomas Ottmann, Hans-Werner Six, Derick Wood |
| 1979 | MFCS | A Uniform Approach to Balanced Binary and Multiway Trees. | Thomas Ottmann, Derick Wood |
| 1979 | MFCS | A Survey of Grammar and L Forms-1978. | Derick Wood |
| 1979 | STOC | Storage Representations for Tree-Like Data Structures | Arnold L. Rosenberg, Derick Wood, Zvi Galil |