Sciweavers

906 search results - page 126 / 182
» Linking Theories of Concurrency
Sort
View
JCT
1998
193views more  JCT 1998»
14 years 9 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
WWW
2004
ACM
15 years 10 months ago
Anti-aliasing on the web
It is increasingly common for users to interact with the web using a number of different aliases. This trend is a doubleedged sword. On one hand, it is a fundamental building bloc...
Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
ICFP
2008
ACM
15 years 9 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
SPAA
2003
ACM
15 years 3 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler