Sciweavers

456 search results - page 86 / 92
» On Routing in Distributed Hash Tables
Sort
View
CCS
2005
ACM
15 years 3 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
HPCA
2000
IEEE
15 years 1 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
73
Voted
PPOPP
2010
ACM
14 years 11 months ago
Helper locks for fork-join parallel programming
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
76
Voted
CN
2008
100views more  CN 2008»
14 years 9 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
109
Voted
CCR
2007
119views more  CCR 2007»
14 years 9 months ago
Exploiting KAD: possible uses and misuses
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer traffic makes a major fraction of the total traffic seen in the Internet. The dominating ...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...