Derick Wood - RankMe

249 papers A* 6A 4B 11C 15Misc 2Journal 159Unranked 42

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Informaticae Yo-Sub Han, Kai Salomaa, Derick Wood
2009	—	`conf`	Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics Yo-Sub Han, Kai Salomaa, Derick Wood
2008	J	`jnl`	Generalizations of 1-deterministic regular languages. Inf. Comput. Yo-Sub Han, Derick Wood
2007	C	`conf`	Generalizations of One-Deterministic Regular Languages. LATA Yo-Sub Han, Derick Wood
2007	J	`jnl`	Intercode Regular Languages. Fundam. Informaticae Yo-Sub Han, Kai Salomaa, Derick Wood
2007	J	`jnl`	Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. Yo-Sub Han, Derick Wood
2007	J	`jnl`	On the existence of prime decompositions. Theor. Comput. Sci. Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
2007	J	`jnl`	Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Fundam. Informaticae Yo-Sub Han, Derick Wood
2007	J	`jnl`	Prefix-free regular languages and pattern matching. Theor. Comput. Sci. Yo-Sub Han, Yajun Wang, Derick Wood
2007	J	`jnl`	Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. Yo-Sub Han, Gerhard Trippen, Derick Wood
2006	J	`jnl`	Infix-free Regular Expressions and Languages. Int. J. Found. Comput. Sci. Yo-Sub Han, Yajun Wang, Derick Wood
2006	Misc	`conf`	Overlap-Free Regular Languages. COCOON Yo-Sub Han, Derick Wood
2006	C	`conf`	Prime Decompositions of Regular Languages. Developments in Language Theory Yo-Sub Han, Kai Salomaa, Derick Wood
2006	—	`conf`	State Complexity of Prefix-Free Regular Languages. DCFS Yo-Sub Han, Kai Salomaa, Derick Wood
2005	B	`conf`	A New Linearizing Restriction in the Pattern Matching Problem. FCT Yo-Sub Han, Derick Wood
2005	C	`conf`	Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. ICTAC Yo-Sub Han, Derick Wood
2005	B	`conf`	Prefix-Free Regular-Expression Matching. CPM Yo-Sub Han, Yajun Wang, Derick Wood
2005	C	`conf`	Shorter Regular Expressions from Finite-State Automata. CIAA Yo-Sub Han, Derick Wood
2005	—	`conf`	Simple-Regular Expressions and Languages. DCFS Yo-Sub Han, Gerhard Trippen, Derick Wood
2005	J	`jnl`	The generalization of generalized automata: expression automata. Int. J. Found. Comput. Sci. Yo-Sub Han, Derick Wood
2004	J	`jnl`	A characterization of Thompson digraphs. Discret. Appl. Math. Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi
2004	—	`conf`	Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata. Extreme Markup Languages® Anne Brüggemann-Klein, Derick Wood
2004	J	`jnl`	Introduction. Theor. Comput. Sci. Bruce W. Watson, Derick Wood
2004	J	`jnl`	On the state complexity of reversals of regular languages. Theor. Comput. Sci. Arto Salomaa, Derick Wood, Sheng Yu
2004	—	`book`	Restricted-Orientation Convexity Eugene Fink, Derick Wood
2004	—	`conf`	Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Theory Is Forever Kai Salomaa, Derick Wood
2004	C	`conf`	The Generalization of Generalized Automata: Expression Automata. CIAA Yo-Sub Han, Derick Wood
2003	—	`conf`	On Predictive Parsing and Extended Context-Free Grammars. Computer Science in Perspective Anne Brüggemann-Klein, Derick Wood
2003	C	`conf`	On the Optimality of Holistic Algorithms for Twig Queries. DEXA Byron Choi, Malika Mahoui, Derick Wood
2003	J	`jnl`	Planar Strong Visibility. Int. J. Comput. Geom. Appl. Eugene Fink, Derick Wood
2002	C	`ed.`	Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers CIAA Bruce W. Watson, Derick Wood
2002	C	`conf`	On Predictive Parsing and Extended Context-Free Grammars. CIAA Anne Brüggemann-Klein, Derick Wood
2002	J	`jnl`	The Regularity of Two-Way Nondeterministic Tree Automata Languages. Int. J. Found. Comput. Sci. Anne Brüggemann-Klein, Derick Wood
2001	—	`conf`	Block-Deterministic Regular Languages. ICTCS Dora Giammarresi, Rosa Montalbano, Derick Wood
2001	J	`jnl`	Normal form algorithms for extended context-free grammars. Theor. Comput. Sci. Jürgen Albert, Dora Giammarresi, Derick Wood
2001	J	`jnl`	SGML and XML Document Grammars and Exceptions. Inf. Comput. Pekka Kilpeläinen, Derick Wood
2000	—	`conf`	A Conceptual Model for XML. DDEP/PODDP Anne Brüggemann-Klein, Derick Wood
2000	—	`book`	A Half-Century of Automata Theory: Celebration and Inspiration A Half-Century of Automata Theory Arto Salomaa, Derick Wood, Sheng Yu
2000	J	`jnl`	Caterpillars: A Context Specification Technique. Markup Lang. Anne Brüggemann-Klein, Derick Wood
2000	C	`conf`	Regularly Extended Two-Way Nondeterministic Tree Automata. CIAA Anne Brüggemann-Klein, Derick Wood
1999	C	`conf`	Caterpillars, context, tree automata and tree pattern matching. Developments in Language Theory Anne Brüggemann-Klein, Derick Wood
1999	—	`conf`	The Visual Specification of Context. ADL Anne Brüggemann-Klein, Stefan Hermann, Derick Wood
1999	—	`conf`	Thompson Digraphs: A Characterization. WIA Dora Giammarresi, Jean-Luc Ponty, Derick Wood
1999	—	`conf`	Thompson Languages. Jewels are Forever Dora Giammarresi, Jean-Luc Ponty, Derick Wood
1999	—	`conf`	Visually Specifying Context. ELPUB Stefan Hermann, Anne Brüggemann-Klein, Derick Wood
1998	—	`conf`	A Conceptual Model for Tables. PODDP Xinxin Wang, Derick Wood
1998	J	`jnl`	Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM J. Comput. Tony W. Lai, Derick Wood
1998	—	`ed.`	Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers WIA Derick Wood, Sheng Yu
1998	—	`conf`	Context and Caterpillars and Structured Documents. PODDP Anne Brüggemann-Klein, Stefan Hermann, Derick Wood
1998	—	`conf`	Extended Context-Free Grammars and Normal Form Algorithms. Workshop on Implementing Automata Jürgen Albert, Dora Giammarresi, Derick Wood
1998	J	`jnl`	One-Unambiguous Regular Languages. Inf. Comput. Anne Brüggemann-Klein, Derick Wood
1998	J	`jnl`	One-Unambiguous Regular Languages. Inf. Comput. Anne Brüggemann-Klein, Derick Wood
1998	—	`ed.`	Principles of Digital Document Processing, 4th International Workshop, PODDP'98, Saint Malo, France, March 29-30, 1998, Proceedings PODDP Ethan V. Munson, Charles K. Nicholas, Derick Wood
1997	—	`ed.`	Automata Implementation, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, Revised Papers WIA Darrell R. Raymond, Derick Wood, Sheng Yu
1997	—	`ed.`	Principles of Document Processing, Third International Workshop, PODP'96, Palo Alto, California, USA, September 23, 1996, Proceedings PODP Charles K. Nicholas, Derick Wood
1997	—	`conf`	WIA and Theory and Practice. Workshop on Implementing Automata Derick Wood
1996	J	`jnl`	An adaptive generic sorting algorithm that uses variable partitioning. Int. J. Comput. Math. Vladimir Estivill-Castro, Derick Wood
1996	J	`jnl`	From data representation to data model: Meta-semantic issues in the evolution of SGML. Comput. Stand. Interfaces Darrell R. Raymond, Frank Wm. Tompa, Derick Wood
1996	J	`jnl`	Fundamentals of Restricted-Orientation Convexity. Inf. Sci. Eugene Fink, Derick Wood
1996	—	`conf`	Generalizing Halfspaces. CCCG Eugene Fink, Derick Wood
1996	—	`conf`	Instruction Computation in Subset Construction. Workshop on Implementing Automata J. Howard Johnson, Derick Wood
1996	—	`conf`	O-Convexity Computing Hulls Approximations and Orientation Sets. CCCG V. Martynchik, Nikolai N. Metelski, Derick Wood
1996	J	`jnl`	Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
1996	—	`conf`	SGML and Exceptions. PODP Pekka Kilpeläinen, Derick Wood
1996	J	`jnl`	Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. Kai Salomaa, Derick Wood, Sheng Yu
1996	—	`conf`	Tabular Formatting Problems. PODP Xinxin Wang, Derick Wood
1996	—	`conf`	Three-dimensional Restricted-Orient at Ion Convexity. CCCG Eugene Fink, Derick Wood
1995	J	`jnl`	Binary Trees, Fringe Thickness and Minimum Path Length. RAIRO Theor. Informatics Appl. Helen Cameron, Derick Wood
1995	J	`jnl`	Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. Kai Salomaa, Derick Wood, Sheng Yu
1995	Misc	`conf`	Document Processing, Theory, and Practice (Abstract). COCOON Derick Wood
1995	J	`jnl`	Preset two-head automata and morphological analysis of natural language. Int. J. Comput. Math. Chet Creider, Jorge Hankamer, Derick Wood
1995	J	`jnl`	Staircase Visibility and Computation of Kernels. Algorithmica Sven Schuierer, Derick Wood
1995	—	`ch.`	Standard Generalized Markup Language: Mathematical and Philosophical Issues. Computer Science Today Derick Wood
1994	J	`jnl`	Balance in AVL Trees and Space Cost of Brother Trees. Theor. Comput. Sci. Helen Cameron, Derick Wood
1994	B	`conf`	Complexity of E0L Structural Equivalence. MFCS Kai Salomaa, Derick Wood, Sheng Yu
1994	—	`conf`	Foundations for Faster External Sorting (Extended Abstract). FSTTCS Vladimir Estivill-Castro, Derick Wood
1994	J	`jnl`	Grail: A C++ Library for Automata and Expressions. J. Symb. Comput. Darrell R. Raymond, Derick Wood
1994	J	`jnl`	Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. Inf. Sci. Helen Cameron, Derick Wood
1994	J	`jnl`	Maximal Path Length of Binary Trees. Discret. Appl. Math. Helen Cameron, Derick Wood
1994	J	`jnl`	Pumping and Pushdown Machines. RAIRO Theor. Informatics Appl. Kai Salomaa, Derick Wood, Sheng Yu
1994	—	`conf`	Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science Kai Salomaa, Derick Wood, Sheng Yu
1994	J	`jnl`	Updating Approximately Complete Trees. RAIRO Theor. Informatics Appl. Tony W. Lai, Derick Wood
1993	J	`jnl`	A Top-Down Updating Algorithm for Weight-Balanced Trees. Int. J. Found. Comput. Sci. Tony W. Lai, Derick Wood
1993	C	`conf`	An Adaptive Generic Sorting Algorithm That Uses Variable Partitioning. ICCI Vladimir Estivill-Castro, Derick Wood
1993	J	`jnl`	Approximate String Matching with Suffix Automata. Algorithmica Esko Ukkonen, Derick Wood
1993	—	`book`	Data structures, algorithms, and performance. Derick Wood
1993	—	`conf`	Dent and Staircase Visibility. CCCG Derick Wood, Peter Yamamoto
1993	—	`conf`	Generalized Kernels of Polygons with Holes. CCCG Sven Schuierer, Derick Wood
1993	J	`jnl`	Interval Heaps. Comput. J. Jan van Leeuwen, Derick Wood
1993	J	`jnl`	On Efficient Entreeings. Acta Informatica Paul S. Amerins, Ricardo A. Baeza-Yates, Derick Wood
1993	J	`jnl`	Pm Numbers, Ambiguity, and Regularity. RAIRO Theor. Informatics Appl. Helen Cameron, Derick Wood
1993	J	`jnl`	Randomized Adative Sorting. Random Struct. Algorithms Vladimir Estivill-Castro, Derick Wood
1993	J	`jnl`	Right Invariant Metrics and Measures of Presortedness. Discret. Appl. Math. Vladimir Estivill-Castro, Heikki Mannila, Derick Wood
1993	B	`conf`	Structural Equivalences and ET0L Grammars (Extended Abstract). FCT Kai Salomaa, Derick Wood, Sheng Yu
1992	J	`jnl`	A Generic Adaptive Sorting Algorithm. Comput. J. Vladimir Estivill-Castro, Derick Wood
1992	J	`jnl`	A Note on the Path Length of Red-Black Trees. Inf. Process. Lett. Helen Cameron, Derick Wood
1992	J	`jnl`	A Survey of Adaptive Sorting Algorithms. ACM Comput. Surv. Vladimir Estivill-Castro, Derick Wood
1992	A	`conf`	Deterministic Regular Languages. STACS Anne Brüggemann-Klein, Derick Wood
1992	J	`jnl`	Updating Binary Trees with Constant Linkage Cost. Int. J. Found. Comput. Sci. Thomas Ottmann, Derick Wood
1991	A*	`conf`	A Generalization of Staircase Visibility. Workshop on Computational Geometry Sven Schuierer, Gregory J. E. Rawlins, Derick Wood
1991	C	`conf`	A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI Tony W. Lai, Derick Wood
1991	A*	`conf`	Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SODA Tony W. Lai, Derick Wood
1991	C	`conf`	Balance in AVL Trees. ICCI Helen Cameron, Derick Wood
1991	J	`jnl`	Bounded Delay L Codes. Theor. Comput. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1991	J	`jnl`	Defining families of trees with E0L grammars. Discret. Appl. Math. Thomas Ottmann, Derick Wood
1991	C	`conf`	How Costly Can Red-Black Trees Be? ICCI Helen Cameron, Derick Wood
1991	C	`conf`	Practical Adaptive Sorting. ICCI Vladimir Estivill-Castro, Derick Wood
1991	J	`jnl`	Restricted-oriented convex sets. Inf. Sci. Gregory J. E. Rawlins, Derick Wood
1991	—	`conf`	Sorting, Measures of Disorder, and Worst-Case Performance. New Results and New Trends in Computer Science Vladimir Estivill-Castro, Derick Wood
1990	J	`jnl`	A Tight Upper Bound for the Path Length of AVL Trees. Theor. Comput. Sci. Rolf Klein, Derick Wood
1990	—	`conf`	How to Update a Balanced Binary Tree with a Constant Number of Rotations. SWAT Thomas Ottmann, Derick Wood
1990	A	`conf`	Updating Almost Complete Trees or One Level Makes All the Difference. STACS Tony W. Lai, Derick Wood
1989	J	`jnl`	A Dynamic Fixed Windowing Problem. Algorithmica Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
1989	J	`jnl`	A New Measure of Presortedness Inf. Comput. Vladimir Estivill-Castro, Derick Wood
1989	—	`conf`	On Binary Trees. IFIP Congress Rolf Klein, Derick Wood
1989	J	`jnl`	On the path length of binary trees. J. ACM Rolf Klein, Derick Wood
1989	J	`jnl`	SEPARATION in d dimensions or strip mining in asteroid fields. Comput. Graph. Michel P. Devine, Derick Wood
1989	—	`conf`	The Path Length of Binary Trees. FODO Rolf Klein, Derick Wood
1988	J	`jnl`	Drawing Trees Nicely with TeX. Electron. Publ. Anne Brüggemann-Klein, Derick Wood
1988	—	`conf`	Extremal Cost Tree Data Structures. SWAT Derick Wood
1988	J	`jnl`	Hole Problems for Rectangles in the Plane. SIAM J. Discret. Math. Gregory J. E. Rawlins, Peter Widmayer, Derick Wood
1988	—	`conf`	Implicit Selection. SWAT Tony W. Lai, Derick Wood
1988	J	`jnl`	On Rectangular Visibility. J. Algorithms Mark H. Overmars, Derick Wood
1988	—	`conf`	On the Maximum Path Length of AVL Trees. CAAP Rolf Klein, Derick Wood
1988	J	`jnl`	The Orthogonal Convex Skull Problem. Discret. Comput. Geom. Derick Wood, Chee-Keng Yap
1988	—	`conf`	The Riches of Rectangles. IMYCS Derick Wood
1988	A	`conf`	The increasing role of computer theory in undergraduate curricula. SIGCSE Donald J. Bagert, Daniel I. A. Cohen, Gary Ford, Donald K. Friesen, Daniel D. McCracken, Derick Wood
1988	A	`conf`	Voronoi Diagrams Based on General Metrics in the Plane. STACS Rolf Klein, Derick Wood
1987	A*	`conf`	Concurrency Control in Database Structures with Relaxed Balance. PODS Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
1987	J	`jnl`	Optimal Computation of Finitely Oriented Convex Hulls Inf. Comput. Gregory J. E. Rawlins, Derick Wood
1987	J	`jnl`	Partitioning and separating sets of orthogonal polygons. Inf. Sci. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1987	J	`jnl`	The Node Visit Cost of Brother Trees Inf. Comput. Rolf Klein, Derick Wood
1987	—	`book`	Theory of computation. Derick Wood
1987	J	`jnl`	Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. Peter Widmayer, Derick Wood
1987	—	`conf`	Variations on Visibility. SCG J. Ian Munro, Mark H. Overmars, Derick Wood
1986	—	`conf`	Optimal Dynamic Solutions for Fixed Windowing Problems. SCG Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
1986	J	`jnl`	Space-economical plane-sweep algorithms. Comput. Vis. Graph. Image Process. Thomas Ottmann, Derick Wood
1986	B	`conf`	The Node Visit Cost of Brother Trees. WG Rolf Klein, Derick Wood
1985	J	`jnl`	A fast algorithm for the Boolean masking problem. Comput. Vis. Graph. Image Process. Thomas Ottmann, Peter Widmayer, Derick Wood
1985	—	`conf`	Computing a convex skill of an orthogonal polygon. SCG Derick Wood, Chee-Keng Yap
1985	J	`jnl`	Purely Top-Down Updating Algorithms for Stratified Search Trees. Acta Informatica Thomas Ottmann, Michael Schrapp, Derick Wood
1985	J	`jnl`	Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. Philippe Flajolet, Thomas Ottmann, Derick Wood
1985	J	`jnl`	Weight-balanced trees are not stratified. Bull. EATCS Thomas Ottmann, Michael Schrapp, Derick Wood
1984	J	`jnl`	An Inverse Homomorphic Characterization of Full Principal AFL. Inf. Sci. Takashi Yokomori, Derick Wood
1984	J	`jnl`	Binary search trees with binary comparison cost. Int. J. Parallel Program. Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984	J	`jnl`	Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood
1984	J	`jnl`	Finding Rectangle Intersections by Divide-and Conquer. IEEE Trans. Computers Ralf Hartmut Güting, Derick Wood
1984	J	`jnl`	Inverse Morphic Equivalence on Languages. Inf. Process. Lett. Juhani Karhumäki, Derick Wood
1984	J	`jnl`	Minimal-Cost Brother Trees. SIAM J. Comput. Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984	J	`jnl`	On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1984	J	`jnl`	Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms Eljas Soisalon-Soininen, Derick Wood
1984	J	`jnl`	Systolic Tree Acceptors. RAIRO Theor. Informatics Appl. Karel Culík II, Arto Salomaa, Derick Wood
1984	A*	`conf`	The Complexity and Decidability of Separation. ICALP Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1984	J	`jnl`	The Contour Problem for Rectilinear Polygons. Inf. Process. Lett. Derick Wood
1983	J	`jnl`	A Supernormal-Form Theorem for Context-Free Grammars J. ACM Hermann A. Maurer, Arto Salomaa, Derick Wood
1983	J	`jnl`	Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages. J. Comput. Syst. Sci. Jürgen Albert, Derick Wood
1983	J	`jnl`	Direct dynamic structures for some line segment problems. Comput. Vis. Graph. Image Process. Gaston H. Gonnet, J. Ian Munro, Derick Wood
1983	J	`jnl`	Height-Ratio-Balanced Trees. Comput. J. Gaston H. Gonnet, Henk J. Olivié, Derick Wood
1983	J	`jnl`	L Codes and Number Systems. Theor. Comput. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1982	J	`jnl`	A New Method for Concurrency in B-Trees. IEEE Trans. Software Eng. Yat-Sang Kwong, Derick Wood
1982	J	`jnl`	A Note on Some Tree Similarity Measures. Inf. Process. Lett. Karel Culík II, Derick Wood
1982	J	`jnl`	A Three-Restricted Normal Form Theorem for ET0L Languages. Inf. Process. Lett. Takashi Yokomori, Derick Wood, Klaus-Jörn Lange
1982	J	`jnl`	A comparison of iterative and defined classes of search trees. Int. J. Parallel Program. Thomas Ottmann, Derick Wood
1982	A*	`conf`	An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS Eljas Soisalon-Soininen, Derick Wood
1982	J	`jnl`	Counting and Reporting Intersections of IEEE Trans. Computers Hans-Werner Six, Derick Wood
1982	J	`jnl`	Dense Hierarchies of Grammatical Families. J. ACM Hermann A. Maurer, Arto Salomaa, Derick Wood
1982	J	`jnl`	Finitary and Infinitary Interpretations of Languages. Math. Syst. Theory Hermann A. Maurer, Arto Salomaa, Derick Wood
1982	J	`jnl`	On a Covering Relation for Context-Free Grammars. Acta Informatica Eljas Soisalon-Soininen, Derick Wood
1982	J	`jnl`	Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. J. Algorithms Vijay K. Vaishnavi, Derick Wood
1982	J	`jnl`	Self-regulating L Systems. J. Inf. Process. Cybern. Helmut Jürgensen, Derick Wood
1982	J	`jnl`	Stabbing Line Segments. BIT Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
1982	J	`jnl`	The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees Inf. Control. Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood
1982	J	`jnl`	The parenthesis tree. Inf. Sci. Ralf Hartmut Güting, Derick Wood
1981	J	`jnl`	A Note on Recurrent Words Inf. Control. Karel Culík II, Derick Wood
1981	B	`conf`	A Realistic Cost Measure for Binary Search Trees. WG Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1981	J	`jnl`	Colorings and interpretations: a connection between graphs and grammar forms. Discret. Appl. Math. Hermann A. Maurer, Arto Salomaa, Derick Wood
1981	J	`jnl`	Completeness of Context-Free Grammar Forms. J. Comput. Syst. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1981	J	`jnl`	Cut point languages of markov DTOL systems. Int. J. Parallel Program. Helmut Jürgensen, David E. Matthews, Derick Wood
1981	J	`jnl`	Decidability and density in two-symbol grammar forms. Discret. Appl. Math. Hermann A. Maurer, Arto Salomaa, Derick Wood
1981	J	`jnl`	Dense Multiway Trees. ACM Trans. Database Syst. Karel Culík II, Thomas Ottmann, Derick Wood
1981	J	`jnl`	Life and Death in Markov Deterministic Tabled OL Systems Inf. Control. Helmut Jürgensen, David E. Matthews, Derick Wood
1981	J	`jnl`	On Predecessors of Finite Languages Inf. Control. Hermann A. Maurer, Arto Salomaa, Derick Wood
1981	B	`conf`	On Structural Similarity of Context-Free Grammars. MFCS Eljas Soisalon-Soininen, Derick Wood
1981	J	`jnl`	On the Complete Simulation of DOL Schemes and Locally Catenative Schemes Inf. Control. Youichi Kobuchi, Derick Wood
1981	J	`jnl`	Sub-Regular Grammar Forms. Inf. Process. Lett. Thomas Ottmann, Arto Salomaa, Derick Wood
1981	J	`jnl`	Synchronized EOL Forms Under Uniform Interpretation. RAIRO Theor. Informatics Appl. Hermann A. Maurer, Arto Salomaa, Derick Wood
1981	J	`jnl`	The Measure Problem for Rectangular Ranges in d-Space. J. Algorithms Jan van Leeuwen, Derick Wood
1981	J	`jnl`	The implementation of insertion and deletion algorithms for 1-2 brother trees. Computing Thomas Ottmann, Hans-Werner Six, Derick Wood
1981	J	`jnl`	Uniform Interpretations of Grammar Forms. SIAM J. Comput. Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	J	`jnl`	1-2 Brother Trees or AVL Trees Revisited. Comput. J. Thomas Ottmann, Derick Wood
1980	J	`jnl`	An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. IEEE Trans. Computers Jon Louis Bentley, Derick Wood
1980	B	`conf`	Approaches to Concurrency in B-Trees. MFCS Yat-Sang Kwong, Derick Wood
1980	—	`conf`	Concurrent Operations in Large Ordered Indexes. Symposium on Programming Yat-Sang Kwong, Derick Wood
1980	J	`jnl`	Context-Free Grammar Forms with Strict Interpretations. J. Comput. Syst. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	J	`jnl`	Context-Free Grammars With Selective Rewriting. Acta Informatica Grzegorz Rozenberg, Derick Wood
1980	J	`jnl`	Dynamization of Decomposable Searching Problems. Inf. Process. Lett. Jan van Leeuwen, Derick Wood
1980	—	`book`	Grammars and L Forms: An Introduction Derick Wood
1980	J	`jnl`	MSW Spaces Inf. Control. Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	—	`conf`	On B-Trees: Routing Schemes and Concurrency. SIGMOD Conference Yat-Sang Kwong, Derick Wood
1980	J	`jnl`	On Generators and Generative Capacity of EOL Forms. Acta Informatica Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	J	`jnl`	Optimum Multiway Search Trees. Acta Informatica Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood
1980	J	`jnl`	Pure Grammars Inf. Control. Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	J	`jnl`	Space and time optimal algorithms for a class of rectangle intersection problems. Inf. Sci. Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood
1980	J	`jnl`	Synchronized E0L Forms. Theor. Comput. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1980	B	`conf`	The Analysis of Search Trees: A Survey. WG Thomas Ottmann, Hans-Werner Six, Derick Wood
1980	J	`jnl`	The Rectangle Intersection Problem Revisited. BIT Hans-Werner Six, Derick Wood
1979	J	`jnl`	A Mathematical Investigation of Propagating Graph 0L Systems Inf. Control. Karel Culík II, Derick Wood
1979	B	`conf`	A Survey of Grammar and L Forms-1978. MFCS Derick Wood
1979	B	`conf`	A Uniform Approach to Balanced Binary and Multiway Trees. MFCS Thomas Ottmann, Derick Wood
1979	J	`jnl`	Context-Dependent L Forms Inf. Control. Hermann A. Maurer, Arto Salomaa, Derick Wood
1979	J	`jnl`	Height balanced 2-3 trees. Computing Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood
1979	—	`conf`	Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1979	J	`jnl`	On Non Context-Free Grammar Forms. Math. Syst. Theory Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood
1979	J	`jnl`	On the correspondence between AVL trees and brother trees. Computing Thomas Ottmann, Hans-Werner Six, Derick Wood
1979	J	`jnl`	One-sided k-height-balanced trees. Computing Thomas Ottmann, Hans-Werner Six, Derick Wood
1979	J	`jnl`	Pure interpretations for EOL forms. RAIRO Theor. Informatics Appl. Hermann A. Maurer, Grzegorz Rozenberg, Arto Salomaa, Derick Wood
1979	A*	`conf`	Storage Representations for Tree-Like Data Structures STOC Arnold L. Rosenberg, Derick Wood, Zvi Galil
1979	J	`jnl`	Storage Representations for Tree-Like Data Structures. Math. Syst. Theory Arnold L. Rosenberg, Derick Wood, Zvi Galil
1978	J	`jnl`	An approach to a unified theory of grammar and L forms. Inf. Sci. Vijay K. Vaishnavi, Derick Wood
1978	J	`jnl`	ETOL Forms. J. Comput. Syst. Sci. Hermann A. Maurer, Arto Salomaa, Derick Wood
1978	J	`jnl`	On Good E0L Forms. SIAM J. Comput. Hermann A. Maurer, Arto Salomaa, Derick Wood
1978	J	`jnl`	One-sided height-balanced search trees. SIGACT News Derick Wood
1978	J	`jnl`	Precedence Relations in Grammar Forms. Acta Informatica Seymour Ginsburg, Derick Wood
1978	J	`jnl`	Relative Goodness for EOL Forms. RAIRO Theor. Informatics Appl. Hermann A. Maurer, Arto Salomaa, Derick Wood
1978	J	`jnl`	Right Brother Trees. Commun. ACM Thomas Ottmann, Hans-Werner Six, Derick Wood
1978	J	`jnl`	Speed-varying Inf. Sci. Karel Culík II, Derick Wood
1978	J	`jnl`	Uniform Interpretations of L Forms Inf. Control. Hermann A. Maurer, Arto Salomaa, Derick Wood
1977	J	`jnl`	EOL Forms. Acta Informatica Hermann A. Maurer, Arto Salomaa, Derick Wood
1977	J	`jnl`	Generalized time-delayed OL languages. Inf. Sci. Derick Wood
1977	J	`jnl`	Two Variations on n-Parallel Finite State Generators. Comput. J. Derick Wood
1976	J	`jnl`	A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families. Theor. Comput. Sci. Jan van Leeuwen, Derick Wood
1976	J	`jnl`	A Note on K-Iteration Grammars. Inf. Process. Lett. Grzegorz Rozenberg, Derick Wood
1976	J	`jnl`	Iterated a-NGSM Maps and \Gamma Systems Inf. Control. Derick Wood
1976	J	`jnl`	Locally Balanced Binary Trees. Comput. J. A. Walker, Derick Wood
1976	J	`jnl`	On Grammar Forms with Terminal Context. Acta Informatica Hermann A. Maurer, Derick Wood
1975	J	`jnl`	A note on Lindenmayer systems, Szilard languages, spectra, and equivalence. Int. J. Parallel Program. Derick Wood
1975	J	`jnl`	Image Theorems for Simple Matrix Languages and n-Parallel Languages. Math. Syst. Theory Robert D. Rosebrugh, Derick Wood
1975	—	`conf`	Szilard Languages of L-Systems. Automata, Languages, Development Hermann A. Maurer, Derick Wood
1975	J	`jnl`	Time-delayed OL languages and sequences. Inf. Sci. Derick Wood
1974	—	`conf`	Bounded Parallelism and Regular Languages. L Systems Derick Wood
1974	J	`jnl`	Generative Models for Parallel Processes. Comput. J. Grzegorz Rozenberg, Derick Wood
1973	J	`jnl`	A Characterization Theorem for n-Parallel Right Linear Languages. J. Comput. Syst. Sci. Robert D. Rosebrugh, Derick Wood
1972	J	`jnl`	A Factor Theorem for Subsets of a Free Monoid Inf. Control. Derick Wood
1971	J	`jnl`	A Further Note on Top-Down Deterministic Languages. Comput. J. Derick Wood
1970	J	`jnl`	A Generalised Normal Form Theorem for Context-Free Grammars. Comput. J. Derick Wood
1970	J	`jnl`	The Theory of Left Factored Languages: Part 2. Comput. J. Derick Wood
1969	J	`jnl`	A few more trouble spots in ALGOL 60. Commun. ACM Derick Wood
1969	J	`jnl`	The normal form theorem - another proof. Comput. J. Derick Wood
1969	J	`jnl`	The theory of left factored languages: Part 1. Comput. J. Derick Wood