Derick Wood

Publication Activity (10 Years)

Years Active: 1969-2009
Publications (10 Years): 0

Publications

Yo-Sub Han, Kai Salomaa, Derick Wood
Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics (2009)
Yo-Sub Han, Kai Salomaa, Derick Wood
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Informaticae 90 (1-2) (2009)
Yo-Sub Han, Derick Wood
Generalizations of 1-deterministic regular languages. Inf. Comput. 206 (9-10) (2008)
Yo-Sub Han, Derick Wood
Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. 370 (1-3) (2007)
Yo-Sub Han, Yajun Wang, Derick Wood
Prefix-free regular languages and pattern matching. Theor. Comput. Sci. 389 (1-2) (2007)
Yo-Sub Han, Kai Salomaa, Derick Wood
Intercode Regular Languages. Fundam. Informaticae 76 (1-2) (2007)
Yo-Sub Han, Gerhard Trippen, Derick Wood
Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. 12 (1-2) (2007)
Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
On the existence of prime decompositions. Theor. Comput. Sci. 376 (1-2) (2007)
Yo-Sub Han, Derick Wood
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Fundam. Informaticae 81 (4) (2007)
Yo-Sub Han, Derick Wood
Generalizations of One-Deterministic Regular Languages. LATA (2007)
Yo-Sub Han, Yajun Wang, Derick Wood
Infix-free Regular Expressions and Languages. Int. J. Found. Comput. Sci. 17 (2) (2006)
Yo-Sub Han, Kai Salomaa, Derick Wood
Prime Decompositions of Regular Languages. Developments in Language Theory (2006)
Yo-Sub Han, Kai Salomaa, Derick Wood
State Complexity of Prefix-Free Regular Languages. DCFS (2006)
Yo-Sub Han, Derick Wood
Overlap-Free Regular Languages. COCOON (2006)
Yo-Sub Han, Gerhard Trippen, Derick Wood
Simple-Regular Expressions and Languages. DCFS (2005)
Yo-Sub Han, Derick Wood
The generalization of generalized automata: expression automata. Int. J. Found. Comput. Sci. 16 (3) (2005)
Yo-Sub Han, Derick Wood
Shorter Regular Expressions from Finite-State Automata. CIAA (2005)
Yo-Sub Han, Derick Wood
A New Linearizing Restriction in the Pattern Matching Problem. FCT (2005)
Yo-Sub Han, Yajun Wang, Derick Wood
Prefix-Free Regular-Expression Matching. CPM (2005)
Yo-Sub Han, Derick Wood
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. ICTAC (2005)
Anne Brüggemann-Klein, Derick Wood
Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata. Extreme Markup Languages® (2004)
Yo-Sub Han, Derick Wood
The Generalization of Generalized Automata: Expression Automata. CIAA (2004)
Arto Salomaa, Derick Wood, Sheng Yu
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320 (2-3) (2004)
Bruce W. Watson, Derick Wood
Introduction. Theor. Comput. Sci. 313 (1) (2004)
Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi
A characterization of Thompson digraphs. Discret. Appl. Math. 134 (1-3) (2004)
Kai Salomaa, Derick Wood
Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Theory Is Forever (2004)
Eugene Fink, Derick Wood
Planar Strong Visibility. Int. J. Comput. Geom. Appl. 13 (2) (2003)
Anne Brüggemann-Klein, Derick Wood
On Predictive Parsing and Extended Context-Free Grammars. Computer Science in Perspective (2003)
Byron Choi, Malika Mahoui, Derick Wood
On the Optimality of Holistic Algorithms for Twig Queries. DEXA (2003)
Anne Brüggemann-Klein, Derick Wood
On Predictive Parsing and Extended Context-Free Grammars. CIAA (2002)
Anne Brüggemann-Klein, Derick Wood
The Regularity of Two-Way Nondeterministic Tree Automata Languages. Int. J. Found. Comput. Sci. 13 (1) (2002)
Dora Giammarresi, Rosa Montalbano, Derick Wood
Block-Deterministic Regular Languages. ICTCS (2001)
Jürgen Albert, Dora Giammarresi, Derick Wood
Normal form algorithms for extended context-free grammars. Theor. Comput. Sci. 267 (1-2) (2001)
Pekka Kilpeläinen, Derick Wood
SGML and XML Document Grammars and Exceptions. Inf. Comput. 169 (2) (2001)
Anne Brüggemann-Klein, Derick Wood
Regularly Extended Two-Way Nondeterministic Tree Automata. CIAA (2000)
Anne Brüggemann-Klein, Derick Wood
Caterpillars: A Context Specification Technique. Markup Lang. 2 (1) (2000)
Anne Brüggemann-Klein, Derick Wood
A Conceptual Model for XML. DDEP/PODDP (2000)
Anne Brüggemann-Klein, Stefan Hermann, Derick Wood
The Visual Specification of Context. ADL (1999)
Anne Brüggemann-Klein, Derick Wood
Caterpillars, context, tree automata and tree pattern matching. Developments in Language Theory (1999)
Stefan Hermann, Anne Brüggemann-Klein, Derick Wood
Visually Specifying Context. ELPUB (1999)
Dora Giammarresi, Jean-Luc Ponty, Derick Wood
Thompson Languages. Jewels are Forever (1999)
Dora Giammarresi, Jean-Luc Ponty, Derick Wood
Thompson Digraphs: A Characterization. WIA (1999)
Anne Brüggemann-Klein, Stefan Hermann, Derick Wood
Context and Caterpillars and Structured Documents. PODDP (1998)
Anne Brüggemann-Klein, Derick Wood
One-Unambiguous Regular Languages. Inf. Comput. 140 (2) (1998)
Xinxin Wang, Derick Wood
A Conceptual Model for Tables. PODDP (1998)
Anne Brüggemann-Klein, Derick Wood
One-Unambiguous Regular Languages. Inf. Comput. 142 (2) (1998)
Tony W. Lai, Derick Wood
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM J. Comput. 27 (6) (1998)
Jürgen Albert, Dora Giammarresi, Derick Wood
Extended Context-Free Grammars and Normal Form Algorithms. Workshop on Implementing Automata (1998)
Derick Wood
WIA and Theory and Practice. Workshop on Implementing Automata (1997)
Eugene Fink, Derick Wood
Fundamentals of Restricted-Orientation Convexity. Inf. Sci. 92 (1-4) (1996)
Eugene Fink, Derick Wood
Three-dimensional Restricted-Orient at Ion Convexity. CCCG (1996)
V. Martynchik, Nikolai N. Metelski, Derick Wood
O-Convexity Computing Hulls Approximations and Orientation Sets. CCCG (1996)
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) (1996)
Pekka Kilpeläinen, Derick Wood
SGML and Exceptions. PODP (1996)
Vladimir Estivill-Castro, Derick Wood
An adaptive generic sorting algorithm that uses variable partitioning. Int. J. Comput. Math. 61 (3-4) (1996)
Kai Salomaa, Derick Wood, Sheng Yu
Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164 (1&2) (1996)
Eugene Fink, Derick Wood
Generalizing Halfspaces. CCCG (1996)
Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. 62 (1-2) (1996)
Xinxin Wang, Derick Wood
Tabular Formatting Problems. PODP (1996)
J. Howard Johnson, Derick Wood
Instruction Computation in Subset Construction. Workshop on Implementing Automata (1996)
Kai Salomaa, Derick Wood, Sheng Yu
Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. 29 (6) (1995)
Sven Schuierer, Derick Wood
Staircase Visibility and Computation of Kernels. Algorithmica 14 (1) (1995)
Derick Wood
Document Processing, Theory, and Practice (Abstract). COCOON (1995)
Chet Creider, Jorge Hankamer, Derick Wood
Preset two-head automata and morphological analysis of natural language. Int. J. Comput. Math. 58 (1-2) (1995)
Helen Cameron, Derick Wood
Binary Trees, Fringe Thickness and Minimum Path Length. RAIRO Theor. Informatics Appl. 29 (3) (1995)
Kai Salomaa, Derick Wood, Sheng Yu
Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science (1994)
Vladimir Estivill-Castro, Derick Wood
Foundations for Faster External Sorting (Extended Abstract). FSTTCS (1994)
Kai Salomaa, Derick Wood, Sheng Yu
Pumping and Pushdown Machines. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Darrell R. Raymond, Derick Wood
Grail: A C++ Library for Automata and Expressions. J. Symb. Comput. 17 (4) (1994)
Helen Cameron, Derick Wood
Balance in AVL Trees and Space Cost of Brother Trees. Theor. Comput. Sci. 127 (2) (1994)
Tony W. Lai, Derick Wood
Updating Approximately Complete Trees. RAIRO Theor. Informatics Appl. 28 (5) (1994)
Helen Cameron, Derick Wood
Maximal Path Length of Binary Trees. Discret. Appl. Math. 55 (1) (1994)
Helen Cameron, Derick Wood
Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. Inf. Sci. 77 (1-2) (1994)
Kai Salomaa, Derick Wood, Sheng Yu
Complexity of E0L Structural Equivalence. MFCS (1994)
Derick Wood, Peter Yamamoto
Dent and Staircase Visibility. CCCG (1993)
Vladimir Estivill-Castro, Derick Wood
An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. ICCI (1993)
Paul S. Amerins, Ricardo A. Baeza-Yates, Derick Wood
On Efficient Entreeings. Acta Informatica 30 (3) (1993)
Jan van Leeuwen, Derick Wood
Interval Heaps. Comput. J. 36 (3) (1993)
Esko Ukkonen, Derick Wood
Approximate String Matching with Suffix Automata. Algorithmica 10 (5) (1993)
Helen Cameron, Derick Wood
Pm Numbers, Ambiguity, and Regularity. RAIRO Theor. Informatics Appl. 27 (3) (1993)
Vladimir Estivill-Castro, Derick Wood
Randomized Adative Sorting. Random Struct. Algorithms 4 (1) (1993)
Sven Schuierer, Derick Wood
Generalized Kernels of Polygons with Holes. CCCG (1993)
Kai Salomaa, Derick Wood, Sheng Yu
Structural Equivalences and ET0L Grammars (Extended Abstract). FCT (1993)
Vladimir Estivill-Castro, Heikki Mannila, Derick Wood
Right Invariant Metrics and Measures of Presortedness. Discret. Appl. Math. 42 (1) (1993)
Tony W. Lai, Derick Wood
A Top-Down Updating Algorithm for Weight-Balanced Trees. Int. J. Found. Comput. Sci. 4 (4) (1993)
Anne Brüggemann-Klein, Derick Wood
Deterministic Regular Languages. STACS (1992)
Helen Cameron, Derick Wood
A Note on the Path Length of Red-Black Trees. Inf. Process. Lett. 42 (5) (1992)
Thomas Ottmann, Derick Wood
Updating Binary Trees with Constant Linkage Cost. Int. J. Found. Comput. Sci. 3 (4) (1992)
Vladimir Estivill-Castro, Derick Wood
A Survey of Adaptive Sorting Algorithms. ACM Comput. Surv. 24 (4) (1992)
Vladimir Estivill-Castro, Derick Wood
A Generic Adaptive Sorting Algorithm. Comput. J. 35 (Additional-Papers) (1992)
Vladimir Estivill-Castro, Derick Wood
Practical Adaptive Sorting. ICCI (1991)
Gregory J. E. Rawlins, Derick Wood
Restricted-oriented convex sets. Inf. Sci. 54 (3) (1991)
Thomas Ottmann, Derick Wood
Defining families of trees with E0L grammars. Discret. Appl. Math. 32 (2) (1991)
Tony W. Lai, Derick Wood
A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI (1991)
Vladimir Estivill-Castro, Derick Wood
Sorting, Measures of Disorder, and Worst-Case Performance. New Results and New Trends in Computer Science (1991)
Helen Cameron, Derick Wood
Balance in AVL Trees. ICCI (1991)
Helen Cameron, Derick Wood
How Costly Can Red-Black Trees Be? ICCI (1991)
Sven Schuierer, Gregory J. E. Rawlins, Derick Wood
A Generalization of Staircase Visibility. Workshop on Computational Geometry (1991)
Hermann A. Maurer, Arto Salomaa, Derick Wood
Bounded Delay L Codes. Theor. Comput. Sci. 84 (2) (1991)
Tony W. Lai, Derick Wood
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SODA (1991)

Derick Wood.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Derick Wood