2005 |
14 | EE | Simon J. Thompson,
Peter R. King,
Helen Cameron:
Modelling Reactive Multimedia: Design and Authoring.
Multimedia Tools Appl. 27(1): 23-52 (2005) |
2003 |
13 | | Howard Bowman,
Helen Cameron,
Peter R. King,
Simon J. Thompson:
Mexitl: Multimedia in Executable Interval Temporal Logic.
Formal Methods in System Design 22(1): 5-38 (2003) |
12 | | Helen Cameron,
Peter R. King,
Simon J. Thompson:
Modeling Reactive Multimedia: Events and Behaviors.
Multimedia Tools Appl. 19(1): 53-77 (2003) |
2002 |
11 | EE | Andrea Mantler,
Helen Cameron:
Constructing Red-Black Tree Shapes.
Int. J. Found. Comput. Sci. 13(6): 837-863 (2002) |
1998 |
10 | EE | Peter R. King,
Helen Cameron,
Howard Bowman,
Simon J. Thompson:
Synchronization in Multimedia Documents.
EP 1998: 355-369 |
9 | EE | Helen Cameron:
Fringe Thickness and Maximum Path Length of Binary Trees.
Discrete Applied Mathematics 89(1-3): 75-97 (1998) |
1995 |
8 | | Helen Cameron,
Derick Wood:
Binary Trees, Fringe Thickness and Minimum Path Length.
ITA 29(3): 171-191 (1995) |
1994 |
7 | EE | Helen Cameron,
Derick Wood:
Maximal Path Length of Binary Trees.
Discrete Applied Mathematics 55(1): 15-35 (1994) |
6 | | Helen Cameron,
Derick Wood:
Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees.
Inf. Sci. 77(1-2): 141-152 (1994) |
5 | | Helen Cameron,
Derick Wood:
Balance in AVL Trees and Space Cost of Brother Trees.
Theor. Comput. Sci. 127(2): 199-228 (1994) |
1993 |
4 | | Helen Cameron,
Derick Wood:
Pm Numbers, Ambiguity, and Regularity.
ITA 27(3): 261-275 (1993) |
1992 |
3 | | Helen Cameron,
Derick Wood:
A Note on the Path Length of Red-Black Trees.
Inf. Process. Lett. 42(5): 287-292 (1992) |
1991 |
2 | | Helen Cameron,
Derick Wood:
How Costly Can Red-Black Trees Be?
ICCI 1991: 117-126 |
1 | | Helen Cameron,
Derick Wood:
Balance in AVL Trees.
ICCI 1991: 127-133 |