ICALP

2011

Springer

13 years 1 months ago
2011

Springer

act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We deﬁne a novel notion of weak ...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, ﬁnd a maximu...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

We present an O( √ n log n)-approximation algorithm for the problem of ﬁnding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...

ICALP

2011

Springer

13 years 1 months ago
2011

Springer

We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...