TCS
2012
12 years 7 months ago
2012
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
TCS
2012
12 years 7 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
STACS
2012
Springer
12 years 7 months ago
2012
Springer
STACS
2012
Springer
12 years 7 months ago
2012
Springer
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
STACS
2012
Springer
12 years 7 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
SOFSEM
2012
Springer
12 years 7 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...