Wood, Derick, 1940-....
Wood, Derick
Wood, Derick, 1940-2010
Derick Wood English computer scientist
VIAF ID: 108579575 ( Personal )
Permalink: http://viaf.org/viaf/108579575
Preferred Forms
- 100 0 _ ‡a Derick Wood ‡c English computer scientist
- 200 _ | ‡a Wood ‡b Derick
-
-
-
- 100 1 _ ‡a Wood, Derick
-
- 100 1 _ ‡a Wood, Derick ‡d 1940-
- 100 1 _ ‡a Wood, Derick ‡d 1940-
-
-
- 100 1 0 ‡a Wood, Derick, ‡d 1940-
-
- 100 1 _ ‡a Wood, Derick, ‡d 1940-....
-
-
4xx's: Alternate Name Forms (4)
Works
Title | Sources |
---|---|
An abstract model for tables | |
Adaptive heuristics for binary search trees and constant linkage cost | |
An analysis of 2-3 trees and B-trees | |
Automata implementation : Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997 : revised papers | |
AVL trees, on-the-fly restructuring, and concurrency | |
Balance in AVL trees and space cost of brother trees | |
Checking sets, test sets, rich languages and commutatively-closed languages | |
Computing finitely-oriented polygon intersections | |
The contour problem for rectilinear polygons | |
Data structures, algorithms, and performance | |
Defining families of trees with EOL grammars | |
Dent and staircase visibility | |
Direct dynamic structures for some line segment problems | |
Drawing trees nicely with TEX | |
Dynamical sets of points | |
Electronic style sheets | |
External sorting, initial run creation and nearly sortedness | |
A fast algorithm for Boolean mask operations | |
Finding rectangle intersections by divide-and-conquer | |
From data representation to data model : meta-semantic issues in the evolution of SGML | |
Generalized kernels of polygons with holes | |
Grail : a C++ library for automata and expressions | |
Grail : engineering automata in C++, version 1.0 | |
The Grail papers, version 2.5 | |
Grammar and L forms : an introduction | |
Graphics in Flatland : a case study | |
A half-century of automata theory | |
Height-ratio-balanced trees | |
Hole problems for rectangles in the plane | |
Implementation and application of automata : 6th international conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001 : revised papers | |
Interval heaps | |
Inverse morphic equivalence on languages | |
Markup reconsidered | |
Modelling morphological parsers and grammars | |
Multiple-guard kernels of simple polygons | |
A new approach to competitive list-update algorithms | |
On 1-pass top-down update algorithms for stratified search trees | |
On the path length of binary trees | |
Optimal algorithms to compute the closure of a set of iso-rectangles | |
Paradigms and programming with PASCAL | |
Partitioning and separating sets of orthogonal polygons | |
Principles of Document Processing : Third International Workshop, PODP'96 Palo Alto, California, USA, September 23, 1996 Proceedings | |
Randomized sorting of shuffled monotone sequences | |
Red-black trees are insertion reachable | |
Rediscovering pushdown machines | |
The rehabilitation of transposition | |
Relaxed AVL trees, main-memory databases, and concurrency | |
Restricted-orientation convexity | |
Search trees and bubble memories | |
SEPARATION [Trade Mark] in d dimensions | |
Sorting, measures of disorder, and worst-case performance | |
Space-economical plane-sweep algorithms | |
Structural equivalence and ETOL grammars | |
A survey of adaptive sorting algorithms | |
Theory of computation | |
Unambiguous regular expressions and SGML document grammars | |
Updating approximately complete trees | |
The validation of SGML content models | |
Visibility in semi-convex spaces | |
VLSI Systolic trees as acceptors | |
WIA '96 | |
WIA'97 | |
A worst-case efficient algorithm for hidden line elimination |