1969 search results - page 234 / 394 » Financial Theory 1 |
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
161
click to vote
COMBINATORICA
2007
15 years 5 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
162
click to vote
JCT
2007
15 years 5 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
185
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
146
click to vote
TCS
2010
15 years 4 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...