Sciweavers

STACS
2004
Springer
15 years 2 months ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
STACS
2004
Springer
15 years 2 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
STACS
2004
Springer
15 years 2 months ago
A Lower Bound on the Competitive Ratio of Truthful Auctions
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
Andrew V. Goldberg, Jason D. Hartline, Anna R. Kar...
STACS
2004
Springer
15 years 2 months ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
STACS
2004
Springer
15 years 2 months ago
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
Theoretical Computer Science
Top of PageReset Settings