Sciweavers

STACS
2012
Springer
14 years 8 days ago
Linear-Space Data Structures for Range Mode Query in Arrays
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...
Timothy M. Chan, Stephane Durocher, Kasper Green L...
STACS
2012
Springer
14 years 8 days ago
Stabilization of Branching Queueing Networks
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...
Tomás Brázdil, Stefan Kiefer
STACS
2012
Springer
14 years 8 days ago
On Computing Pareto Stable Assignments
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...
Ning Chen
STACS
2012
Springer
14 years 8 days ago
Low Randomness Rumor Spreading via Hashing
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...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
177
Voted
SOFSEM
2012
Springer
14 years 8 days ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
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...
Peter Damaschke, Azam Sheikh Muhammad
SOFSEM
2012
Springer
14 years 8 days ago
Visibly Pushdown Transducers with Look-Ahead
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...
Emmanuel Filiot, Frédéric Servais
150
Voted
SOFSEM
2012
Springer
14 years 8 days ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
SOFSEM
2012
Springer
14 years 8 days ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
SOFSEM
2012
Springer
14 years 8 days ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
SOFSEM
2012
Springer
14 years 8 days ago
RESTGroups for Resilient Web Services
Service resilience, defined as the continued availability of a service despite failures and other negative changes in its environment, is vital in many systems. It is typically ac...
Tadeusz Kobus, Pawel T. Wojciechowski