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
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
STACS
2009
Springer
10 years 8 months ago
The Price of Anarchy in Cooperative Network Creation Games
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...
STACS
2009
Springer
10 years 8 months ago
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. ...
STACS
2009
Springer
10 years 8 months ago
Ambiguity and Communication
Juraj Hromkovic, Georg Schnitger
STACS
2009
Springer
10 years 8 months ago
Testing Linear-Invariant Non-Linear Properties
Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Nin...
STACS
2009
Springer
10 years 8 months ago
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...
STACS
2009
Springer
10 years 8 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
STACS
2009
Springer
10 years 8 months ago
Undecidable Properties of Limit Set Dynamics of Cellular Automata
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
Pietro di Lena, Luciano Margara
books