101 search results - page 1 / 21 » An Efficient Algorithm for Solving the Dyck-CFL Reachability... |
ESOP
2009
Springer
15 years 2 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
PLDI
2004
ACM
15 years 3 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...
157
click to vote
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
68
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
IJCAI
2003
14 years 11 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...