Tom Whaley

According to our database, Tom Whaley authored at least 8 papers between 1991 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Disconnected Complements of Steinhaus graphs.

Wayne M. Dymàcek, Matthew Koerlin, Jean-Guy Speton, Tom Whaley, Jennifer Yanulavich

Electron. Notes Discret. Math., 2002

1999

Characterizations of bipartite Steinhaus graphs.

Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley

Discret. Math., 1999

1998

Parallel searches for hereditary node properties in binary trees.

Tom Whaley, Anurag Chandra, Noah Egorin, Wayne M. Dymàcek

Proceedings of the 36th Annual ACM Southeast Regional Conference, 1998

1995

Generating strings for bipartite Steinhaus graphs.

Wayne M. Dymàcek, Tom Whaley

Discret. Math., 1995

1994

Describing the CS forest to undergraduates (abstract).

Henry MacKay Walker, Kim B. Bruce, James Bradley, Tom Whaley

Proceedings of the 25th SIGCSE Technical Symposium on Computer Science Education, 1994

1992

Alternative Developments of Cyclic-Permutation Algorithms.

Tom Whaley

Inf. Process. Lett., 1992

A Case Study in ADT Implementation Verification.

Tom Whaley

Comput. Sci. Educ., 1992

1991

A framework for program verification in the context of linked structures and pointer variables.

Tom Whaley

Proceedings of the 22nd SIGCSE Technical Symposium on Computer Science Education, 1991