Derick Wood
According to our database1,
Derick Wood
authored at least 239 papers
between 1969 and 2009.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at zbmath.org
-
at id.loc.gov
On csauthors.net:
Bibliography
2009
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.
Fundam. Inform., 2009
Operational State Complexity of Prefix-Free Regular Languages.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009
2008
Generalizations of 1-deterministic regular languages.
Inf. Comput., 2008
2007
Prefix-free regular languages and pattern matching.
Theor. Comput. Sci., 2007
Obtaining shorter regular expressions from finite-state automata.
Theor. Comput. Sci., 2007
On the existence of prime decompositions.
Theor. Comput. Sci., 2007
Simple-Regular Expressions and Languages.
Journal of Automata, Languages and Combinatorics, 2007
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.
Fundam. Inform., 2007
Intercode Regular Languages.
Fundam. Inform., 2007
Generalizations of One-Deterministic Regular Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
2006
Infix-free Regular Expressions and Languages.
Int. J. Found. Comput. Sci., 2006
Prime Decompositions of Regular Languages.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
State Complexity of Prefix-Free Regular Languages.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006
Overlap-Free Regular Languages.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
The generalization of generalized automata: expression automata.
Int. J. Found. Comput. Sci., 2005
Shorter Regular Expressions from Finite-State Automata.
Proceedings of the Implementation and Application of Automata, 2005
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.
Proceedings of the Theoretical Aspects of Computing, 2005
A New Linearizing Restriction in the Pattern Matching Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
Simple-Regular Expressions and Languages.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005
Prefix-Free Regular-Expression Matching.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005
2004
Restricted-Orientation Convexity
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-18849-7, 2004
Introduction.
Theor. Comput. Sci., 2004
On the state complexity of reversals of regular languages.
Theor. Comput. Sci., 2004
A characterization of Thompson digraphs.
Discrete Applied Mathematics, 2004
The Generalization of Generalized Automata: Expression Automata.
Proceedings of the Implementation and Application of Automata, 2004
Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata.
Proceedings of the Extreme Markup Languages® 2004 Conference, 2004
Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof.
Proceedings of the Theory Is Forever, 2004
2003
Planar Strong Visibility.
Int. J. Comput. Geometry Appl., 2003
On the Optimality of Holistic Algorithms for Twig Queries.
Proceedings of the Database and Expert Systems Applications, 14th International Conference, 2003
2002
The Regularity of Two-Way Nondeterministic Tree Automata Languages.
Int. J. Found. Comput. Sci., 2002
On Predictive Parsing and Extended Context-Free Grammars.
Proceedings of the Implementation and Application of Automata, 2002
2001
Normal form algorithms for extended context-free grammars.
Theor. Comput. Sci., 2001
SGML and XML Document Grammars and Exceptions.
Inf. Comput., 2001
Block-Deterministic Regular Languages.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001
2000
Caterpillars: A Context Specification Technique.
Markup Languages, 2000
Regularly Extended Two-Way Nondeterministic Tree Automata.
Proceedings of the Implementation and Application of Automata, 2000
A Conceptual Model for XML.
Proceedings of the Digital Documents: Systems and Principles, 2000
1999
Thompson Digraphs: A Characterization.
Proceedings of the Automata Implementation, 1999
Visually Specifying Context.
Proceedings of the Electronic Publishing '99, Redefining the Information Chain - New Ways and Voices: 3rd ICCC/IFIP conference held at the University of Karlskrona/Ronneby, 1999
Caterpillars, context, tree automata and tree pattern matching.
Proceedings of the Developments in Language Theory, 1999
Thompson Languages.
Proceedings of the Jewels are Forever, 1999
The Visual Specification of Context.
Proceedings of the IEEE Forum on Research and Technology Advances in Digital Libraries, 1999
1998
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost.
SIAM J. Comput., 1998
One-Unambiguous Regular Languages.
Inf. Comput., 1998
Extended Context-Free Grammars and Normal Form Algorithms.
Proceedings of the Automata Implementation, 1998
A Conceptual Model for Tables.
Proceedings of the Principles of Digital Document Processing, 4th International Workshop, 1998
Context and Caterpillars and Structured Documents.
Proceedings of the Principles of Digital Document Processing, 4th International Workshop, 1998
1997
WIA and Theory and Practice.
Proceedings of the Automata Implementation, 1997
1996
Structural Equivalence and ET0L Grammars.
Theor. Comput. Sci., 1996
Fundamentals of Restricted-Orientation Convexity.
Inf. Sci., 1996
Relaxed avl trees, main-memory databases and concurrency.
Int. J. Comput. Math., 1996
An adaptive generic sorting algorithm that uses variable partitioning.
Int. J. Comput. Math., 1996
From data representation to data model: Meta-semantic issues in the evolution of SGML.
Computer Standards & Interfaces, 1996
Instruction Computation in Subset Construction.
Proceedings of the Automata Implementation, 1996
Tabular Formatting Problems.
Proceedings of the Principles of Document Processing, Third International Workshop, 1996
SGML and Exceptions.
Proceedings of the Principles of Document Processing, Third International Workshop, 1996
O-Convexity Computing Hulls Approximations and Orientation Sets.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
Three-dimensional Restricted-Orient at Ion Convexity.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
Generalizing Halfspaces.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
Complexity of E0L Structural Equivalence.
ITA, 1995
Binary Trees, Fringe Thickness and Minimum Path Length.
ITA, 1995
Preset two-head automata and morphological analysis of natural language.
Int. J. Comput. Math., 1995
Staircase Visibility and Computation of Kernels.
Algorithmica, 1995
Document Processing, Theory, and Practice (Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
Standard Generalized Markup Language: Mathematical and Philosophical Issues.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995
1994
Balance in AVL Trees and Space Cost of Brother Trees.
Theor. Comput. Sci., 1994
Grail: A C++ Library for Automata and Expressions.
J. Symb. Comput., 1994
Pumping and Pushdown Machines.
ITA, 1994
Updating Approximately Complete Trees.
ITA, 1994
Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees.
Inf. Sci., 1994
Maximal Path Length of Binary Trees.
Discrete Applied Mathematics, 1994
Complexity of E0L Structural Equivalence.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
Foundations for Faster External Sorting (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994
Rediscovering Pushdown Machines.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
1993
Randomized Adative Sorting.
Random Struct. Algorithms, 1993
Pm Numbers, Ambiguity, and Regularity.
ITA, 1993
A Top-Down Updating Algorithm for Weight-Balanced Trees.
Int. J. Found. Comput. Sci., 1993
Right Invariant Metrics and Measures of Presortedness.
Discrete Applied Mathematics, 1993
Interval Heaps.
Comput. J., 1993
Approximate String Matching with Suffix Automata.
Algorithmica, 1993
On Efficient Entreeings.
Acta Inf., 1993
An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning.
Proceedings of the Computing and Information, 1993
Structural Equivalences and ET0L Grammars (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
Dent and Staircase Visibility.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Generalized Kernels of Polygons with Holes.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Data structures, algorithms, and performance.
Addison-Wesley, ISBN: 978-0-201-52148-1, 1993
1992
A Note on the Path Length of Red-Black Trees.
Inf. Process. Lett., 1992
Updating Binary Trees with Constant Linkage Cost.
Int. J. Found. Comput. Sci., 1992
A Survey of Adaptive Sorting Algorithms.
ACM Comput. Surv., 1992
A Generic Adaptive Sorting Algorithm.
Comput. J., 1992
Deterministic Regular Languages.
Proceedings of the STACS 92, 1992
1991
Bounded Delay L Codes.
Theor. Comput. Sci., 1991
Restricted-oriented convex sets.
Inf. Sci., 1991
Defining families of trees with E0L grammars.
Discrete Applied Mathematics, 1991
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
A Relationship Between Self-Organizing Lists and Binary Search Trees.
Proceedings of the Advances in Computing and Information, 1991
Practical Adaptive Sorting.
Proceedings of the Advances in Computing and Information, 1991
Balance in AVL Trees.
Proceedings of the Advances in Computing and Information, 1991
How Costly Can Red-Black Trees Be?
Proceedings of the Advances in Computing and Information, 1991
A Generalization of Staircase Visibility.
Proceedings of the Computational Geometry, 1991
Sorting, Measures of Disorder, and Worst-Case Performance.
Proceedings of the New Results and New Trends in Computer Science, 1991
1990
A Tight Upper Bound for the Path Length of AVL Trees.
Theor. Comput. Sci., 1990
How to Update a Balanced Binary Tree with a Constant Number of Rotations.
Proceedings of the SWAT 90, 1990
Updating Almost Complete Trees or One Level Makes All the Difference.
Proceedings of the STACS 90, 1990
1989
A New Measure of Presortedness
Inf. Comput., October, 1989
On the path length of binary trees.
J. ACM, 1989
SEPARATION in d dimensions or strip mining in asteroid fields.
Computers & Graphics, 1989
A Dynamic Fixed Windowing Problem.
Algorithmica, 1989
On Binary Trees.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
The Path Length of Binary Trees.
Proceedings of the Foundations of Data Organization and Algorithms, 1989
1988
Hole Problems for Rectangles in the Plane.
SIAM J. Discrete Math., 1988
On Rectangular Visibility.
J. Algorithms, 1988
Drawing Trees Nicely with TeX.
Electronic Publishing, 1988
The Orthogonal Convex Skull Problem.
Discrete & Computational Geometry, 1988
Extremal Cost Tree Data Structures.
Proceedings of the SWAT 88, 1988
Implicit Selection.
Proceedings of the SWAT 88, 1988
Voronoi Diagrams Based on General Metrics in the Plane.
Proceedings of the STACS 88, 1988
The increasing role of computer theory in undergraduate curricula.
Proceedings of the 19st SIGCSE Technical Symposium on Computer Science Education, 1988
The Riches of Rectangles.
Proceedings of the Machines, 1988
On the Maximum Path Length of AVL Trees.
Proceedings of the CAAP '88, 1988
1987
The Node Visit Cost of Brother Trees
Inf. Comput., November, 1987
Optimal Computation of Finitely Oriented Convex Hulls
Inf. Comput., February, 1987
Partitioning and separating sets of orthogonal polygons.
Inf. Sci., 1987
Time- and Space-Optimal Contour Computation for a Set of Rectangles.
Inf. Process. Lett., 1987
Concurrency Control in Database Structures with Relaxed Balance.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987
Variations on Visibility.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987
Theory of computation.
Wiley, ISBN: 978-0-471-60351-1, 1987
1986
Space-economical plane-sweep algorithms.
Computer Vision, Graphics, and Image Processing, 1986
The Node Visit Cost of Brother Trees.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986
Optimal Dynamic Solutions for Fixed Windowing Problems.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986
1985
Search Trees and Bubble Memories.
ITA, 1985
Weight-balanced trees are not stratified.
Bulletin of the EATCS, 1985
A fast algorithm for the Boolean masking problem.
Computer Vision, Graphics, and Image Processing, 1985
Purely Top-Down Updating Algorithms for Stratified Search Trees.
Acta Inf., 1985
Computing a convex skill of an orthogonal polygon.
Proceedings of the First Annual Symposium on Computational Geometry, 1985
1984
Finding Rectangle Intersections by Divide-and Conquer.
IEEE Trans. Computers, 1984
Minimal-Cost Brother Trees.
SIAM J. Comput., 1984
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles.
J. Algorithms, 1984
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
ITA, 1984
Systolic Tree Acceptors.
ITA, 1984
An Inverse Homomorphic Characterization of Full Principal AFL.
Inf. Sci., 1984
On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci., 1984
The Contour Problem for Rectilinear Polygons.
Inf. Process. Lett., 1984
Inverse Morphic Equivalence on Languages.
Inf. Process. Lett., 1984
Binary search trees with binary comparison cost.
International Journal of Parallel Programming, 1984
The Complexity and Decidability of Separation.
Proceedings of the Automata, 1984
1983
A Supernormal-Form Theorem for Context-Free Grammars
J. ACM, January, 1983
L Codes and Number Systems.
Theor. Comput. Sci., 1983
Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages.
J. Comput. Syst. Sci., 1983
Direct dynamic structures for some line segment problems.
Computer Vision, Graphics, and Image Processing, 1983
Height-Ratio-Balanced Trees.
Comput. J., 1983
1982
A New Method for Concurrency in B-Trees.
IEEE Trans. Software Eng., 1982
Counting and Reporting Intersections of d-Ranges.
IEEE Trans. Computers, 1982
Finitary and Infinitary Interpretations of Languages.
Mathematical Systems Theory, 1982
Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization.
J. Algorithms, 1982
Dense Hierarchies of Grammatical Families.
J. ACM, 1982
The parenthesis tree.
Inf. Sci., 1982
A Three-Restricted Normal Form Theorem for ET0L Languages.
Inf. Process. Lett., 1982
A Note on Some Tree Similarity Measures.
Inf. Process. Lett., 1982
A comparison of iterative and defined classes of search trees.
International Journal of Parallel Programming, 1982
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
Information and Control, 1982
Self-regulating L Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1982
Stabbing Line Segments.
BIT, 1982
On a Covering Relation for Context-Free Grammars.
Acta Inf., 1982
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982
1981
A Note on Recurrent Words
Information and Control, October, 1981
On Predecessors of Finite Languages
Information and Control, September, 1981
On the Complete Simulation of DOL Schemes and Locally Catenative Schemes
Information and Control, April, 1981
Life and Death in Markov Deterministic Tabled OL Systems
Information and Control, January, 1981
Dense Multiway Trees.
ACM Trans. Database Syst., 1981
Uniform Interpretations of Grammar Forms.
SIAM J. Comput., 1981
Completeness of Context-Free Grammar Forms.
J. Comput. Syst. Sci., 1981
The Measure Problem for Rectangular Ranges in d-Space.
J. Algorithms, 1981
Synchronized EOL Forms Under Uniform Interpretation.
ITA, 1981
Sub-Regular Grammar Forms.
Inf. Process. Lett., 1981
Cut point languages of markov DTOL systems.
International Journal of Parallel Programming, 1981
Decidability and density in two-symbol grammar forms.
Discrete Applied Mathematics, 1981
Colorings and interpretations: a connection between graphs and grammar forms.
Discrete Applied Mathematics, 1981
The implementation of insertion and deletion algorithms for 1-2 brother trees.
Computing, 1981
A Realistic Cost Measure for Binary Search Trees.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981
On Structural Similarity of Context-Free Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981
1980
MSW Spaces
Information and Control, September, 1980
Pure Grammars
Information and Control, January, 1980
Synchronized E0L Forms.
Theor. Comput. Sci., 1980
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles.
IEEE Trans. Computers, 1980
Context-Free Grammar Forms with Strict Interpretations.
J. Comput. Syst. Sci., 1980
Space and time optimal algorithms for a class of rectangle intersection problems.
Inf. Sci., 1980
Dynamization of Decomposable Searching Problems.
Inf. Process. Lett., 1980
1-2 Brother Trees or AVL Trees Revisited.
Comput. J., 1980
The Rectangle Intersection Problem Revisited.
BIT, 1980
Optimum Multiway Search Trees.
Acta Inf., 1980
Context-Free Grammars With Selective Rewriting.
Acta Inf., 1980
On Generators and Generative Capacity of EOL Forms.
Acta Inf., 1980
The Analysis of Search Trees: A Survey.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980
On B-Trees: Routing Schemes and Concurrency.
Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, 1980
Concurrent Operations in Large Ordered Indexes.
Proceedings of the International Symposium on Programming, 1980
Approaches to Concurrency in B-Trees.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980
Grammars and L Forms: An Introduction
Lecture Notes in Computer Science 91, Springer, ISBN: 3-540-10233-7, 1980
1979
A Mathematical Investigation of Propagating Graph 0L Systems
Information and Control, October, 1979
Context-Dependent L Forms
Information and Control, July, 1979
Storage Representations for Tree-Like Data Structures.
Mathematical Systems Theory, 1979
On Non Context-Free Grammar Forms.
Mathematical Systems Theory, 1979
Pure interpretations for EOL forms.
ITA, 1979
Height balanced 2-3 trees.
Computing, 1979
One-sided k-height-balanced trees.
Computing, 1979
On the correspondence between AVL trees and brother trees.
Computing, 1979
Node-Visit Optimal 1-2 Brother Trees.
Proceedings of the Theoretical Computer Science, 1979
Storage Representations for Tree-Like Data Structures
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979
A Survey of Grammar and L Forms-1978.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979
A Uniform Approach to Balanced Binary and Multiway Trees.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979
1978
Uniform Interpretations of L Forms
Information and Control, February, 1978
On Good E0L Forms.
SIAM J. Comput., 1978
ETOL Forms.
J. Comput. Syst. Sci., 1978
Relative Goodness for EOL Forms.
ITA, 1978
An approach to a unified theory of grammar and L forms.
Inf. Sci., 1978
Speed-varying OL systems.
Inf. Sci., 1978
Right Brother Trees.
Commun. ACM, 1978
Precedence Relations in Grammar Forms.
Acta Inf., 1978
1977
Generalized time-delayed OL languages.
Inf. Sci., 1977
Two Variations on n-Parallel Finite State Generators.
Comput. J., 1977
EOL Forms.
Acta Inf., 1977
1976
Iterated a-NGSM Maps and \Gamma Systems
Information and Control, September, 1976
A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.
Theor. Comput. Sci., 1976
A Note on K-Iteration Grammars.
Inf. Process. Lett., 1976
Locally Balanced Binary Trees.
Comput. J., 1976
On Grammar Forms with Terminal Context.
Acta Inf., 1976
1975
Image Theorems for Simple Matrix Languages and n-Parallel Languages.
Mathematical Systems Theory, 1975
Time-delayed OL languages and sequences.
Inf. Sci., 1975
A note on Lindenmayer systems, Szilard languages, spectra, and equivalence.
International Journal of Parallel Programming, 1975
1974
Generative Models for Parallel Processes.
Comput. J., 1974
Bounded Parallelism and Regular Languages.
Proceedings of the L Systems, 1974
1973
A Characterization Theorem for n-Parallel Right Linear Languages.
J. Comput. Syst. Sci., 1973
1972
A Factor Theorem for Subsets of a Free Monoid
Information and Control, August, 1972
1971
A Further Note on Top-Down Deterministic Languages.
Comput. J., 1971
1970
A Generalised Normal Form Theorem for Context-Free Grammars.
Comput. J., 1970
The Theory of Left Factored Languages: Part 2.
Comput. J., 1970
1969
The theory of left factored languages: Part 1.
Comput. J., 1969
The normal form theorem - another proof.
Comput. J., 1969
A few more trouble spots in ALGOL 60.
Commun. ACM, 1969