Frank Rubin

According to our database1, Frank Rubin authored at least 27 papers between 1973 and 2007.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
An Improved Method for Finding Knight Covers.
Ars Comb., 2007

2003
Improved Knight Coverings.
Ars Comb., 2003

1996
One-Time Pad Cryptography.
Cryptologia, 1996

Designing a High-Security Cipher.
Cryptologia, 1996

1995
Message Authentication Using Quadratic residues.
Cryptologia, 1995

The Quadratic and Double Quadratic Residue Ciphers.
Cryptologia, 1995

1994
Comments on "Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms".
Cryptologia, 1994

1988
The Cryptographic Uses of Post Tag Systems.
Cryptologia, 1988

1987
Foiling an Exhaustive Key-Search Attack.
Cryptologia, 1987

1986
Foiling the Known-Plaintext Attack.
Cryptologia, 1986

1983
A logic design front-end for improved engineering productivity.
Proceedings of the 20th Design Automation Conference, 1983

1981
Further Comments on "An Optimal Solution for the Channel-Assignment Problem".
IEEE Trans. Computers, 1981

Decrypting a Stream Cipher Based on j-k Flip-Flops.
Cryptologia, 1981

1979
Arithmetic stream coding using fixed precision registers.
IEEE Trans. Inf. Theory, 1979

Decrypting a Stream Cipher Based on <i>J-K</i> Flop-Flops.
IEEE Trans. Computers, 1979

Cryptographic Aspects of Data Compression Codes.
Cryptologia, 1979

Solving a Cipher Based on Multiple Random Number Streams.
Cryptologia, 1979

1978
Computer Methods for Decrypting Random Stream Ciphers.
Cryptologia, 1978

Computer Methods for Decrypting Multiplex Ciphers.
Cryptologia, 1978

1976
Partition of Integers.
ACM Trans. Math. Softw., 1976

Generation of Nonparametric Curves.
IEEE Trans. Computers, 1976

Experiments in Text File Compression.
Commun. ACM, 1976

1975
An Improved Algorithm for Testing the Planarity of a Graph.
IEEE Trans. Computers, 1975

Worst Case Bounds for Maximal Compatible Subsets.
IEEE Trans. Computers, 1975

1974
A Search Procedure for Hamilton Paths and Circuits.
J. ACM, 1974

An iterative technique for printed wire routing.
Proceedings of the 11th Design Automation Workshop, 1974

1973
Assigning wires to layers of a printed circuit board.
Proceedings of the 10th Design Automation Workshop, 1973


  Loading...