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...
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...
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition r...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...
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...
Constantinos Daskalakis, Christos H. Papadimitriou
d abstract) Michael Benedikt Bell Labs Jan Van den Bussche Limburgs Universitair Centrum Christof L?oding Lehrstuhl Informatik VII RWTH Aachen Thomas Wilke Institut f?ur Informatik...