6607 search results - page 987 / 1322 » Making TeX Work |
179
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
195
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
168
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
168
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
168
click to vote
OSDI
2006
ACM
16 years 7 months ago
2006
ACM
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...