198
click to vote
STACS
16 years 1 days ago
2004 Springer 
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...
193
click to vote
STACS
16 years 1 days ago
2004 Springer 
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 ...
188
Voted
STACS
16 years 1 days ago
2004 Springer 
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...
188
click to vote
STACS
16 years 1 days ago
2004 Springer 
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 ...
185
click to vote
STACS
16 years 1 days ago
2004 Springer
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...
|
Theoretical Computer Science