Skip to search formSkip to main contentSkip to account menu

Buffer overflow management in QoS switches

It is proved that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm, and the competitive ratio of any online algorithm for a uniform bounded delay buffer is bounded away from 1, independent of the delay size.
View on ACM (opens in a new tab)

Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

It is shown that O(log |X|) colors suffice for set systems in which X is a set of points in the plane and the sets are intersections of X with scaled translations of a convex region.
View on IEEE (opens in a new tab)

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

It is shown that there are adversary strategies which force the expected cover time of a simple random walk on connected dynamic graphs to be exponential, and a simple strategy is provided, the lazyrandom walk, that guarantees polynomial cover time regardless of the changes made by the adversary.
View via Publisher (opens in a new tab)

Homophily and the Glass Ceiling Effect in Social Networks

This model consists of a network composed of two types of vertices, representing two sub-populations, and accommodates three well known social phenomena: (i) the "rich get richer" mechanism, (ii) a minority-majority partition, and (iii) homophily.
View on ACM (opens in a new tab)

Many random walks are faster than one

The cover time is studied and it is shown that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks.
View on ACM (opens in a new tab)

Improved Distributed Approximate Matching

A distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times and another algorithm which provides (½-ε) approximation in general graphs in O(logε-1log n) time, improving on the previously known algorithms.
View on ACM (opens in a new tab)

Collaborative search on the plane without communication

The Ants Nearby Treasure Search (ANTS) problem is introduced, a generalization of the classical cow-path problem, which is relevant for collective foraging in animal groups, and a uniform algorithm is proposed that is both efficient and extremely simple, suggesting its relevance for actual biological scenarios.
View on ACM (opens in a new tab)

Many Random Walks Are Faster Than One†

The cover time is studied and it is shown that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks.
View on Cambridge Press (opens in a new tab)

Nearly optimal FIFO buffer management for DiffServ

An on-line algorithm whose competitive ratio is approximately 1.30 for the worst case α is presented, which is close to the best previous general upper bound of about 1.888.
View on ACM (opens in a new tab)

Distributed MST for constant diameter graphs

It is shown that the number of communication rounds necessary to compute a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model can be as high as $$\Omega(\sqrt[3]n/\sqrt{B})$$ and $$Omega(-1)n/B)$$, and the asymptotic lower bounds hold for randomized algorithms as well.
View on ACM (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)