123
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
163
click to vote
STACS
2004
Springer
15 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...
121
click to vote
STACS
2004
Springer
15 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...
162
click to vote
STACS
2004
Springer
15 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 ...
114
click to vote
STACS
2004
Springer
15 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...
160
click to vote
STACS
2004
Springer
15 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 ...
120
click to vote
STACS
2004
Springer
15 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...
119
click to vote
STACS
2004
Springer
15 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...