We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators compu...
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...