СТ |
On the Optimality of Holistic Algorithms for Twig Queries |
2003 |
Choi B., Mahoui M., Wood D. |
|
|
|
Lecture Notes in Computer Science |
23.09.2003 |
СТ |
On Predictive Parsing and Extended Context-Free Grammars |
2003 |
Bruggemann-Klein A., Wood D. |
|
|
|
Lecture Notes in Computer Science |
14.03.2003 |
СТ |
Standard Generalized Markup Language: Mathematical and Philosophical Issues |
1995 |
Wood D. |
Lecture Notes in Computer Science |
|
|
Computer Science Today |
01.12.1995 |
СТ |
Foundations for Faster External Sorting |
1994 |
Estivill-Castro V., Wood D. |
|
|
|
Lecture Notes in Computer Science |
11.01.1995 |
СТ |
Complexity of EOL Structural Equivalence |
1994 |
Salomaa K., Wood D., Yu S. |
|
|
|
Lecture Notes in Computer Science |
30.09.1994 |
СТ |
Structural Equivalence and ETOL Grammars |
1993 |
Salomaa K., Wood D., Yu S. |
|
|
|
Lecture Notes in Computer Science |
16.09.1993 |
СТ |
A Survey of Adaptive Sorting Algorithms |
1992 |
Estivill-Castro V., Wood D. |
|
|
|
ACM Computing Surveys |
14.04.1993 |
П |
Optimal Multiway Search Trees |
1978 |
Vaishnavi V. K., Kriegel H. P., Wood D. |
|
|
Univ.Mcmaster |
|
28.02.1992 |
П |
Data Structures for the Rectangle Containment and Enclosure Problems |
1979 |
Vaishnavi V., Wood D. |
|
|
Univ.Mcmaster |
|
26.02.1992 |
П |
An Optimal Worst-Case Algorithm for Reporting Intersections of Rectangles |
1979 |
Bentley J. L., Wood D. |
|
|
Univ.Mcmaster |
|
26.02.1992 |
П |
Colorings and Interpretations: A Connection Between Graphs and Grammar Forms |
1980 |
Maurer H. A., Salomaa A., Wood D. |
|
|
Univ.Mcmaster |
|
26.02.1992 |
П |
1-2 Brother Trees or AVL Trees Revisited |
1979 |
Ottmann T., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
Two papers on AVL and brother trees: On the Correspondes between AVL Trees and Brother Trees |
1979 |
Ottmann T., Six H., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
Two Papers on AVL and Brother Trees: One-sided k-height balanced trees |
1979 |
Ottmann T., Six H., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
On the correspondes between AVL trees and brother trees |
1979 |
Ottmann T., Six H., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
Minimal-cost brother trees |
1979 |
Ottmann T., Rosenberg A., Six H., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
New Results in balanced search trees |
1977 |
Ottmann T., Six H., Wood D. |
|
|
McMaster Univ. |
|
26.09.1991 |
П |
The Construction of Optimal Multiway Search Trees and the Monotonicity Principle |
1979 |
Gotlieb L., Wood D. |
|
|
McMaster Univ. |
|
25.09.1991 |
П |
Dense Multiway Trees |
1979 |
Culik K., Ottmann T., Wood D. |
|
|
McMaster Univ. |
|
25.09.1991 |
П |
The optimal encoding of search trees in single-forward-reference lists |
1978 |
Vaishnavi V., Wood D. |
|
|
McMaster Univ. |
|
25.09.1991 |
СТ |
Bounded delay L codes |
1991 |
Maurer H., Salomaa A., Wood D. |
|
|
|
Theoretical Computer Science |
24.09.1991 |
П |
The Implementation of Insertion and Deletion Algorithms for 1-2 Brother Trees |
1980 |
Ottmann T., Six W., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |
П |
A Comparison of Iterative and Defined Classes of Search Trees |
1980 |
Ottmann T., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |
П |
On B-trees: Routing Schemes and Concurrency |
1980 |
Kwong S., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |
П |
A solution to the concurrent deletion problem for B-trees |
1980 |
Kwong S., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |
П |
T-trees: A variant of B-trees |
1978 |
Kwong S., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |
П |
2-3 Brother Trees |
1978 |
Kriegel P., Vaishnavi V., Wood D. |
|
|
Univ.Mcmaster |
|
03.09.1991 |