F. Rubin

Available identifiers

Publication	Date of Publication	Type
An improved method for finding knight covers.	2007-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q5466032	2005-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4214155	2004-02-13	Paper
DESIGNING A HIGH-SECURITY CIPHER	1997-08-28	Paper
ONE-TIME PAD CRYPTOGRAPHY	1997-01-07	Paper
MESSAGE AUTHENTICATION USING QUADRATIC RESIDUES	1997-01-06	Paper
THE QUADRATIC AND DOUBLE QUADRATIC RESIDUE CIPHERS	1995-12-18	Paper
Arithmetic stream coding using fixed precision registers	1979-01-01	Paper
CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES	1979-01-01	Paper
Decrypting a Stream Cipher Based on J–K Flip-Flops	1979-01-01	Paper
Enumerating all simple paths in a graph	1978-01-01	Paper
Correction to ``The Lee Path Connection Algorithm	1976-01-01	Paper
The Measure of Recognizable Sets of Real Numbers	1976-01-01	Paper
Partition of Integers	1976-01-01	Paper
Worst Case Bounds for Maximal Compatible Subsets	1975-01-01	Paper
An Improved Algorithm for Testing the Planarity of a Graph	1975-01-01	Paper
A Search Procedure for Hamilton Paths and Circuits	1974-01-01	Paper
The Lee Path Connection Algorithm	1974-01-01	Paper
A note on Lerda and Majorani's minimum crossing algorithm	1974-01-01	Paper

This page was built for person: F. Rubin