How Costly Can Red-Black Trees Be? - Helen Cameron; Derick Wood (ICCI, 1991)

Balance in AVL Trees. - Helen Cameron; Derick Wood (ICCI, 1991)

A Note on the Path Length of Red-Black Trees. - Helen Cameron; Derick Wood (Inf. Process. Lett., 1992)

Pm Numbers, Ambiguity, and Regularity. - Helen Cameron; Derick Wood (RAIRO Theor. Informatics Appl., 1993)

Maximal Path Length of Binary Trees. - Helen Cameron; Derick Wood (Discret. Appl. Math., 1994)

Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees. - Helen Cameron; Derick Wood (Inf. Sci., 1994)

Balance in AVL Trees and Space Cost of Brother Trees. - Helen Cameron; Derick Wood (Theor. Comput. Sci., 1994)

Binary Trees, Fringe Thickness and Minimum Path Length. - Helen Cameron; Derick Wood (RAIRO Theor. Informatics Appl., 1995)

Synchronization in Multimedia Documents. - Peter R. King; Helen Cameron; Howard Bowman; Simon J. Thompson (EP, 1998)

Fringe Thickness and Maximum Path Length of Binary Trees. - Helen Cameron (Discret. Appl. Math., 1998)

Constructing Red-Black Tree Shapes. - Andrea Mantler; Helen Cameron (Int. J. Found. Comput. Sci., 2002)

Mexitl: Multimedia in Executable Interval Temporal Logic. - Howard Bowman; Helen Cameron; Peter R. King; Simon J. Thompson (Formal Methods Syst. Des., 2003)

Modeling Reactive Multimedia: Events and Behaviors. - Helen Cameron; Peter R. King; Simon J. Thompson (Multim. Tools Appl., 2003)

Modelling Reactive Multimedia: Design and Authoring. - Simon J. Thompson; Peter R. King; Helen Cameron (Multim. Tools Appl., 2005)