| 2002 |
|---|
| 7 | EE | Wayne M. Dymàcek,
Matthew Koerlin,
Jean-Guy Speton,
Tom Whaley,
Jennifer Yanulavich:
Disconnected Complements of Steinhaus graphs.
Electronic Notes in Discrete Mathematics 11: 218-232 (2002) |
| 1999 |
|---|
| 6 | EE | Gerard J. Chang,
Bhaskar DasGupta,
Wayne M. Dymàcek,
Martin Fürer,
Matthew Koerlin,
Yueh-Shin Lee,
Tom Whaley:
Characterizations of bipartite Steinhaus graphs.
Discrete Mathematics 199(1-3): 11-25 (1999) |
| 1998 |
|---|
| 5 | EE | Tom Whaley,
Anurag Chandra,
Noah Egorin,
Wayne M. Dymàcek:
Parallel searches for hereditary node properties in binary trees.
ACM Southeast Regional Conference 1998: 280-282 |
| 1995 |
|---|
| 4 | EE | Wayne M. Dymàcek,
Tom Whaley:
Generating strings for bipartite Steinhaus graphs.
Discrete Mathematics 141(1-3): 95-107 (1995) |
| 1994 |
|---|
| 3 | EE | Henry MacKay Walker,
Kim B. Bruce,
James Bradley,
Tom Whaley:
Describing the CS forest to undergraduates (abstract).
SIGCSE 1994: 369-370 |
| 1992 |
|---|
| 2 | | Tom Whaley:
Alternative Developments of Cyclic-Permutation Algorithms.
Inf. Process. Lett. 41(5): 239-241 (1992) |
| 1991 |
|---|
| 1 | EE | Tom Whaley:
A framework for program verification in the context of linked structures and pointer variables.
SIGCSE 1991: 119-123 |
