default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Rubin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j24]Frank Rubin:
An Improved Method for Finding Knight Covers. Ars Comb. 82 (2007)- 2003
- [j23]Frank Rubin:
Improved Knight Coverings. Ars Comb. 69 (2003)
1990 – 1999
- 1996
- [j22]Frank Rubin:
Designing a High-Security Cipher. Cryptologia 20(3): 247-257 (1996) - [j21]Frank Rubin:
One-Time Pad Cryptography. Cryptologia 20(4): 359-364 (1996) - 1995
- [j20]Frank Rubin:
The Quadratic and Double Quadratic Residue Ciphers. Cryptologia 19(3): 275-284 (1995) - [j19]Frank Rubin:
Message Authentication Using Quadratic residues. Cryptologia 19(4): 397-404 (1995) - 1994
- [j18]Frank Rubin:
Comments on "Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms". Cryptologia 18(2): 153-154 (1994)
1980 – 1989
- 1988
- [j17]Frank Rubin:
The Cryptographic Uses of Post Tag Systems. Cryptologia 12(1): 25-33 (1988) - 1987
- [j16]Frank Rubin:
Foiling an Exhaustive Key-Search Attack. Cryptologia 11(2): 102-107 (1987) - 1986
- [j15]Frank Rubin:
Foiling the Known-Plaintext Attack. Cryptologia 10(4): 217-223 (1986) - 1983
- [c3]Frank Rubin, Paul W. Horstmann:
A logic design front-end for improved engineering productivity. DAC 1983: 239-245 - 1981
- [j14]Frank Rubin:
Decrypting a Stream Cipher Based on j-k Flip-Flops. Cryptologia 5(1): 51-57 (1981) - [j13]Frank Rubin:
Further Comments on "An Optimal Solution for the Channel-Assignment Problem". IEEE Trans. Computers 30(6): 455 (1981)
1970 – 1979
- 1979
- [j12]Frank Rubin:
Solving a Cipher Based on Multiple Random Number Streams. Cryptologia 3(3): 155-157 (1979) - [j11]Frank Rubin:
Cryptographic Aspects of Data Compression Codes. Cryptologia 3(4): 202-205 (1979) - [j10]Frank Rubin:
Decrypting a Stream Cipher Based on J-K Flop-Flops. IEEE Trans. Computers 28(7): 483-487 (1979) - [j9]Frank Rubin:
Arithmetic stream coding using fixed precision registers. IEEE Trans. Inf. Theory 25(6): 672-675 (1979) - 1978
- [j8]Frank Rubin:
Computer Methods for Decrypting Multiplex Ciphers. Cryptologia 2(2): 152-160 (1978) - [j7]Frank Rubin:
Computer Methods for Decrypting Random Stream Ciphers. Cryptologia 2(3): 215-231 (1978) - 1976
- [j6]Frank Rubin:
Experiments in Text File Compression. Commun. ACM 19(11): 617-623 (1976) - [j5]Frank Rubin:
Generation of Nonparametric Curves. IEEE Trans. Computers 25(1): 103 (1976) - [j4]Frank Rubin:
Partition of Integers. ACM Trans. Math. Softw. 2(4): 364-374 (1976) - 1975
- [j3]Frank Rubin:
An Improved Algorithm for Testing the Planarity of a Graph. IEEE Trans. Computers 24(2): 113-121 (1975) - [j2]Frank Rubin:
Worst Case Bounds for Maximal Compatible Subsets. IEEE Trans. Computers 24(8): 830-831 (1975) - 1974
- [j1]Frank Rubin:
A Search Procedure for Hamilton Paths and Circuits. J. ACM 21(4): 576-580 (1974) - [c2]Frank Rubin:
An iterative technique for printed wire routing. DAC 1974: 308-313 - 1973
- [c1]Frank Rubin:
Assigning wires to layers of a printed circuit board. DAC 1973: 22-32
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
