13306 search results - page 414 / 2662 » Theoretical Computer Science |
144
Voted
STACS
2004
Springer
16 years 6 days 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...
199
click to vote
STACS
2004
Springer
16 years 6 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 ...
147
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e.,...
173
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
191
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...