1002 search results - page 142 / 201 » Towards Graph Programs for Graph Algorithms |
100
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
122
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
145
click to vote
MICRO
2009
IEEE
15 years 9 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
139
click to vote
PPOPP
1997
ACM
15 years 6 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
132
click to vote
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...