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