default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDerick Wood
Person information
- affiliation: Hong Kong University of Science and Technology
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2009
[j159]Yo-Sub Han, Kai Salomaa, Derick Wood:
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Informaticae 90(1-2): 93-106 (2009)- [c79]Yo-Sub Han, Kai Salomaa, Derick Wood:
Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115 - 2008
- [j158]Yo-Sub Han, Derick Wood:
Generalizations of 1-deterministic regular languages. Inf. Comput. 206(9-10): 1117-1125 (2008) - 2007
- [j157]Yo-Sub Han, Kai Salomaa, Derick Wood:
Intercode Regular Languages. Fundam. Informaticae 76(1-2): 113-128 (2007) - [j156]Yo-Sub Han, Derick Wood:
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Fundam. Informaticae 81(4): 441-457 (2007) - [j155]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. 12(1-2): 181-194 (2007) - [j154]Yo-Sub Han, Derick Wood:
Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. 370(1-3): 110-120 (2007) - [j153]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) - [j152]Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-free regular languages and pattern matching. Theor. Comput. Sci. 389(1-2): 307-317 (2007) - [c78]Yo-Sub Han, Derick Wood:
Generalizations of One-Deterministic Regular Languages. LATA 2007: 273-284 - 2006
- [j151]Yo-Sub Han, Yajun Wang, Derick Wood:
Infix-free Regular Expressions and Languages. Int. J. Found. Comput. Sci. 17(2): 379-394 (2006) - [c77]Yo-Sub Han, Derick Wood:
Overlap-Free Regular Languages. COCOON 2006: 469-478 - [c76]Yo-Sub Han, Kai Salomaa, Derick Wood:
State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176 - [c75]Yo-Sub Han, Kai Salomaa, Derick Wood:
Prime Decompositions of Regular Languages. Developments in Language Theory 2006: 145-155 - 2005
- [j150]Yo-Sub Han, Derick Wood:
The generalization of generalized automata: expression automata. Int. J. Found. Comput. Sci. 16(3): 499-510 (2005) - [c74]Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-Free Regular-Expression Matching. CPM 2005: 298-309 - [c73]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. DCFS 2005: 146-157 - [c72]Yo-Sub Han, Derick Wood:
A New Linearizing Restriction in the Pattern Matching Problem. FCT 2005: 552-562 - [c71]Yo-Sub Han, Derick Wood:
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. ICTAC 2005: 96-109 - [c70]Yo-Sub Han, Derick Wood:
Shorter Regular Expressions from Finite-State Automata. CIAA 2005: 141-152 - 2004
- [b4]Eugene Fink, Derick Wood:
Restricted-Orientation Convexity. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2004, ISBN 978-3-642-62323-3, pp. I-X, 1-102 - [j149]Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi:
A characterization of Thompson digraphs. Discret. Appl. Math. 134(1-3): 317-337 (2004) - [j148]Bruce W. Watson, Derick Wood:
Introduction. Theor. Comput. Sci. 313(1): 1 (2004) - [j147]Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004) - [c69]Kai Salomaa, Derick Wood:
Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Theory Is Forever 2004: 259-267 - [c68]Anne Brüggemann-Klein, Derick Wood:
Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata. Extreme Markup Languages® 2004 - [c67]Yo-Sub Han, Derick Wood:
The Generalization of Generalized Automata: Expression Automata. CIAA 2004: 156-166 - 2003
- [j146]Eugene Fink, Derick Wood:
Planar Strong Visibility. Int. J. Comput. Geom. Appl. 13(2): 173-187 (2003) - [c66]Anne Brüggemann-Klein, Derick Wood:
On Predictive Parsing and Extended Context-Free Grammars. Computer Science in Perspective 2003: 69-87 - [c65]Byron Choi, Malika Mahoui, Derick Wood:
On the Optimality of Holistic Algorithms for Twig Queries. DEXA 2003: 28-37 - 2002
- [j145]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) - [c64]Anne Brüggemann-Klein, Derick Wood:
On Predictive Parsing and Extended Context-Free Grammars. CIAA 2002: 239-247 - [e6]Bruce W. Watson, Derick Wood:
Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers. Lecture Notes in Computer Science 2494, Springer 2002, ISBN 3-540-00400-9 [contents] - 2001
- [j144]Pekka Kilpeläinen, Derick Wood:
SGML and XML Document Grammars and Exceptions. Inf. Comput. 169(2): 230-251 (2001) - [j143]Jürgen Albert, Dora Giammarresi, Derick Wood:
Normal form algorithms for extended context-free grammars. Theor. Comput. Sci. 267(1-2): 35-47 (2001) - [c63]Dora Giammarresi, Rosa Montalbano, Derick Wood:
Block-Deterministic Regular Languages. ICTCS 2001: 184-196 - 2000
- [j142]Anne Brüggemann-Klein, Derick Wood:
Caterpillars: A Context Specification Technique. Markup Lang. 2(1): 81-106 (2000) - [c62]Anne Brüggemann-Klein, Derick Wood:
A Conceptual Model for XML. DDEP/PODDP 2000: 176-189 - [c61]Anne Brüggemann-Klein, Derick Wood:
Regularly Extended Two-Way Nondeterministic Tree Automata. CIAA 2000: 57-66 - [e5]Arto Salomaa, Derick Wood, Sheng Yu:
A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific 2000, ISBN 981-02-4590-4 [contents]
1990 – 1999
- 1999
- [c60]Anne Brüggemann-Klein, Stefan Hermann, Derick Wood:
The Visual Specification of Context. ADL 1999: 28-36 - [c59]Dora Giammarresi, Jean-Luc Ponty, Derick Wood:
Thompson Languages. Jewels are Forever 1999: 16-24 - [c58]Anne Brüggemann-Klein, Derick Wood:
Caterpillars, context, tree automata and tree pattern matching. Developments in Language Theory 1999: 270-285 - [c57]Stefan Hermann, Anne Brüggemann-Klein, Derick Wood:
Visually Specifying Context. ELPUB 1999 - [c56]Dora Giammarresi, Jean-Luc Ponty, Derick Wood:
Thompson Digraphs: A Characterization. WIA 1999: 91-100 - 1998
- [j141]Anne Brüggemann-Klein, Derick Wood:
One-Unambiguous Regular Languages. Inf. Comput. 140(2): 229-253 (1998) - [j140]Anne Brüggemann-Klein, Derick Wood:
One-Unambiguous Regular Languages. Inf. Comput. 142(2): 182-206 (1998) - [j139]Tony W. Lai, Derick Wood:
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM J. Comput. 27(6): 1564-1591 (1998) - [c55]Anne Brüggemann-Klein, Stefan Hermann, Derick Wood:
Context and Caterpillars and Structured Documents. PODDP 1998: 1-9 - [c54]Xinxin Wang, Derick Wood:
A Conceptual Model for Tables. PODDP 1998: 10-23 - [c53]Jürgen Albert, Dora Giammarresi, Derick Wood:
Extended Context-Free Grammars and Normal Form Algorithms. Workshop on Implementing Automata 1998: 1-12 - [e4]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. Lecture Notes in Computer Science 1481, Springer 1998, ISBN 3-540-65086-5 [contents] - [e3]Derick Wood, Sheng Yu:
Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers. Lecture Notes in Computer Science 1436, Springer 1998, ISBN 3-540-64694-9 [contents] - 1997
- [c52]Derick Wood:
WIA and Theory and Practice. Workshop on Implementing Automata 1997: 1-6 - [e2]Charles K. Nicholas, Derick Wood:
Principles of Document Processing, Third International Workshop, PODP'96, Palo Alto, California, USA, September 23, 1996, Proceedings. Lecture Notes in Computer Science 1293, Springer 1997, ISBN 3-540-63620-X [contents] - [e1]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. Lecture Notes in Computer Science 1260, Springer 1997, ISBN 3-540-63174-7 [contents] - 1996
- [j138]Darrell R. Raymond, Frank Wm. Tompa
, Derick Wood:
From data representation to data model: Meta-semantic issues in the evolution of SGML. Comput. Stand. Interfaces 18(1): 25-36 (1996) - [j137]Vladimir Estivill-Castro, Derick Wood:
An adaptive generic sorting algorithm that uses variable partitioning. Int. J. Comput. Math. 61(3-4): 181-194 (1996) - [j136]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. 62(1-2): 23-44 (1996) - [j135]Eugene Fink, Derick Wood:
Fundamentals of Restricted-Orientation Convexity. Inf. Sci. 92(1-4): 175-196 (1996) - [j134]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996) - [c51]V. Martynchik, Nikolai N. Metelski, Derick Wood:
O-Convexity Computing Hulls Approximations and Orientation Sets. CCCG 1996: 2-7 - [c50]Eugene Fink, Derick Wood:
Generalizing Halfspaces. CCCG 1996: 211-216 - [c49]Eugene Fink, Derick Wood:
Three-dimensional Restricted-Orient at Ion Convexity. CCCG 1996: 258-263 - [c48]Pekka Kilpeläinen, Derick Wood:
SGML and Exceptions. PODP 1996: 39-49 - [c47]Xinxin Wang, Derick Wood:
Tabular Formatting Problems. PODP 1996: 171-181 - [c46]J. Howard Johnson, Derick Wood:
Instruction Computation in Subset Construction. Workshop on Implementing Automata 1996: 64-71 - 1995
- [j133]Sven Schuierer, Derick Wood:
Staircase Visibility and Computation of Kernels. Algorithmica 14(1): 1-26 (1995) - [j132]Chet Creider, Jorge Hankamer, Derick Wood:
Preset two-head automata and morphological analysis of natural language. Int. J. Comput. Math. 58(1-2): 1-18 (1995) - [j131]Helen Cameron, Derick Wood:
Binary Trees, Fringe Thickness and Minimum Path Length. RAIRO Theor. Informatics Appl. 29(3): 171-191 (1995) - [j130]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. 29(6): 471-485 (1995) - [c45]Derick Wood:
Document Processing, Theory, and Practice (Abstract). COCOON 1995: 647 - [p1]Derick Wood:
Standard Generalized Markup Language: Mathematical and Philosophical Issues. Computer Science Today 1995: 344-365 - 1994
- [j129]Helen Cameron, Derick Wood:
Maximal Path Length of Binary Trees. Discret. Appl. Math. 55(1): 15-35 (1994) - [j128]Helen Cameron, Derick Wood:
Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. Inf. Sci. 77(1-2): 141-152 (1994) - [j127]Kai Salomaa, Derick Wood, Sheng Yu:
Pumping and Pushdown Machines. RAIRO Theor. Informatics Appl. 28(3-4): 221-232 (1994) - [j126]Tony W. Lai, Derick Wood:
Updating Approximately Complete Trees. RAIRO Theor. Informatics Appl. 28(5): 431-446 (1994) - [j125]Darrell R. Raymond, Derick Wood:
Grail: A C++ Library for Automata and Expressions. J. Symb. Comput. 17(4): 341-350 (1994) - [j124]Helen Cameron, Derick Wood:
Balance in AVL Trees and Space Cost of Brother Trees. Theor. Comput. Sci. 127(2): 199-228 (1994) - [c44]Kai Salomaa, Derick Wood, Sheng Yu:
Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385 - [c43]Vladimir Estivill-Castro, Derick Wood:
Foundations for Faster External Sorting (Extended Abstract). FSTTCS 1994: 414-425 - [c42]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. MFCS 1994: 587-596 - 1993
- [b3]Derick Wood:
Data structures, algorithms, and performance. Addison-Wesley 1993, ISBN 978-0-201-52148-1, pp. I-XIII, 1-594 - [j123]Paul S. Amerins, Ricardo A. Baeza-Yates, Derick Wood:
On Efficient Entreeings. Acta Informatica 30(3): 203-213 (1993) - [j122]Esko Ukkonen, Derick Wood:
Approximate String Matching with Suffix Automata. Algorithmica 10(5): 353-364 (1993) - [j121]Jan van Leeuwen, Derick Wood:
Interval Heaps. Comput. J. 36(3): 209-216 (1993) - [j120]Vladimir Estivill-Castro, Heikki Mannila, Derick Wood:
Right Invariant Metrics and Measures of Presortedness. Discret. Appl. Math. 42(1): 1-16 (1993) - [j119]Tony W. Lai, Derick Wood:
A Top-Down Updating Algorithm for Weight-Balanced Trees. Int. J. Found. Comput. Sci. 4(4): 309-324 (1993) - [j118]Helen Cameron, Derick Wood:
Pm Numbers, Ambiguity, and Regularity. RAIRO Theor. Informatics Appl. 27(3): 261-275 (1993) - [j117]Vladimir Estivill-Castro, Derick Wood:
Randomized Adative Sorting. Random Struct. Algorithms 4(1): 37-58 (1993) - [c41]Sven Schuierer, Derick Wood:
Generalized Kernels of Polygons with Holes. CCCG 1993: 222-227 - [c40]Derick Wood, Peter Yamamoto:
Dent and Staircase Visibility. CCCG 1993: 297-302 - [c39]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439 - [c38]Vladimir Estivill-Castro, Derick Wood:
An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. ICCI 1993: 8-12 - 1992
- [j116]Vladimir Estivill-Castro, Derick Wood:
A Generic Adaptive Sorting Algorithm. Comput. J. 35(Additional-Papers): A505-A512 (1992) - [j115]Vladimir Estivill-Castro, Derick Wood:
A Survey of Adaptive Sorting Algorithms. ACM Comput. Surv. 24(4): 441-476 (1992) - [j114]Thomas Ottmann, Derick Wood:
Updating Binary Trees with Constant Linkage Cost. Int. J. Found. Comput. Sci. 3(4): 479-501 (1992) - [j113]Helen Cameron, Derick Wood:
A Note on the Path Length of Red-Black Trees. Inf. Process. Lett. 42(5): 287-292 (1992) - [c37]Anne Brüggemann-Klein, Derick Wood:
Deterministic Regular Languages. STACS 1992: 173-184 - 1991
- [j112]Thomas Ottmann, Derick Wood:
Defining families of trees with E0L grammars. Discret. Appl. Math. 32(2): 195-209 (1991) - [j111]Gregory J. E. Rawlins, Derick Wood:
Restricted-oriented convex sets. Inf. Sci. 54(3): 263-281 (1991) - [j110]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Bounded Delay L Codes. Theor. Comput. Sci. 84(2): 265-279 (1991) - [c36]Vladimir Estivill-Castro, Derick Wood:
Sorting, Measures of Disorder, and Worst-Case Performance. New Results and New Trends in Computer Science 1991: 124-131 - [c35]Sven Schuierer, Gregory J. E. Rawlins, Derick Wood:
A Generalization of Staircase Visibility. Workshop on Computational Geometry 1991: 277-287 - [c34]Vladimir Estivill-Castro, Derick Wood:
Practical Adaptive Sorting. ICCI 1991: 47-54 - [c33]Tony W. Lai, Derick Wood:
A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI 1991: 111-116 - [c32]Helen Cameron, Derick Wood:
How Costly Can Red-Black Trees Be? ICCI 1991: 117-126 - [c31]Helen Cameron, Derick Wood:
Balance in AVL Trees. ICCI 1991: 127-133 - [c30]Tony W. Lai, Derick Wood:
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SODA 1991: 72-77 - 1990
- [j109]Rolf Klein, Derick Wood:
A Tight Upper Bound for the Path Length of AVL Trees. Theor. Comput. Sci. 72(2&3): 251-264 (1990) - [c29]Tony W. Lai, Derick Wood:
Updating Almost Complete Trees or One Level Makes All the Difference. STACS 1990: 188-194 - [c28]Thomas Ottmann, Derick Wood:
How to Update a Balanced Binary Tree with a Constant Number of Rotations. SWAT 1990: 122-131
1980 – 1989
- 1989
- [j108]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - [j107]Michel P. Devine, Derick Wood:
SEPARATION in d dimensions or strip mining in asteroid fields. Comput. Graph. 13(3): 329-336 (1989) - [j106]Vladimir Estivill-Castro, Derick Wood:
A New Measure of Presortedness. Inf. Comput. 83(1): 111-119 (1989) - [j105]Rolf Klein, Derick Wood:
On the path length of binary trees. J. ACM 36(2): 280-289 (1989) - [c27]Rolf Klein, Derick Wood:
The Path Length of Binary Trees. FODO 1989: 128-136 - [c26]Rolf Klein, Derick Wood:
On Binary Trees. IFIP Congress 1989: 449-454 - 1988
- [j104]Derick Wood, Chee-Keng Yap:
The Orthogonal Convex Skull Problem. Discret. Comput. Geom. 3: 349-365 (1988) - [j103]Anne Brüggemann-Klein, Derick Wood:
Drawing Trees Nicely with TeX. Electron. Publ. 2(2): 101-115 (1988) - [j102]Mark H. Overmars, Derick Wood:
On Rectangular Visibility. J. Algorithms 9(3): 372-390 (1988) - [j101]Gregory J. E. Rawlins, Peter Widmayer, Derick Wood:
Hole Problems for Rectangles in the Plane. SIAM J. Discret. Math. 1(1): 86-97 (1988) - [c25]Rolf Klein, Derick Wood:
On the Maximum Path Length of AVL Trees. CAAP 1988: 16-27 - [c24]Derick Wood:
The Riches of Rectangles. IMYCS 1988: 161-168 - [c23]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 - [c22]Rolf Klein, Derick Wood:
Voronoi Diagrams Based on General Metrics in the Plane. STACS 1988: 281-291 - [c21]Tony W. Lai, Derick Wood:
Implicit Selection. SWAT 1988: 14-23 - [c20]Derick Wood:
Extremal Cost Tree Data Structures. SWAT 1988: 51-63 - 1987
- [b2]Derick Wood:
Theory of computation. Wiley 1987, ISBN 978-0-471-60351-1, pp. I-XVIII, 1-558 - [j100]Gregory J. E. Rawlins, Derick Wood:
Optimal Computation of Finitely Oriented Convex Hulls. Inf. Comput. 72(2): 150-166 (1987) - [j99]Rolf Klein, Derick Wood:
The Node Visit Cost of Brother Trees. Inf. Comput. 75(2): 107-129 (1987) - [j98]Peter Widmayer, Derick Wood:
Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. 24(5): 335-338 (1987) - [j97]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
Partitioning and separating sets of orthogonal polygons. Inf. Sci. 42(1): 31-49 (1987) - [c19]J. Ian Munro, Mark H. Overmars, Derick Wood:
Variations on Visibility. SCG 1987: 291-299 - [c18]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Concurrency Control in Database Structures with Relaxed Balance. PODS 1987: 170-176 - 1986
- [j96]Thomas Ottmann, Derick Wood:
Space-economical plane-sweep algorithms. Comput. Vis. Graph. Image Process. 34(1): 35-51 (1986) - [c17]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. SCG 1986: 109-115 - [c16]Rolf Klein, Derick Wood:
The Node Visit Cost of Brother Trees. WG 1986: 106-117 - 1985
- [j95]Thomas Ottmann, Michael Schrapp, Derick Wood:
Purely Top-Down Updating Algorithms for Stratified Search Trees. Acta Informatica 22(1): 85-100 (1985) - [j94]Thomas Ottmann, Peter Widmayer, Derick Wood:
A fast algorithm for the Boolean masking problem. Comput. Vis. Graph. Image Process. 30(3): 249-268 (1985) - [j93]Thomas Ottmann, Michael Schrapp, Derick Wood:
Weight-balanced trees are not stratified. Bull. EATCS 25: 24-30 (1985) - [j92]Philippe Flajolet, Thomas Ottmann, Derick Wood:
Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. 19(2): 137-164 (1985) - [c15]Derick Wood, Chee-Keng Yap:
Computing a convex skill of an orthogonal polygon. SCG 1985: 311-315 - 1984
- [j91]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Binary search trees with binary comparison cost. Int. J. Parallel Program. 13(2): 77-101 (1984) - [j90]Juhani Karhumäki, Derick Wood:
Inverse Morphic Equivalence on Languages. Inf. Process. Lett. 19(5): 213-218 (1984) - [j89]Derick Wood:
The Contour Problem for Rectilinear Polygons. Inf. Process. Lett. 19(5): 229-236 (1984) - [j88]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. 33: 157-171 (1984) - [j87]Takashi Yokomori, Derick Wood:
An Inverse Homomorphic Characterization of Full Principal AFL. Inf. Sci. 33(3): 209-215 (1984) - [j86]Karel Culík II, Arto Salomaa, Derick Wood:
Systolic Tree Acceptors. RAIRO Theor. Informatics Appl. 18(1): 53-69 (1984) - [j85]Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. 18(2): 171-183 (1984) - [j84]Eljas Soisalon-Soininen, Derick Wood:
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms 5(2): 199-214 (1984) - [j83]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) - [j82]Ralf Hartmut Güting, Derick Wood:
Finding Rectangle Intersections by Divide-and Conquer. IEEE Trans. Computers 33(7): 671-675 (1984) - [c14]Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. ICALP 1984: 119-127 - 1983
- [j81]Gaston H. Gonnet, Henk J. Olivié, Derick Wood:
Height-Ratio-Balanced Trees. Comput. J. 26(2): 106-108 (1983) - [j80]Gaston H. Gonnet, J. Ian Munro, Derick Wood:
Direct dynamic structures for some line segment problems. Comput. Vis. Graph. Image Process. 23(2): 178-186 (1983) - [j79]Hermann A. Maurer, Arto Salomaa, Derick Wood:
A Supernormal-Form Theorem for Context-Free Grammars. J. ACM 30(1): 95-102 (1983) - [j78]Jürgen Albert, Derick Wood:
Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. J. Comput. Syst. Sci. 26(1): 82-91 (1983) - [j77]Hermann A. Maurer, Arto Salomaa, Derick Wood:
L Codes and Number Systems. Theor. Comput. Sci. 22: 331-346 (1983) - 1982
- [j76]Eljas Soisalon-Soininen, Derick Wood:
On a Covering Relation for Context-Free Grammars. Acta Informatica 17: 435-449 (1982) - [j75]Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood:
Stabbing Line Segments. BIT 22(3): 274-281 (1982) - [j74]Helmut Jürgensen, Derick Wood:
Self-regulating L Systems. J. Inf. Process. Cybern. 18(7/8): 375-387 (1982) - [j73]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. Inf. Control. 55(1-3): 125-174 (1982) - [j72]Thomas Ottmann, Derick Wood:
A comparison of iterative and defined classes of search trees. Int. J. Parallel Program. 11(3): 155-178 (1982) - [j71]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) - [j70]Karel Culík II, Derick Wood:
A Note on Some Tree Similarity Measures. Inf. Process. Lett. 15(1): 39-42 (1982) - [j69]Ralf Hartmut Güting, Derick Wood:
The parenthesis tree. Inf. Sci. 27(2): 151-162 (1982) - [j68]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Dense Hierarchies of Grammatical Families. J. ACM 29(1): 118-126 (1982) - [j67]Vijay K. Vaishnavi, Derick Wood:
Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. J. Algorithms 3(2): 160-176 (1982) - [j66]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Finitary and Infinitary Interpretations of Languages. Math. Syst. Theory 15(3): 251-265 (1982) - [j65]Hans-Werner Six, Derick Wood:
Counting and Reporting Intersections of d-Ranges. IEEE Trans. Computers 31(3): 181-187 (1982) - [j64]Yat-Sang Kwong, Derick Wood:
A New Method for Concurrency in B-Trees. IEEE Trans. Software Eng. 8(3): 211-222 (1982) - [c13]Eljas Soisalon-Soininen, Derick Wood:
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS 1982: 108-116 - 1981
- [j63]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The implementation of insertion and deletion algorithms for 1-2 brother trees. Computing 26(4): 367-378 (1981) - [j62]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Colorings and interpretations: a connection between graphs and grammar forms. Discret. Appl. Math. 3(2): 119-135 (1981) - [j61]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Decidability and density in two-symbol grammar forms. Discret. Appl. Math. 3(4): 289-299 (1981) - [j60]Helmut Jürgensen, David E. Matthews, Derick Wood:
Life and Death in Markov Deterministic Tabled OL Systems. Inf. Control. 48(1): 80-93 (1981) - [j59]Youichi Kobuchi, Derick Wood:
On the Complete Simulation of DOL Schemes and Locally Catenative Schemes. Inf. Control. 49(1): 64-80 (1981) - [j58]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Predecessors of Finite Languages. Inf. Control. 50(3): 259-275 (1981) - [j57]Karel Culík II, Derick Wood:
A Note on Recurrent Words. Inf. Control. 51(1): 88-93 (1981) - [j56]Helmut Jürgensen, David E. Matthews, Derick Wood:
Cut point languages of markov DTOL systems. Int. J. Parallel Program. 10(5): 331-340 (1981) - [j55]Thomas Ottmann, Arto Salomaa, Derick Wood:
Sub-Regular Grammar Forms. Inf. Process. Lett. 12(4): 184-187 (1981) - [j54]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized EOL Forms Under Uniform Interpretation. RAIRO Theor. Informatics Appl. 15(4): 337-353 (1981) - [j53]Jan van Leeuwen, Derick Wood:
The Measure Problem for Rectangular Ranges in d-Space. J. Algorithms 2(3): 282-300 (1981) - [j52]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Completeness of Context-Free Grammar Forms. J. Comput. Syst. Sci. 23(1): 1-10 (1981) - [j51]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Uniform Interpretations of Grammar Forms. SIAM J. Comput. 10(3): 483-502 (1981) - [j50]Karel Culík II, Thomas Ottmann, Derick Wood:
Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512 (1981) - [c12]Eljas Soisalon-Soininen, Derick Wood:
On Structural Similarity of Context-Free Grammars. MFCS 1981: 491-498 - [c11]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
A Realistic Cost Measure for Binary Search Trees. WG 1981: 163-172 - 1980
- [b1]Derick Wood:
Grammars and L Forms: An Introduction. Lecture Notes in Computer Science 91, Springer 1980, ISBN 3-540-10233-7 - [j49]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Generators and Generative Capacity of EOL Forms. Acta Informatica 13: 87-107 (1980) - [j48]Grzegorz Rozenberg, Derick Wood:
Context-Free Grammars With Selective Rewriting. Acta Informatica 13: 257-268 (1980) - [j47]Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood:
Optimum Multiway Search Trees. Acta Informatica 14: 119-133 (1980) - [j46]Hans-Werner Six, Derick Wood:
The Rectangle Intersection Problem Revisited. BIT 20(4): 426-433 (1980) - [j45]Thomas Ottmann, Derick Wood:
1-2 Brother Trees or AVL Trees Revisited. Comput. J. 23(3): 248-255 (1980) - [j44]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Pure Grammars. Inf. Control. 44(1): 47-72 (1980) - [j43]Hermann A. Maurer, Arto Salomaa, Derick Wood:
MSW Spaces. Inf. Control. 46(3): 187-199 (1980) - [j42]Jan van Leeuwen, Derick Wood:
Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 10(2): 51-56 (1980) - [j41]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) - [j40]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Context-Free Grammar Forms with Strict Interpretations. J. Comput. Syst. Sci. 21(1): 110-135 (1980) - [j39]Jon Louis Bentley, Derick Wood:
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. IEEE Trans. Computers 29(7): 571-577 (1980) - [j38]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized E0L Forms. Theor. Comput. Sci. 12: 135-159 (1980) - [c10]Yat-Sang Kwong, Derick Wood:
Approaches to Concurrency in B-Trees. MFCS 1980: 402-413 - [c9]Yat-Sang Kwong, Derick Wood:
Concurrent Operations in Large Ordered Indexes. Symposium on Programming 1980: 207-222 - [c8]Yat-Sang Kwong, Derick Wood:
On B-Trees: Routing Schemes and Concurrency. SIGMOD Conference 1980: 207-211 - [c7]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The Analysis of Search Trees: A Survey. WG 1980: 234-249
1970 – 1979
- 1979
- [j37]Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood:
Height balanced 2-3 trees. Computing 21(3): 195-211 (1979) - [j36]Thomas Ottmann, Hans-Werner Six, Derick Wood:
One-sided k-height-balanced trees. Computing 22(4): 283-290 (1979) - [j35]Thomas Ottmann, Hans-Werner Six, Derick Wood:
On the correspondence between AVL trees and brother trees. Computing 23(1): 43-54 (1979) - [j34]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Context-Dependent L Forms. Inf. Control. 42(1): 97-118 (1979) - [j33]Karel Culík II, Derick Wood:
A Mathematical Investigation of Propagating Graph 0L Systems. Inf. Control. 43(1): 50-82 (1979) - [j32]Hermann A. Maurer, Grzegorz Rozenberg, Arto Salomaa, Derick Wood:
Pure interpretations for EOL forms. RAIRO Theor. Informatics Appl. 13(1): 347-362 (1979) - [j31]Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood:
On Non Context-Free Grammar Forms. Math. Syst. Theory 12: 297-324 (1979) - [j30]Arnold L. Rosenberg, Derick Wood, Zvi Galil:
Storage Representations for Tree-Like Data Structures. Math. Syst. Theory 13: 105-130 (1979) - [c6]Derick Wood:
A Survey of Grammar and L Forms-1978. MFCS 1979: 191-200 - [c5]Thomas Ottmann, Derick Wood:
A Uniform Approach to Balanced Binary and Multiway Trees. MFCS 1979: 398-407 - [c4]Arnold L. Rosenberg, Derick Wood, Zvi Galil:
Storage Representations for Tree-Like Data Structures. STOC 1979: 99-107 - [c3]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221 - 1978
- [j29]Seymour Ginsburg, Derick Wood:
Precedence Relations in Grammar Forms. Acta Informatica 11: 79-88 (1978) - [j28]Thomas Ottmann, Hans-Werner Six, Derick Wood:
Right Brother Trees. Commun. ACM 21(9): 769-776 (1978) - [j27]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Uniform Interpretations of L Forms. Inf. Control. 36(2): 157-173 (1978) - [j26]Karel Culík II, Derick Wood:
Speed-varying OL systems. Inf. Sci. 14(2): 161-170 (1978) - [j25]Vijay K. Vaishnavi, Derick Wood:
An approach to a unified theory of grammar and L forms. Inf. Sci. 15(1): 77-94 (1978) - [j24]Hermann A. Maurer, Arto Salomaa, Derick Wood:
Relative Goodness for EOL Forms. RAIRO Theor. Informatics Appl. 12(4): 291-304 (1978) - [j23]Hermann A. Maurer, Arto Salomaa, Derick Wood:
ETOL Forms. J. Comput. Syst. Sci. 16(3): 345-361 (1978) - [j22]Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Good E0L Forms. SIAM J. Comput. 7(2): 158-166 (1978) - [j21]Derick Wood:
One-sided height-balanced search trees. SIGACT News 10(2): 60-62 (1978) - 1977
- [j20]Hermann A. Maurer, Arto Salomaa, Derick Wood:
EOL Forms. Acta Informatica 8: 75-96 (1977) - [j19]Derick Wood:
Two Variations on n-Parallel Finite State Generators. Comput. J. 20(1): 63-67 (1977) - [j18]Derick Wood:
Generalized time-delayed OL languages. Inf. Sci. 12(2): 151-155 (1977) - 1976
- [j17]Hermann A. Maurer, Derick Wood:
On Grammar Forms with Terminal Context. Acta Informatica 6: 397-402 (1976) - [j16]A. Walker, Derick Wood:
Locally Balanced Binary Trees. Comput. J. 19(4): 322-325 (1976) - [j15]Derick Wood:
Iterated a-NGSM Maps and \Gamma Systems. Inf. Control. 32(1): 1-26 (1976) - [j14]Grzegorz Rozenberg, Derick Wood:
A Note on K-Iteration Grammars. Inf. Process. Lett. 4(6): 162-164 (1976) - [j13]Jan van Leeuwen, Derick Wood:
A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. Theor. Comput. Sci. 1(3): 199-214 (1976) - 1975
- [j12]Derick Wood:
A note on Lindenmayer systems, Szilard languages, spectra, and equivalence. Int. J. Parallel Program. 4(1): 53-62 (1975) - [j11]Derick Wood:
Time-delayed OL languages and sequences. Inf. Sci. 8(3): 271-281 (1975) - [j10]Robert D. Rosebrugh, Derick Wood:
Image Theorems for Simple Matrix Languages and n-Parallel Languages. Math. Syst. Theory 8(2): 150-155 (1975) - [c2]Hermann A. Maurer, Derick Wood:
Szilard Languages of L-Systems. Automata, Languages, Development 1975: 251-261 - 1974
- [j9]Grzegorz Rozenberg, Derick Wood:
Generative Models for Parallel Processes. Comput. J. 17(4): 344-348 (1974) - [c1]Derick Wood:
Bounded Parallelism and Regular Languages. L Systems 1974: 292-301 - 1973
- [j8]Robert D. Rosebrugh, Derick Wood:
A Characterization Theorem for n-Parallel Right Linear Languages. J. Comput. Syst. Sci. 7(6): 579-582 (1973) - 1972
- [j7]Derick Wood:
A Factor Theorem for Subsets of a Free Monoid. Inf. Control. 21(1): 21-26 (1972) - 1971
- [j6]Derick Wood:
A Further Note on Top-Down Deterministic Languages. Comput. J. 14(4): 396-403 (1971) - 1970
- [j5]Derick Wood:
The Theory of Left Factored Languages: Part 2. Comput. J. 13(1): 55-62 (1970) - [j4]Derick Wood:
A Generalised Normal Form Theorem for Context-Free Grammars. Comput. J. 13(3): 272-277 (1970)
1960 – 1969
- 1969
- [j3]Derick Wood:
A few more trouble spots in ALGOL 60. Commun. ACM 12(5): 247-248 (1969) - [j2]Derick Wood:
The normal form theorem - another proof. Comput. J. 12(2): 139-147 (1969) - [j1]Derick Wood:
The theory of left factored languages: Part 1. Comput. J. 12(4): 349-356 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
