STACS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
SOFSEM
2010
Springer
13 years 5 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
SOFSEM
2010
Springer
13 years 5 months ago
2010
Springer
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
SOFSEM
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We give a high-level survey of the "testing by implicit learning" paradigm, and explain some of the property testing results for various Boolean function classes that ha...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We survey here property testing results for the so called 'massively parametrized' model (or problems). This paper is based on a survey talk gave at the workshop on prop...
PROPERTYTESTING
2010
13 years 5 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
PROPERTYTESTING
2010
13 years 5 months ago
2010
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...