434 search results - page 43 / 87 » Logical Analysis of Hash Functions |
110
Voted
ICSOC
2009
Springer
14 years 10 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
111
Voted
SIGCOMM
2006
ACM
15 years 6 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
108
Voted
ALGORITHMICA
1998
15 years 5 days ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
108
click to vote
SAS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...