2016 search results - page 313 / 404 » Megamaps: Construction and Examples |
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
CIKM
2011
Springer
12 years 10 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
CLUSTER
2011
IEEE
12 years 9 months ago
2011
IEEE
—Atomic operations are important building blocks in supporting general-purpose computing on graphics processing units (GPUs). For instance, they can be used to coordinate executi...
IACR
2011
12 years 9 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
PPOPP
2012
ACM
12 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...