10447 search results - page 2023 / 2090 » The Philosophy of Computer Science |
108
Voted
ICALP
2007
Springer
15 years 7 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...
99
Voted
IPSN
2007
Springer
15 years 7 months ago
2007
Springer
We introduce a novel laser spectroscopic trace-gas sensor platform, LaserSPECks that integrates recently developed miniature quartz-enhanced photoacoustic spectroscopy (QEPAS) gas...
89
Voted
MFCS
2007
Springer
15 years 7 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...
MFCS
2007
Springer
15 years 7 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...
67
Voted
MFCS
2007
Springer
15 years 7 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...