10890 search results - page 1975 / 2178 » Automatic Complexity Analysis |
114
Voted
SIGSOFT
2008
ACM
16 years 3 months ago
2008
ACM
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
129
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
134
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
131
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
127
Voted
HPCA
2006
IEEE
16 years 3 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...