1002 search results - page 164 / 201 » Towards Graph Programs for Graph Algorithms |
100
click to vote
SIGCSE
1997
ACM
15 years 6 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
150
click to vote
SOSP
2009
ACM
15 years 11 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
143
click to vote
SIGSOFT
2010
ACM
14 years 8 months ago
2010
ACM
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
106
click to vote
TOPLAS
2008
15 years 1 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...