Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STACS
2009
Springer
10 years 8 months ago
Qualitative Reachability in Stochastic BPA Games
Tomás Brázdil, Václav Brozek,...
STACS
2009
Springer
10 years 8 months ago
Locally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that ...
Jop Briet, Ronald de Wolf
STACS
2009
Springer
10 years 8 months ago
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
Jérémy Barbay, Gonzalo Navarro
STACS
2009
Springer
10 years 8 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
STACS
2009
Springer
10 years 8 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
STACS
2009
Springer
10 years 8 months ago
Improved Approximations for Guarding 1.5-Dimensional Terrains
Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevi...
STACS
2009
Springer
10 years 8 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
STACS
2009
Springer
10 years 8 months ago
Optimal Cache-Aware Suffix Selection
Gianni Franceschini, Roberto Grossi, S. Muthukrish...
STACS
2009
Springer
10 years 8 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
STACS
2009
Springer
10 years 8 months ago
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngo...
books