WFLP
2009
Springer
15 years 8 days ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
WFLP
2009
Springer
15 years 8 days ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate tra...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
WDAG
2009
Springer
15 years 8 days ago
2009
Springer
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...