2009
220Operational State Complexity of Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Automata, Formal Languages, and Related Topics 2009, 99-115. Web SearchBibTeX
219Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Fundam. Inform. (90): 93-106 (2009). Web SearchBibTeXDownload
2008
218Generalizations of 1-deterministic regular languages. Yo-Sub Han, Derick Wood. Inf. Comput. (206): 1117-1125 (2008). Web SearchBibTeXDownload
2007
217Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Yo-Sub Han, Derick Wood. Fundam. Inform. (81): 441-457 (2007). Web SearchBibTeXDownload
216Intercode Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Fundam. Inform. (76): 113-128 (2007). Web SearchBibTeXDownload
215Simple-Regular Expressions and Languages. Yo-Sub Han, Gerhard Trippen, Derick Wood. Journal of Automata, Languages and Combinatorics (12): 181-194 (2007). Web SearchBibTeX
214Generalizations of One-Deterministic Regular Languages. Yo-Sub Han, Derick Wood. LATA 2007, 273-284. Web SearchBibTeX
213On the existence of prime decompositions. Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu. Theor. Comput. Sci. (376): 60-69 (2007). Web SearchBibTeXDownload
212Obtaining shorter regular expressions from finite-state automata. Yo-Sub Han, Derick Wood. Theor. Comput. Sci. (370): 110-120 (2007). Web SearchBibTeXDownload
211Prefix-free regular languages and pattern matching. Yo-Sub Han, Yajun Wang, Derick Wood. Theor. Comput. Sci. (389): 307-317 (2007). Web SearchBibTeXDownload
2006
210Overlap-Free Regular Languages. Yo-Sub Han, Derick Wood. COCOON 2006, 469-478. Web SearchBibTeXDownload
209State Complexity of Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. DCFS 2006, 165-176. Web SearchBibTeX
208Prime Decompositions of Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Developments in Language Theory 2006, 145-155. Web SearchBibTeXDownload
207Infix-free Regular Expressions and Languages. Yo-Sub Han, Yajun Wang, Derick Wood. Int. J. Found. Comput. Sci. (17): 379-394 (2006). Web SearchBibTeXDownload
2005
206Shorter Regular Expressions from Finite-State Automata. Yo-Sub Han, Derick Wood. CIAA 2005, 141-152. Web SearchBibTeXDownload
205Prefix-Free Regular-Expression Matching. Yo-Sub Han, Yajun Wang, Derick Wood. CPM 2005, 298-309. Web SearchBibTeXDownload
204Simple-Regular Expressions and Languages. Yo-Sub Han, Gerhard Trippen, Derick Wood. DCFS 2005, 146-157. Web SearchBibTeX
203A New Linearizing Restriction in the Pattern Matching Problem. Yo-Sub Han, Derick Wood. FCT 2005, 552-562. Web SearchBibTeXDownload
202Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Yo-Sub Han, Derick Wood. ICTAC 2005, 96-109. Web SearchBibTeXDownload
201The generalization of generalized automata: expression automata. Yo-Sub Han, Derick Wood. Int. J. Found. Comput. Sci. (16): 499-510 (2005). Web SearchBibTeXDownload
2004
200The Generalization of Generalized Automata: Expression Automata. Yo-Sub Han, Derick Wood. CIAA 2004, 156-166. Web SearchBibTeXDownload
199A characterization of Thompson digraphs. Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi. Discrete Applied Mathematics (134): 317-337 (2004). Web SearchBibTeXDownload
198Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata. Anne Brüggemann-Klein, Derick Wood. Extreme Markup Languages® 2004. Web SearchBibTeXDownload
197On the state complexity of reversals of regular languages. Arto Salomaa, Derick Wood, Sheng Yu. Theor. Comput. Sci. (320): 315-329 (2004). Web SearchBibTeXDownload
196Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Kai Salomaa, Derick Wood. Theory Is Forever 2004, 259-267. Web SearchBibTeXDownload
2003
195On Predictive Parsing and Extended Context-Free Grammars. Anne Brüggemann-Klein, Derick Wood. Computer Science in Perspective 2003, 69-87. Web SearchBibTeXDownload
194On the Optimality of Holistic Algorithms for Twig Queries. Byron Choi, Malika Mahoui, Derick Wood. DEXA 2003, 28-37. Web SearchBibTeXDownload
193Planar Strong Visibility. Eugene Fink, Derick Wood. Int. J. Comput. Geometry Appl. (13): 173-187 (2003). Web SearchBibTeXDownload
2002
192On Predictive Parsing and Extended Context-Free Grammars. Anne Brüggemann-Klein, Derick Wood. CIAA 2002, 239-247. Web SearchBibTeXDownload
191The Regularity of Two-Way Nondeterministic Tree Automata Languages. Anne Brüggemann-Klein, Derick Wood. Int. J. Found. Comput. Sci. (13): 67-81 (2002). Web SearchBibTeXDownload
2001
190Block-Deterministic Regular Languages. Dora Giammarresi, Rosa Montalbano, Derick Wood. ICTCS 2001, 184-196. Web SearchBibTeXDownload
189SGML and XML Document Grammars and Exceptions. Pekka Kilpeläinen, Derick Wood. Inf. Comput. (169): 230-251 (2001). Web SearchBibTeXDownload
188Normal form algorithms for extended context-free grammars. Jürgen Albert, Dora Giammarresi, Derick Wood. Theor. Comput. Sci. (267): 35-47 (2001). Web SearchBibTeXDownload
2000
187Regularly Extended Two-Way Nondeterministic Tree Automata. Anne Brüggemann-Klein, Derick Wood. CIAA 2000, 57-66. Web SearchBibTeXDownload
186A Conceptual Model for XML. Anne Brüggemann-Klein, Derick Wood. DDEP/PODDP 2000, 176-189. Web SearchBibTeXDownload
185Caterpillars: A Context Specification Technique. Anne Brüggemann-Klein, Derick Wood. Markup Languages (2): 81-106 (2000). Web SearchBibTeX
1999
184The Visual Specification of Context. Anne Brüggemann-Klein, Stefan Hermann, Derick Wood. ADL 1999, 28-36. Web SearchBibTeXDownload
183Caterpillars, context, tree automata and tree pattern matching. Anne Brüggemann-Klein, Derick Wood. Developments in Language Theory 1999, 270-285. Web SearchBibTeX
182Visually Specifying Context. Stefan Hermann, Anne Brüggemann-Klein, Derick Wood. ELPUB 1999. Web SearchBibTeXDownload
181Thompson Languages. Dora Giammarresi, Jean-Luc Ponty, Derick Wood. Jewels are Forever 1999, 16-24. Web SearchBibTeX
180Thompson Digraphs: A Characterization. Dora Giammarresi, Jean-Luc Ponty, Derick Wood. WIA 1999, 91-100. Web SearchBibTeXDownload
1998
179One-Unambiguous Regular Languages. Anne Brüggemann-Klein, Derick Wood. Inf. Comput. (142): 182-206 (1998). Web SearchBibTeXDownload
178Context and Caterpillars and Structured Documents. Anne Brüggemann-Klein, Stefan Hermann, Derick Wood. PODDP 1998, 1-9. Web SearchBibTeXDownload
177A Conceptual Model for Tables. Xinxin Wang, Derick Wood. PODDP 1998, 10-23. Web SearchBibTeXDownload
176Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. Tony W. Lai, Derick Wood. SIAM J. Comput. (27): 1564-1591 (1998). Web SearchBibTeXDownload
175Extended Context-Free Grammars and Normal Form Algorithms. Jürgen Albert, Dora Giammarresi, Derick Wood. Workshop on Implementing Automata 1998, 1-12. Web SearchBibTeXDownload
1997
174WIA and Theory and Practice. Derick Wood. Workshop on Implementing Automata 1997, 1-6. Web SearchBibTeXDownload
1996
173Generalizing Halfspaces. Eugene Fink, Derick Wood. CCCG 1996, 211-216. Web SearchBibTeX
172Three-dimensional Restricted-Orient at Ion Convexity. Eugene Fink, Derick Wood. CCCG 1996, 258-263. Web SearchBibTeX
171O-Convexity Computing Hulls Approximations and Orientation Sets. V. Martynchik, Nikolai N. Metelski, Derick Wood. CCCG 1996, 2-7. Web SearchBibTeX
170From data representation to data model: Meta-semantic issues in the evolution of SGML. Darrell R. Raymond, Frank Wm. Tompa, Derick Wood. Computer Standards & Interfaces (18): 25-36 (1996). Web SearchBibTeXDownload
169Fundamentals of Restricted-Orientation Convexity. Eugene Fink, Derick Wood. Inf. Sci. (92): 175-196 (1996). Web SearchBibTeXDownload
168Tabular Formatting Problems. Xinxin Wang, Derick Wood. PODP 1996, 171-181. Web SearchBibTeXDownload
167SGML and Exceptions. Pekka Kilpeläinen, Derick Wood. PODP 1996, 39-49. Web SearchBibTeXDownload
166Structural Equivalence and ET0L Grammars. Kai Salomaa, Derick Wood, Sheng Yu. Theor. Comput. Sci. (164): 123-140 (1996). Web SearchBibTeXDownload
165Instruction Computation in Subset Construction. J. Howard Johnson, Derick Wood. Workshop on Implementing Automata 1996, 64-71. Web SearchBibTeXDownload
1995
164Staircase Visibility and Computation of Kernels. Sven Schuierer, Derick Wood. Algorithmica (14): 1-26 (1995). Web SearchBibTeXDownload
163Document Processing, Theory, and Practice (Abstract). Derick Wood. COCOON 1995, 647. Web SearchBibTeXDownload
162Standard Generalized Markup Language: Mathematical and Philosophical Issues. Derick Wood. Computer Science Today 1995, 344-365. Web SearchBibTeXDownload
161Complexity of E0L Structural Equivalence. Kai Salomaa, Derick Wood, Sheng Yu. ITA (29): 471-485 (1995). Web SearchBibTeX
160Binary Trees, Fringe Thickness and Minimum Path Length. Helen Cameron, Derick Wood. ITA (29): 171-191 (1995). Web SearchBibTeX
1994
159Maximal Path Length of Binary Trees. Helen Cameron, Derick Wood. Discrete Applied Mathematics (55): 15-35 (1994). Web SearchBibTeXDownload
158Foundations for Faster External Sorting (Extended Abstract). Vladimir Estivill-Castro, Derick Wood. FSTTCS 1994, 414-425. Web SearchBibTeXDownload
157Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. Helen Cameron, Derick Wood. Inf. Sci. (77): 141-152 (1994). Web SearchBibTeXDownload
156Pumping and Pushdown Machines. Kai Salomaa, Derick Wood, Sheng Yu. ITA (28): 221-232 (1994). Web SearchBibTeX
155Updating Approximately Complete Trees. Tony W. Lai, Derick Wood. ITA (28): 431-446 (1994). Web SearchBibTeX
154Grail: A C++ Library for Automata and Expressions. Darrell R. Raymond, Derick Wood. J. Symb. Comput. (17): 341-350 (1994). Web SearchBibTeXDownload
153Complexity of E0L Structural Equivalence. Kai Salomaa, Derick Wood, Sheng Yu. MFCS 1994, 587-596. Web SearchBibTeXDownload
152Rediscovering Pushdown Machines. Kai Salomaa, Derick Wood, Sheng Yu. Results and Trends in Theoretical Computer Science 1994, 372-385. Web SearchBibTeXDownload
151Balance in AVL Trees and Space Cost of Brother Trees. Helen Cameron, Derick Wood. Theor. Comput. Sci. (127): 199-228 (1994). Web SearchBibTeXDownload
1993
150On Efficient Entreeings. Paul S. Amerins, Ricardo A. Baeza-Yates, Derick Wood. Acta Inf. (30): 203-213 (1993). Web SearchBibTeXDownload
149Approximate String Matching with Suffix Automata. Esko Ukkonen, Derick Wood. Algorithmica (10): 353-364 (1993). Web SearchBibTeXDownload
148Generalized Kernels of Polygons with Holes. Sven Schuierer, Derick Wood. CCCG 1993, 222-227. Web SearchBibTeX
147Dent and Staircase Visibility. Derick Wood, Peter Yamamoto. CCCG 1993, 297-302. Web SearchBibTeX
146Interval Heaps. Jan van Leeuwen, Derick Wood. Comput. J. (36): 209-216 (1993). Web SearchBibTeXDownload
145Right Invariant Metrics and Measures of Presortedness. Vladimir Estivill-Castro, Heikki Mannila, Derick Wood. Discrete Applied Mathematics (42): 1-16 (1993). Cited by 11Web SearchBibTeXDownload
144Structural Equivalences and ET0L Grammars (Extended Abstract). Kai Salomaa, Derick Wood, Sheng Yu. FCT 1993, 430-439. Web SearchBibTeXDownload
143An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. Vladimir Estivill-Castro, Derick Wood. ICCI 1993, 8-12. Web SearchBibTeX
142A Top-Down Updating Algorithm for Weight-Balanced Trees. Tony W. Lai, Derick Wood. Int. J. Found. Comput. Sci. (4): 309-324 (1993). Web SearchBibTeXDownload
141Pm Numbers, Ambiguity, and Regularity. Helen Cameron, Derick Wood. ITA (27): 261-275 (1993). Web SearchBibTeX
140Randomized Adative Sorting. Vladimir Estivill-Castro, Derick Wood. Random Struct. Algorithms (4): 37-58 (1993). Web SearchBibTeXDownload
1992
139A Survey of Adaptive Sorting Algorithms. Vladimir Estivill-Castro, Derick Wood. ACM Comput. Surv. (24): 441-476 (1992). Web SearchBibTeXDownload
138A Note on the Path Length of Red-Black Trees. Helen Cameron, Derick Wood. Inf. Process. Lett. (42): 287-292 (1992). Web SearchBibTeXDownload
137Updating Binary Trees with Constant Linkage Cost. Thomas Ottmann, Derick Wood. Int. J. Found. Comput. Sci. (3): 479-501 (1992). Web SearchBibTeXDownload
136Deterministic Regular Languages. Anne Brüggemann-Klein, Derick Wood. STACS 1992, 173-184. Web SearchBibTeXDownload
1991
135Defining families of trees with E0L grammars. Thomas Ottmann, Derick Wood. Discrete Applied Mathematics (32): 195-209 (1991). Web SearchBibTeXDownload
134Balance in AVL Trees. Helen Cameron, Derick Wood. ICCI 1991, 127-133. Web SearchBibTeXDownload
133How Costly Can Red-Black Trees Be?. Helen Cameron, Derick Wood. ICCI 1991, 117-126. Web SearchBibTeXDownload
132A Relationship Between Self-Organizing Lists and Binary Search Trees. Tony W. Lai, Derick Wood. ICCI 1991, 111-116. Web SearchBibTeXDownload
131Practical Adaptive Sorting. Vladimir Estivill-Castro, Derick Wood. ICCI 1991, 47-54. Web SearchBibTeXDownload
130Restricted-oriented convex sets. Gregory J. E. Rawlins, Derick Wood. Inf. Sci. (54): 263-281 (1991). Web SearchBibTeXDownload
129Sorting, Measures of Disorder, and Worst-Case Performance. Vladimir Estivill-Castro, Derick Wood. New Results and New Trends in Computer Science 1991, 124-131. Web SearchBibTeXDownload
128Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. Tony W. Lai, Derick Wood. SODA 1991, 72-77. Web SearchBibTeXDownload
127Bounded Delay L Codes. Hermann A. Maurer, Arto Salomaa, Derick Wood. Theor. Comput. Sci. (84): 265-279 (1991). Web SearchBibTeXDownload
126A Generalization of Staircase Visibility. Sven Schuierer, Gregory J. E. Rawlins, Derick Wood. Workshop on Computational Geometry 1991, 277-287. Web SearchBibTeXDownload
1990
125Updating Almost Complete Trees or One Level Makes All the Difference. Tony W. Lai, Derick Wood. STACS 1990, 188-194. Web SearchBibTeXDownload
124How to Update a Balanced Binary Tree with a Constant Number of Rotations. Thomas Ottmann, Derick Wood. SWAT 1990, 122-131. Web SearchBibTeXDownload
123A Tight Upper Bound for the Path Length of AVL Trees. Rolf Klein, Derick Wood. Theor. Comput. Sci. (72): 251-264 (1990). Web SearchBibTeXDownload
1989
122A Dynamic Fixed Windowing Problem. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. Algorithmica (4): 535-550 (1989). Web SearchBibTeXDownload
121SEPARATION in d dimensions or strip mining in asteroid fields. Michel P. Devine, Derick Wood. Computers & Graphics (13): 329-336 (1989). Web SearchBibTeXDownload
120The Path Length of Binary Trees. Rolf Klein, Derick Wood. FODO 1989, 128-136. Web SearchBibTeX
119On Binary Trees. Rolf Klein, Derick Wood. IFIP Congress 1989, 449-454. Web SearchBibTeX
118A New Measure of Presortedness. Vladimir Estivill-Castro, Derick Wood. Inf. Comput. (83): 111-119 (1989). Web SearchBibTeXDownload
117On the path length of binary trees. Rolf Klein, Derick Wood. J. ACM (36): 280-289 (1989). Web SearchBibTeXDownload
1988
116On the Maximum Path Length of AVL Trees. Rolf Klein, Derick Wood. CAAP 1988, 16-27. Web SearchBibTeXDownload
115The Orthogonal Convex Skull Problem. Derick Wood, Chee-Keng Yap. Discrete & Computational Geometry (3): 349-365 (1988). Web SearchBibTeXDownload
114Drawing Trees Nicely with TeX. Anne Brüggemann-Klein, Derick Wood. Electronic Publishing (2): 101-115 (1988). Web SearchBibTeX
113The Riches of Rectangles. Derick Wood. IMYCS 1988, 161-168. Web SearchBibTeXDownload
112On Rectangular Visibility. Mark H. Overmars, Derick Wood. J. Algorithms (9): 372-390 (1988). Web SearchBibTeXDownload
111Hole Problems for Rectangles in the Plane. Gregory J. E. Rawlins, Peter Widmayer, Derick Wood. SIAM J. Discrete Math. (1): 86-97 (1988). Web SearchBibTeXDownload
110The 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. SIGCSE 1988, 223. Web SearchBibTeXDownload
109Voronoi Diagrams Based on General Metrics in the Plane. Rolf Klein, Derick Wood. STACS 1988, 281-291. Web SearchBibTeXDownload
108Extremal Cost Tree Data Structures. Derick Wood. SWAT 1988, 51-63. Web SearchBibTeXDownload
107Implicit Selection. Tony W. Lai, Derick Wood. SWAT 1988, 14-23. Web SearchBibTeXDownload
1987
106The Node Visit Cost of Brother Trees. Rolf Klein, Derick Wood. Inf. Comput. (75): 107-129 (1987). Web SearchBibTeXDownload
105Optimal Computation of Finitely Oriented Convex Hulls. Gregory J. E. Rawlins, Derick Wood. Inf. Comput. (72): 150-166 (1987). Web SearchBibTeXDownload
104Time- and Space-Optimal Contour Computation for a Set of Rectangles. Peter Widmayer, Derick Wood. Inf. Process. Lett. (24): 335-338 (1987). Web SearchBibTeXDownload
103Partitioning and separating sets of orthogonal polygons. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. Inf. Sci. (42): 31-49 (1987). Web SearchBibTeXDownload
102Concurrency Control in Database Structures with Relaxed Balance. Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood. PODS 1987, 170-176. Web SearchBibTeXDownload
101Variations on Visibility. J. Ian Munro, Mark H. Overmars, Derick Wood. Symposium on Computational Geometry 1987, 291-299. Web SearchBibTeXDownload
1986
100Optimal Dynamic Solutions for Fixed Windowing Problems. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. Symposium on Computational Geometry 1986, 109-115. Web SearchBibTeXDownload
99The Node Visit Cost of Brother Trees. Rolf Klein, Derick Wood. WG 1986, 106-117. Web SearchBibTeXDownload
1985
98Purely Top-Down Updating Algorithms for Stratified Search Trees. Thomas Ottmann, Michael Schrapp, Derick Wood. Acta Inf. (22): 85-100 (1985). Web SearchBibTeXDownload
97Weight-balanced trees are not stratified. Thomas Ottmann, Michael Schrapp, Derick Wood. Bulletin of the EATCS (25): 24-30 (1985). Web SearchBibTeX
96A fast algorithm for the Boolean masking problem. Thomas Ottmann, Peter Widmayer, Derick Wood. Computer Vision, Graphics, and Image Processing (30): 249-268 (1985). Web SearchBibTeXDownload
95Search Trees and Bubble Memories. Philippe Flajolet, Thomas Ottmann, Derick Wood. ITA (19): 137-164 (1985). Web SearchBibTeX
94Computing a convex skill of an orthogonal polygon. Derick Wood, Chee-Keng Yap. Symposium on Computational Geometry 1985, 311-315. Web SearchBibTeXDownload
1984
93The Complexity and Decidability of Separation. Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. ICALP 1984, 119-127. Web SearchBibTeXDownload
92Finding Rectangle Intersections by Divide-and Conquer. Ralf Hartmut Güting, Derick Wood. IEEE Trans. Computers (33): 671-675 (1984). Web SearchBibTeXDownload
91Inverse Morphic Equivalence on Languages. Juhani Karhumäki, Derick Wood. Inf. Process. Lett. (19): 213-218 (1984). Web SearchBibTeXDownload
90The Contour Problem for Rectilinear Polygons. Derick Wood. Inf. Process. Lett. (19): 229-236 (1984). Web SearchBibTeXDownload
89An Inverse Homomorphic Characterization of Full Principal AFL. Takashi Yokomori, Derick Wood. Inf. Sci. (33): 209-215 (1984). Web SearchBibTeXDownload
88On the Definition and Computation of Rectlinear Convex Hulls. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. Inf. Sci. (33): 157-171 (1984). Web SearchBibTeXDownload
87Binary search trees with binary comparison cost. Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. International Journal of Parallel Programming (13): 77-101 (1984). Web SearchBibTeXDownload
86Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood. ITA (18): 171-183 (1984). Web SearchBibTeX
85Systolic Tree Acceptors. Karel Culik II, Arto Salomaa, Derick Wood. ITA (18): 53-69 (1984). Web SearchBibTeX
84Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. Eljas Soisalon-Soininen, Derick Wood. J. Algorithms (5): 199-214 (1984). Web SearchBibTeXDownload
83Minimal-Cost Brother Trees. Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. SIAM J. Comput. (13): 197-217 (1984). Web SearchBibTeXDownload
1983
82Direct dynamic structures for some line segment problems. Gaston H. Gonnet, J. Ian Munro, Derick Wood. Computer Vision, Graphics, and Image Processing (23): 178-186 (1983). Web SearchBibTeXDownload
81Height-Ratio-Balanced Trees. Gaston H. Gonnet, Henk J. Olivié, Derick Wood. Comput. J. (26): 106-108 (1983). Web SearchBibTeXDownload
80A Supernormal-Form Theorem for Context-Free Grammars. Hermann A. Maurer, Arto Salomaa, Derick Wood. J. ACM (30): 95-102 (1983). Web SearchBibTeXDownload
79Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. Jürgen Albert, Derick Wood. J. Comput. Syst. Sci. (26): 82-91 (1983). Web SearchBibTeXDownload
78L Codes and Number Systems. Hermann A. Maurer, Arto Salomaa, Derick Wood. Theor. Comput. Sci. (22): 331-346 (1983). Web SearchBibTeXDownload
1982
77On a Covering Relation for Context-Free Grammars. Eljas Soisalon-Soininen, Derick Wood. Acta Inf. (17): 435-449 (1982). Web SearchBibTeXDownload
76Stabbing Line Segments. Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood. BIT (22): 274-281 (1982). Web SearchBibTeX
75Self-regulating L Systems. Helmut Jürgensen, Derick Wood. Elektronische Informationsverarbeitung und Kybernetik (18): 375-387 (1982). Web SearchBibTeX
74Counting and Reporting Intersections of d-Ranges. Hans-Werner Six, Derick Wood. IEEE Trans. Computers (31): 181-187 (1982). Web SearchBibTeXDownload
73A New Method for Concurrency in B-Trees. Yat-Sang Kwong, Derick Wood. IEEE Trans. Software Eng. (8): 211-222 (1982). Web SearchBibTeXDownload
72The 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. Information and Control (55): 125-174 (1982). Web SearchBibTeXDownload
71A Note on Some Tree Similarity Measures. Karel Culik II, Derick Wood. Inf. Process. Lett. (15): 39-42 (1982). Web SearchBibTeXDownload
70A Three-Restricted Normal Form Theorem for ET0L Languages. Takashi Yokomori, Derick Wood, Klaus-Jörn Lange. Inf. Process. Lett. (14): 97-100 (1982). Web SearchBibTeXDownload
69The parenthesis tree. Ralf Hartmut Güting, Derick Wood. Inf. Sci. (27): 151-162 (1982). Cited by 5Web SearchBibTeXDownload
68A comparison of iterative and defined classes of search trees. Thomas Ottmann, Derick Wood. International Journal of Parallel Programming (11): 155-178 (1982). Web SearchBibTeXDownload
67Dense Hierarchies of Grammatical Families. Hermann A. Maurer, Arto Salomaa, Derick Wood. J. ACM (29): 118-126 (1982). Web SearchBibTeXDownload
66Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. Vijay K. Vaishnavi, Derick Wood. J. Algorithms (3): 160-176 (1982). Web SearchBibTeXDownload
65Finitary and Infinitary Interpretations of Languages. Hermann A. Maurer, Arto Salomaa, Derick Wood. Mathematical Systems Theory (15): 251-265 (1982). Web SearchBibTeXDownload
64An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. Eljas Soisalon-Soininen, Derick Wood. PODS 1982, 108-116. Web SearchBibTeXDownload
1981
63Dense Multiway Trees. Karel Culik II, Thomas Ottmann, Derick Wood. ACM Trans. Database Syst. (6): 486-512 (1981). Web SearchBibTeXDownload
62A Note on Recurrent Words. Karel Culik II, Derick Wood. Information and Control (51): 88-93 (1981). Web SearchBibTeXDownload
61On Predecessors of Finite Languages. Hermann A. Maurer, Arto Salomaa, Derick Wood. Information and Control (50): 259-275 (1981). Web SearchBibTeX
60Life and Death in Markov Deterministic Tabled OL Systems. Helmut Jürgensen, David E. Matthews, Derick Wood. Information and Control (48): 80-93 (1981). Web SearchBibTeX
59On the Complete Simulation of DOL Schemes and Locally Catenative Schemes. Youichi Kobuchi, Derick Wood. Information and Control (49): 64-80 (1981). Web SearchBibTeXDownload
58Sub-Regular Grammar Forms. Thomas Ottmann, Arto Salomaa, Derick Wood. Inf. Process. Lett. (12): 184-187 (1981). Web SearchBibTeXDownload
57Cut point languages of markov DTOL systems. Helmut Jürgensen, David E. Matthews, Derick Wood. International Journal of Parallel Programming (10): 331-340 (1981). Web SearchBibTeXDownload
56Synchronized EOL Forms Under Uniform Interpretation. Hermann A. Maurer, Arto Salomaa, Derick Wood. ITA (15): 337-353 (1981). Web SearchBibTeX
55The Measure Problem for Rectangular Ranges in d-Space. Jan van Leeuwen, Derick Wood. J. Algorithms (2): 282-300 (1981). Web SearchBibTeXDownload
54Completeness of Context-Free Grammar Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. J. Comput. Syst. Sci. (23): 1-10 (1981). Web SearchBibTeXDownload
53On Structural Similarity of Context-Free Grammars. Eljas Soisalon-Soininen, Derick Wood. MFCS 1981, 491-498. Web SearchBibTeXDownload
52Uniform Interpretations of Grammar Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. SIAM J. Comput. (10): 483-502 (1981). Web SearchBibTeXDownload
1980
51Optimum Multiway Search Trees. Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood. Acta Inf. (14): 119-133 (1980). Cited by 12Web SearchBibTeXDownload
50On Generators and Generative Capacity of EOL Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. Acta Inf. (13): 87-107 (1980). Web SearchBibTeXDownload
49Context-Free Grammars With Selective Rewriting. Grzegorz Rozenberg, Derick Wood. Acta Inf. (13): 257-268 (1980). Web SearchBibTeXDownload
48The Rectangle Intersection Problem Revisited. Hans-Werner Six, Derick Wood. BIT (20): 426-433 (1980). Web SearchBibTeX
471-2 Brother Trees or AVL Trees Revisited. Thomas Ottmann, Derick Wood. Comput. J. (23): 248-255 (1980). Web SearchBibTeXDownload
46An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. Jon Louis Bentley, Derick Wood. IEEE Trans. Computers (29): 571-577 (1980). Web SearchBibTeXDownload
45MSW Spaces. Hermann A. Maurer, Arto Salomaa, Derick Wood. Information and Control (46): 187-199 (1980). Web SearchBibTeX
44Pure Grammars. Hermann A. Maurer, Arto Salomaa, Derick Wood. Information and Control (44): 47-72 (1980). Web SearchBibTeX
43Dynamization of Decomposable Searching Problems. Jan van Leeuwen, Derick Wood. Inf. Process. Lett. (10): 51-56 (1980). Web SearchBibTeXDownload
42Space and time optimal algorithms for a class of rectangle intersection problems. Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood. Inf. Sci. (21): 59-67 (1980). Web SearchBibTeXDownload
41Context-Free Grammar Forms with Strict Interpretations. Hermann A. Maurer, Arto Salomaa, Derick Wood. J. Comput. Syst. Sci. (21): 110-135 (1980). Web SearchBibTeXDownload
40Approaches to Concurrency in B-Trees. Yat-Sang Kwong, Derick Wood. MFCS 1980, 402-413. Web SearchBibTeXDownload
39On B-Trees: Routing Schemes and Concurrency. Yat-Sang Kwong, Derick Wood. SIGMOD Conference 1980, 207-211. Web SearchBibTeXDownload
38Concurrent Operations in Large Ordered Indexes. Yat-Sang Kwong, Derick Wood. Symposium on Programming 1980, 207-222. Web SearchBibTeXDownload
37Synchronized E0L Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. Theor. Comput. Sci. (12): 135-159 (1980). Web SearchBibTeXDownload
36The Analysis of Search Trees: A Survey. Thomas Ottmann, Hans-Werner Six, Derick Wood. WG 1980, 234-249. Web SearchBibTeXDownload
1979
35Context-Dependent L Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. Information and Control (42): 97-118 (1979). Web SearchBibTeXDownload
34A Mathematical Investigation of Propagating Graph 0L Systems. Karel Culik II, Derick Wood. Information and Control (43): 50-82 (1979). Web SearchBibTeXDownload
33Pure interpretations for EOL forms. Hermann A. Maurer, Grzegorz Rozenberg, Arto Salomaa, Derick Wood. ITA (13) (1979). Web SearchBibTeX
32On Non Context-Free Grammar Forms. Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood. Mathematical Systems Theory (12): 297-324 (1979). Web SearchBibTeXDownload
31A Survey of Grammar and L Forms-1978. Derick Wood. MFCS 1979, 191-200. Web SearchBibTeXDownload
30A Uniform Approach to Balanced Binary and Multiway Trees. Thomas Ottmann, Derick Wood. MFCS 1979, 398-407. Web SearchBibTeXDownload
29Storage Representations for Tree-Like Data Structures. Arnold L. Rosenberg, Derick Wood, Zvi Galil. STOC (13): 105-130 (1979). Web SearchBibTeXDownload
28Node-Visit Optimal 1-2 Brother Trees. Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. Theoretical Computer Science 1979, 213-221. Web SearchBibTeXDownload
1978
27Precedence Relations in Grammar Forms. Seymour Ginsburg, Derick Wood. Acta Inf. (11): 79-88 (1978). Web SearchBibTeXDownload
26Right Brother Trees. Thomas Ottmann, Hans-Werner Six, Derick Wood. Commun. ACM (21): 769-776 (1978). Web SearchBibTeXDownload
25Uniform Interpretations of L Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. Information and Control (36): 157-173 (1978). Web SearchBibTeXDownload
24Speed-varying OL systems. Karel Culik II, Derick Wood. Inf. Sci. (14): 161-170 (1978). Web SearchBibTeXDownload
23An approach to a unified theory of grammar and L forms. Vijay K. Vaishnavi, Derick Wood. Inf. Sci. (15): 77-94 (1978). Web SearchBibTeXDownload
22Relative Goodness for EOL Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. ITA (12) (1978). Web SearchBibTeX
21ETOL Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. J. Comput. Syst. Sci. (16): 345-361 (1978). Web SearchBibTeXDownload
20On Good E0L Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. SIAM J. Comput. (7): 158-166 (1978). Web SearchBibTeXDownload
1977
19EOL Forms. Hermann A. Maurer, Arto Salomaa, Derick Wood. Acta Inf. (8): 75-96 (1977). Web SearchBibTeXDownload
18Two Variations on n-Parallel Finite State Generators. Derick Wood. Comput. J. (20): 63-67 (1977). Web SearchBibTeXDownload
17Generalized time-delayed OL languages. Derick Wood. Inf. Sci. (12): 151-155 (1977). Web SearchBibTeXDownload
1976
16On Grammar Forms with Terminal Context. Hermann A. Maurer, Derick Wood. Acta Inf. (6): 397-402 (1976). Web SearchBibTeXDownload
15Locally Balanced Binary Trees. A. Walker, Derick Wood. Comput. J. (19): 322-325 (1976). Web SearchBibTeXDownload
14Iterated a-NGSM Maps and \\Gamma Systems. Derick Wood. Information and Control (32): 1-26 (1976). Web SearchBibTeXDownload
13A Note on K-Iteration Grammars. Grzegorz Rozenberg, Derick Wood. Inf. Process. Lett. (4): 162-164 (1976). Web SearchBibTeXDownload
12A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. Jan van Leeuwen, Derick Wood. Theor. Comput. Sci. (1): 199-214 (1976). Web SearchBibTeXDownload
1975
11Time-delayed OL languages and sequences. Derick Wood. Inf. Sci. (8): 271-281 (1975). Web SearchBibTeXDownload
10A note on Lindenmayer systems, Szilard languages, spectra, and equivalence. Derick Wood. International Journal of Parallel Programming (4): 53-62 (1975). Web SearchBibTeXDownload
9Image Theorems for Simple Matrix Languages and n-Parallel Languages. Robert D. Rosebrugh, Derick Wood. Mathematical Systems Theory (8): 150-155 (1975). Web SearchBibTeXDownload
1974
8Generative Models for Parallel Processes. Grzegorz Rozenberg, Derick Wood. Comput. J. (17): 344-348 (1974). Web SearchBibTeXDownload
7Bounded Parallelism and Regular Languages. Derick Wood. L Systems 1974, 292-301. Web SearchBibTeXDownload
1973
6A Characterization Theorem for n-Parallel Right Linear Languages. Robert D. Rosebrugh, Derick Wood. J. Comput. Syst. Sci. (7): 579-582 (1973). Web SearchBibTeXDownload
1972
5A Factor Theorem for Subsets of a Free Monoid. Derick Wood. Information and Control (21): 21-26 (1972). Web SearchBibTeXDownload
1971
4A Further Note on Top-Down Deterministic Languages. Derick Wood. Comput. J. (14): 396-403 (1971). Web SearchBibTeXDownload
1970
3The Theory of Left Factored Languages: Part 2. Derick Wood. Comput. J. (13): 55-62 (1970). Web SearchBibTeXDownload
2A Generalised Normal Form Theorem for Context-Free Grammars. Derick Wood. Comput. J. (13): 272-277 (1970). Web SearchBibTeXDownload
1969
1A few more trouble spots in ALGOL 60. Derick Wood. Commun. ACM (12): 247-248 (1969). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research