The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Derick Wood: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  206. Operational State Complexity of Prefix-Free Regular Languages. [Citation Graph (, )][DBLP]


  207. Computing a convex skill of an orthogonal polygon. [Citation Graph (, )][DBLP]


  208. Visually Specifying Context. [Citation Graph (, )][DBLP]


  209. Defining families of trees with E0L grammars. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002