4172 search results - page 769 / 835 » Computing Machinery and Understanding |
169
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
105
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
150
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
168
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...