2168 search results - page 274 / 434 » Randomized Algorithms and Complexity Theory |
120
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
129
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
125
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
136
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
123
Voted
HIPC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...