The following pages link to Derick Wood (Q596098):
Displayed 50 items.
- ETOL forms (Q1245577) (← links)
- Precedence relations in grammar forms (Q1251075) (← links)
- Height balanced 2-3 trees (Q1251902) (← links)
- One-sided k-height-balanced trees (Q1252718) (← links)
- On the correspondence between AVL trees and brother trees (Q1254854) (← links)
- Generalized halfspaces in restricted-orientation convexity (Q1266488) (← links)
- On efficient entreeings (Q1323334) (← links)
- Insertion reachability, skinny skeletons, and path length in red-black trees (Q1328538) (← links)
- \textit{Grail}: A C++ library for automata and expressions (Q1332332) (← links)
- Maximal path length of binary trees (Q1337670) (← links)
- Balance in AVL trees and space cost of brother trees (Q1342232) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Fundamentals of restricted-orientation convexity (Q1373390) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- Strong restricted-orientation convexity (Q1380849) (← links)
- A characterization theorem for n-parallel right linear languages (Q1394134) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Restricted-orientation convexity. (Q1428352) (← links)
- Calculation of partially convex hulls and approximations for finite planar sets (Q1571224) (← links)
- Multiple-guard kernels of simple polygons (Q1818909) (← links)
- Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
- A new measure of presortedness (Q1822995) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- A decompositin theorem for convexity spaces (Q1826114) (← links)
- Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
- SGML and XML document grammars and exceptions (Q1854453) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- (Q2708971) (← links)
- An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> (Q2710787) (← links)
- Relaxed avl trees, main-memory databases and concurrency (Q2710798) (← links)
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES (Q3021939) (← links)
- (Q3051375) (← links)
- On non context-free grammar forms (Q3051397) (← links)
- A mathematical investigation of propagating graph 0L systems (Q3051400) (← links)
- (Q3138941) (← links)
- Pm numbers, ambiguity, and regularity (Q3142275) (← links)
- Context-dependent L forms (Q3206336) (← links)
- (Q3212686) (← links)
- (Q3217599) (← links)
- On predecessors of finite languages (Q3309085) (← links)
- (Q3318119) (← links)
- (Q3323237) (← links)
- Finding Rectangle Intersections by Divide-and-Conquer (Q3323293) (← links)
- (Q3335001) (← links)
- Binary search trees with binary comparison cost (Q3335002) (← links)
- The multiway trees of hanoi<sup>†</sup> (Q3335009) (← links)
- Optimal algorithms to compute the closure of a set of iso-rectangles (Q3336711) (← links)
- (Q3355224) (← links)
- (Q3429640) (← links)
- (Q3517103) (← links)