4103 search results - page 294 / 821 » Some results on the Collatz problem |
163
click to vote
ACISP
2005
Springer
16 years 11 days ago
2005
Springer
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
165
Voted
ICAD
2004
15 years 8 months ago
2004
Previous work on the production and test of various sonifications has shown that adding a sonification to an interface can assist the execution of a variety of operator tasks [1,2...
192
click to vote
DRM
2003
Springer
16 years 1 days ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
170
click to vote
CP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
162
click to vote
DKE
2008
15 years 7 months ago
2008
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...