STACS
2004
Springer
13 years 10 months 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...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...
STACS
2004
Springer
13 years 10 months 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 ...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
STACS
2004
Springer
13 years 10 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
STACS
2004
Springer
13 years 10 months 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 ...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Under the robot model, we show that a robot needs Ω(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorith...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...