1 - 4 of 4 articles
We study the wireless scheduling problem in the SINR model. More specifically, given a set of
links, each a sender–receiver pair, we wish to partition (or schedule) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous...
We revisit the classic problem of spreading a piece of information in a group of
fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasieniec and Pelc (Parallel Comput 22:903–912, 1996), we derive for the first time protocols that (i) use a...
Imitating successful behavior is a natural and frequently applied approach when facing complex decision problems. In this paper, we design protocols for distributed latency minimization in atomic congestion games based on imitation. We propose to study concurrent dynamics that emerge when each...
Given a distributed system of
bins, how evenly can we distribute the balls to the bins, minimizing communication? The fastest non-adaptive and symmetric algorithm achieving a constant maximum bin load requires
$$\varTheta (\log \log n)$$
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.