8699 search results - page 137 / 1740 » Elements of the Theory of Computation |
217
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
127
click to vote
CIE
2007
Springer
16 years 19 days ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
177
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
CHI
2007
ACM
16 years 6 months ago
2007
ACM