| 2008 |
|---|
| 15 | EE | Maxime Crochemore,
Lucian Ilie,
W. F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization.
DCC 2008: 482-488 |
| 2000 |
|---|
| 14 | EE | Frantiek Frank,
Ayse Karaman,
W. F. Smyth:
Repetitions in Sturmian strings.
Theor. Comput. Sci. 249(2): 289-303 (2000) |
| 13 | EE | W. F. Smyth:
Repetitive perhaps, but certainly not boring.
Theor. Comput. Sci. 249(2): 343-355 (2000) |
| 1995 |
|---|
| 12 | EE | Nora Hartsfield,
W. F. Smyth:
A family of sparse graphs of large sum number.
Discrete Mathematics 141(1-3): 163-171 (1995) |
| 1993 |
|---|
| 11 | | Peter Eades,
Xuemin Lin,
W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem.
Inf. Process. Lett. 47(6): 319-323 (1993) |
| 1992 |
|---|
| 10 | EE | Lou Caccetta,
W. F. Smyth:
Graphs of maximum diameter.
Discrete Mathematics 102(2): 121-141 (1992) |
| 1991 |
|---|
| 9 | | W. F. Smyth:
Mu-Balancing M-Way Search Trees.
Comput. J. 34(5): 406-414 (1991) |
| 1990 |
|---|
| 8 | EE | K. A. Redish,
W. F. Smyth:
Closed form expressions for the iterated floor function.
Discrete Mathematics 91(3): 317-321 (1990) |
| 1987 |
|---|
| 7 | | K. A. Redish,
W. F. Smyth:
Evaluating Measures of Program Quality.
Comput. J. 30(3): 228-232 (1987) |
| 1986 |
|---|
| 6 | | K. A. Redish,
W. F. Smyth:
Program Style Analysis: A Natural By-Product of Program Compilation.
Commun. ACM 29(2): 126-133 (1986) |
| 1980 |
|---|
| 5 | | W. F. Smyth,
N. W. N. Jayasiri:
The Encouragement of Effective Computer Use in Developing Countries.
IFIP Congress 1980: 885-890 |
| 1976 |
|---|
| 4 | EE | W. F. Smyth,
Ilona Arany:
Another algorithm for reducing bandwidth and profile of a sparse matrix.
AFIPS National Computer Conference 1976: 987-994 |
| 1974 |
|---|
| 3 | | W. F. Smyth,
W. M. L. Benzi:
An Algorithm for Finding the Diameter of a Graph.
IFIP Congress 1974: 500-503 |
| 2 | | W. F. Smyth,
E. Radaceanu:
A Storage Scheme for Hierarchic Structures.
Comput. J. 17(2): 152-156 (1974) |
| 1971 |
|---|
| 1 | | Ilona Arany,
Lajos Szoda,
W. F. Smyth:
An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices.
IFIP Congress (2) 1971: 1246-1250 |
