The SCEAS System
Navigation Menu

Search the dblp DataBase


Frank Rubin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  10. An Improved Method for Finding Knight Covers. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002