92 search results - page 12 / 19 » Maximal repetitions in strings |
SPIRE
2001
Springer
13 years 11 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
TC
1998
13 years 6 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
CRYPTO
2007
Springer
14 years 27 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
SCCC
2002
IEEE
13 years 11 months ago
2002
IEEE
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
EUROCRYPT
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...