11345 search results - page 1580 / 2269 » Foundations of Computer Science |
223
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
191
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
178
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
201
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
232
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...