The following pages link to F. Rubin (Q1211998):
Displayed 19 items.
- A note on Lerda and Majorani's minimum crossing algorithm (Q1211999) (← links)
- CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES (Q3206867) (← links)
- Arithmetic stream coding using fixed precision registers (Q3856604) (← links)
- The Lee Path Connection Algorithm (Q4042860) (← links)
- A Search Procedure for Hamilton Paths and Circuits (Q4044618) (← links)
- An Improved Algorithm for Testing the Planarity of a Graph (Q4051590) (← links)
- Worst Case Bounds for Maximal Compatible Subsets (Q4067009) (← links)
- Correction to ``The Lee Path Connection Algorithm'' (Q4077757) (← links)
- The Measure of Recognizable Sets of Real Numbers (Q4103763) (← links)
- Partition of Integers (Q4111959) (← links)
- Enumerating all simple paths in a graph (Q4159088) (← links)
- Decrypting a Stream Cipher Based on J–K Flip-Flops (Q4198638) (← links)
- (Q4214155) (← links)
- DESIGNING A HIGH-SECURITY CIPHER (Q4351526) (← links)
- THE QUADRATIC AND DOUBLE QUADRATIC RESIDUE CIPHERS (Q4858710) (← links)
- MESSAGE AUTHENTICATION USING QUADRATIC RESIDUES (Q4892515) (← links)
- (Q5310259) (← links)
- (Q5466032) (← links)
- ONE-TIME PAD CRYPTOGRAPHY (Q5690656) (← links)