43 search results - page 4 / 9 » tcs 2011 |
TCS
2011
13 years 5 days ago
2011
This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifie...
TCS
2011
13 years 5 days ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
TCS
2011
13 years 5 days ago
2011
The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
TCS
2011
13 years 5 days ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
TCS
2011
13 years 5 days ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...