116 search results - page 14 / 24 » A practical access to the theory of parallel algorithms |
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...