Sciweavers

5580 search results - page 754 / 1116
» Randomized priority algorithms
Sort
View
171
Voted
PODC
2004
ACM
15 years 9 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
125
Voted
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
15 years 9 months ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
128
Voted
SPAA
1997
ACM
15 years 8 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
143
Voted
PODC
2010
ACM
15 years 7 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
138
Voted
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 5 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate