MST
2011
13 years 2 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
MST
2011
13 years 6 months ago
2011
MST
2011
13 years 6 months ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
MST
2011
13 years 6 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
MST
2011
13 years 6 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
MST
2011
13 years 6 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
MST
2011
13 years 6 months ago
2011
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
MST
2011
13 years 6 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
MST
2011
13 years 6 months ago
2011
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
MST
2011
13 years 6 months ago
2011
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...