CORR
2006
Springer
15 years 22 days ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
85
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
116
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
51
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
95
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Reputation and recommendation systems are fundamental for the formation of community market places. Yet, they are easy targets for attacks which disturb a market's equilibriu...
105
click to vote
CORR
2006
Springer
15 years 22 days ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
CORR
2006
Springer
15 years 22 days ago
2006
Springer
64
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
53
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
71
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer