STACS
2009
Springer
13 years 9 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
STACS
2009
Springer
13 years 9 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
STACS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
STACS
2009
Springer
13 years 9 months ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
STACS
2009
Springer
13 years 9 months ago
2009
Springer
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
STACS
2009
Springer
13 years 11 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...