26 search results - page 3 / 6 » Counting by Coin Tossings |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
ADHOCNOW
2004
Springer
14 years 1 months ago
2004
Springer
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Book
"A random or stochastic process is a mathematical model for a phenomenon
that evolves in time in an unpredictable manner from the viewpoint of the
observer. The phenomenon m...
IMA
2003
Springer
14 years 24 days ago
2003
Springer
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...