Sciweavers

Share
STACS
2009
Springer
8 years 8 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
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 ...
Mahdi Cheraghchi, Amin Shokrollahi
STACS
2009
Springer
8 years 8 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
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...
Andre Gronemeier
STACS
2009
Springer
8 years 8 months ago
An Order on Sets of Tilings Corresponding to an Order on Languages
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...
Nathalie Aubrun, Mathieu Sablik
STACS
2009
Springer
8 years 8 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
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...
Nicole Schweikardt
STACS
2009
Springer
8 years 8 months ago
On the Borel Inseparability of Game Tree Languages
Szczepan Hummel, Henryk Michalewski, Damian Niwins...
STACS
2009
Springer
8 years 11 months ago
On Local Symmetries and Universality in Cellular Automata
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...
Laurent Boyer, Guillaume Theyssier
STACS
2009
Springer
8 years 11 months ago
Generating Shorter Bases for Hard Random Lattices
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...
Joël Alwen, Chris Peikert
STACS
2009
Springer
8 years 11 months ago
Fragments of First-Order Logic over Infinite Words
Volker Diekert, Manfred Kufleitner
STACS
2009
Springer
8 years 11 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
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...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
books