ALGORITHMICA
2008
13 years 11 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
ALGORITHMICA
2008
13 years 11 months ago
2008
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
ALGORITHMICA
2008
13 years 11 months ago
2008
ALGORITHMICA
2008
13 years 11 months ago
2008
ALGORITHMICA
2008
13 years 11 months ago
2008
ALGORITHMICA
2008
13 years 11 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
ALGORITHMICA
2008
13 years 11 months ago
2008
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid Algorithms, both on polynomials and on integer numbers. We study in particular the d...
ALGORITHMICA
2008
13 years 11 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
ALGORITHMICA
2008
13 years 11 months ago
2008
ALGORITHMICA
2008
13 years 11 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...