 | 2007 |
|---|
| 10 |       | Frank Rubin:
An Improved Method for Finding Knight Covers.
Ars Comb. 82: (2007) |
| 2003 |
|---|
| 9 | | Frank Rubin:
Improved Knight Coverings.
Ars Comb. 69: (2003) |
| 1981 |
|---|
| 8 | | Frank Rubin:
Further Comments on "An Optimal Solution for the Channel-Assignment Problem".
IEEE Trans. Computers 30(6): 455 (1981) |
| 1979 |
|---|
| 7 | | Frank Rubin:
Decrypting a Stream Cipher Based on J-K Flop-Flops.
IEEE Trans. Computers 28(7): 483-487 (1979) |
| 1976 |
|---|
| 6 |  | Frank Rubin:
Partition of Integers.
ACM Trans. Math. Softw. 2(4): 364-374 (1976) |
| 5 | | Frank Rubin:
Experiments in Text File Compression.
Commun. ACM 19(11): 617-623 (1976) |
| 4 | | Frank Rubin:
Generation of Nonparametric Curves.
IEEE Trans. Computers 25(1): 103 (1976) |
| 1975 |
|---|
| 3 | | Frank Rubin:
An Improved Algorithm for Testing the Planarity of a Graph.
IEEE Trans. Computers 24(2): 113-121 (1975) |
| 2 | | Frank Rubin:
Worst Case Bounds for Maximal Compatible Subsets.
IEEE Trans. Computers 24(8): 830-831 (1975) |
| 1974 |
|---|
| 1 | | Frank Rubin:
A Search Procedure for Hamilton Paths and Circuits.
J. ACM 21(4): 576-580 (1974) |
