973 search results - page 53 / 195 » New Bounds on Crossing Numbers |
123
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
FSE
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
FSE
2006
Springer
15 years 3 months ago
2006
Springer
We present PEP, which is a new construction of a tweakable strong pseudo-random permutation. PEP uses a hash-encrypt-hash approach which has recently been used in the construction...
124
click to vote
COCOON
2005
Springer
15 years 1 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
TIT
1998
14 years 11 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...