13306 search results - page 405 / 2662 » Theoretical Computer Science |
164
click to vote
STACS
2007
Springer
16 years 29 days ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
174
click to vote
TLCA
2007
Springer
16 years 29 days ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
208
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
177
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
142
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...