10271 search results - page 1953 / 2055 » Computer Science |
126
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
117
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
100
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
114
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
78
Voted
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...