1002 search results - page 130 / 201 » Towards Graph Programs for Graph Algorithms |
109
click to vote
SCAM
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
108
click to vote
POPL
2000
ACM
15 years 6 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
101
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
137
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
132
click to vote
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...