13306 search results - page 348 / 2662 » Theoretical Computer Science |
179
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
193
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
176
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
171
click to vote
DLT
2009
15 years 4 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
154
click to vote
DLT
2009
15 years 4 months ago
2009
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...