ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...