1274 search results - page 69 / 255 » New Proofs for |
106
click to vote
RSA
2000
15 years 12 days ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
89
Voted
DM
1998
15 years 10 days ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
JCT
2010
14 years 11 months ago
2010
We prove a vector space analog of a version of the Kruskal-Katona theorem due to Lov´asz. We apply this result to extend Frankl’s theorem on r-wise intersecting families to vec...
199
Voted
POPL
2006
ACM
16 years 29 days ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
82
Voted
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family. Converse...